A Refined Search Tree Technique for DOMINATING SET on Planar Graphs

A Refined Search Tree Technique for DOMINATING SET on Planar Graphs (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jochen Alber , Henning Fernau , Rolf Niedermeier , Hongbing Fan , Michael R. Fellows , Fran Rosamond , Ulrike Stege

Citations:

33 - 11 self

BibTeX

@MISC{Alber03arefined,
    author = {Jochen Alber and Henning Fernau and Rolf Niedermeier and Hongbing Fan and Michael R. Fellows and Fran Rosamond and Ulrike Stege},
    title = {A Refined Search Tree Technique for DOMINATING SET on Planar Graphs},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
697	Fellows M: Parameterized Complexity - Downey - 1999
519	A threshold of ln n for approximating set cover - Feige - 1998
514	Graph Theory - Diestel - 2000
260	Approximation algorithms for NP-complete problems on planar graphs - Baker - 1994
141	Vertex cover: Further observations and further improvements - Chen, Kanj, et al.
93	Fixed parameter algorithms for dominating set and related problems on planar graphs - Alber, Bodlaender, et al.
72	Introduction to Graph Theory, Second Edition - West - 2001
63	Parameterized complexity: A framework for systematically confronting computational intractability - Downey, Fellows, et al. - 1999
60	Parameterized complexity: exponential speed-up for planar graph problems - Alber, Fernau, et al. - 2004
58	Dominating sets in planar graphs: Branchwidth and exponential speed-up - Fomin, Thilikos
57	Parameterized computational feasibility - Downey, Fellows - 1992
43	Upper bounds for vertex cover further improved - Niedermeier, Rossmanith - 1999
39	Graph Theory,” Second Edition - Diestel - 2000
37	A general method to speed up fixedparameter-tractable algorithms - Niedermeier, Rossmanith - 2000
34	Polynomial-time data reduction for Dominating Set - Alber, Fellows, et al.
32	Fixed parameter algorithms for planar dominating set and related problems - Alber, Bodlaender, et al. - 2000
30	Thilikos, Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs - Demaine, Fomin, et al.
29	Graph separators: A parameterized view - Alber, Fernau, et al.
27	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs - Demaine, Fomin, et al.
20	Bidimensional parameters and local tree-width - Demaine, Hajiaghayi, et al. - 2004
20	On efficient fixed-parameter algorithms for weighted vertex cover - Niedermeier, Rossmanith
17	Experiments on data reduction for optimal domination in networks - Alber, Betzler, et al.
17	The Dominating Set problem is fixed parameter tractable for graphs of bounded genus - Ellis, Fan, et al.
13	A simple and fast approach for solving problems on planar graphs - Fomin, Thilikos - 2004
10	Exact Algorithms for NP-hard Problems on Networks - Alber - 2003
9	Thilikos, Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors - Demaine, Hajiaghayi, et al.
5	E#cient data reduction for Dominating Set: A linear problem kernel for the planar case - Alber, Fellows, et al. - 2002
4	Dominating sets and local treewidth - Fomin, Thilikos - 2003
3	A general method to speed up algorithms - Niedermeier, Rossmanith - 2000
1	Graph separators: a parameterized view. Technical Report WSI{2001-8, Universitat Tubingen (Fed. Rep. of Germany), Wilhelm-Schickard-Institut fur Informatik, 2001. Extended abstract - Alber, Fernau, et al.
1	Taghi Hajiaghayi, D.M. Thilikos, Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs - Demaine, Fomin, et al. - 2003
1	Taghi Hajiaghayi, D.M. Thilikos, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs - Demaine, Fomin, et al.
1	Taghi Hajiaghayi, D.M. Thilikos, Bidimensional parameters and local treewidth - Demaine, Fomin, et al. - 2004
1	Taghi Hajiaghayi, D.M. Thilikos, Exponential speedup of fixed-parameter algorithms on K3,3-minorfree or K5-minor-free graphs - Demaine, M