Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Fedor V. Fomin , Dimitrios M. Thilikos

Citations:

58 - 15 self

BibTeX

@INPROCEEDINGS{Fomin02dominatingsets,
    author = {Fedor V. Fomin and Dimitrios M. Thilikos},
    title = {Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up},
    booktitle = {},
    year = {2002},
    pages = {168--177}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance.

Citations

697	Fellows M: Parameterized Complexity - Downey - 1999
144	Graph minors. X. Obstructions to tree-decomposition - Robertson, Seymour - 1991
117	Slater: Fundamentals of Domination in Graphs - Haynes, Hedetniemi, et al. - 1998
94	Quickly excluding a planar graph - Robertson, Seymour, et al. - 1994
93	Fixed parameter algorithms for dominating set and related problems on planar graphs - Alber, Bodlaender, et al.
81	Call routing and the ratcatcher - Seymour, Thomas
60	Parameterized complexity: exponential speed-up for planar graph problems - Alber, Fernau, et al. - 2004
36	Branch width and well-quasiordering in matroids and graphs (preprint July 11 - Geelen, Gerards, et al. - 2000
33	A refined search tree technique for Dominating Set on planar graphs - Alber, Fan, et al. - 2005
32	Fixed parameter algorithms for planar dominating set and related problems - Alber, Bodlaender, et al. - 2000
27	Improved tree decomposition based algorithms for domination-like problems - Alber, Niedermeier - 2002
27	Improved parameterized algorithms for planar dominating set - Kanj, Perković
24	Planar separators - Alon, Seymour, et al. - 1994
23	Thilikos, Graphs with branchwidth at most three - Bodlaender, M - 1999
22	Efficient data reduction for dominating set: A linear problem kernel for the planar case - Alber, Fellows, et al. - 2002
21	Maximum clique transversals - Chang, Kloks, et al. - 2001
21	New algorithms for k-face cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs - Kloks, Lee, et al.
19	branch-width and Tseitin tautologies, in - Alekhnovich, Razborov, et al.
14	Thilikos, Exponential speedup of fixed parameter algorithms on K3,3-minor-free or K5-minor-free graphs - Demaine, Hajiaghayi, et al.
14	Branch Decompositions and their applications - Hicks - 2000
11	Thilikos, New upper bounds on the decomposability of planar graphs - Fomin, M
8	P.D.: An algorithm for the ring-routing problem. Bellcore technical memorandum, Bellcore - Cook, Seymour - 1994
6	Feedback vertex sets and disjoint cycles in planar (di)graphs - Kloks, Lee, et al. - 2001
4	Parameterized tractability of some (efficient) Y -domination variants for planar graphs and t-degenerate graphs - Kloks, Cai - 2000
3	parse trees, and second-order monadic logic for matroids over finite fields - Hlineny, Branch-width - 2003
3	Parameterized tractability of some (ecient) Y -domination variants for planar graphs and t-degenerate graphs - Kloks, Cai - 2000
3	Fernau Niedermeier, Refined search tree technique for dominating set on planar graphs - Alber, Fan, et al. - 2000
1	Thilikos, An upper bound on the decomposability of planar graphs, Techical Report, Departament de Llenguatges i Sistemes Inform`atics, Universitat Polit`ecnica de Catalunya - Fomin, M - 2002