Author:
Alber Jochen,Fan Hongbing,Fellows Michael R.,Fernau Henning,Niedermeier Rolf,Rosamond Fran,Stege Ulrike
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference28 articles.
1. J. Alber, Exact Algorithms for NP-hard Problems on Networks: Design, Analysis, and Implementation, Ph.D. Thesis, Universität Tübingen, Germany, January 2003.
2. Experiments on data reduction for optimal domination in networks;Alber,2003
3. Fixed parameter algorithms for dominating set and related problems on planar graphs;Alber;Algorithmica,2002
4. Polynomial-time data reduction for Dominating Set;Alber;J. ACM,2004
5. Graph separators;Alber;J. Comput. System Sci.,2003
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems;SIAM Journal on Discrete Mathematics;2023-11-10
2. An Improved Approximate Greedy Algorithm for Vertex Covering;2022 5th International Conference on Machine Learning and Machine Intelligence;2022-09-23
3. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12
4. Multistage graph problems on a global budget;Theoretical Computer Science;2021-05
5. Parameterized algorithms of fundamental NP-hard problems: a survey;Human-centric Computing and Information Sciences;2020-07-02