Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (2001)

by Jochen Alber , Henning Fernau , Rolf Niedermeier
Venue:in Electronic Colloquium on Computational Complexity (ECCC
Citations:60 - 21 self

Active Bibliography

30 Graph separators: a parameterized view – Jochen Alber, Henning Fernau, Rolf Niedermeier - 2001
3 On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover – Rolf Niedermeier, Peter Rossmanith - 2000
1 Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms – Rolf Niedermeier - 2004
13 Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs – Jochen Alber, Frederic Dorn, Rolf Niedermeier - 2004
105 Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs – Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier - 2002
4 Algorithms for Graphs of (Locally) Bounded Treewidth – Mohammadtaghi Hajiaghayi - 2001
35 Fixed parameter algorithms for planar dominating set and related problems – Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier - 2000
9 An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover – Henning Fernau, Rolf Niedermeier
36 A Refined Search Tree Technique for DOMINATING SET on Planar Graphs – Jochen Alber, Henning Fernau, Rolf Niedermeier, Hongbing Fan, Michael R. Fellows, Fran Rosamond, Ulrike Stege - 2003
36 Subexponential Parameterized Algorithms Collapse the W-hierarchy (Extended Abstract) – Liming Cai, David Juedes - 2001
25 Approximation Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors – Erik D. Demaine, Mohammadtaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
36 New Upper Bounds for Maximum Satisfiability – Rolf Niedermeier, Peter Rossmanith - 1999
5 Fast approximation schemes for K_{3,3}-minor-free or K_5-minor-free graphs – Mohammadtaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
14 Exponential speedup of fixed parameter algorithms on K_3,3-minor-free or K_5-minor-free graphs – Erik D. Demaine, Mohammadtaghi Hajiaghayi, Dimitrios M. Thilikos - 2002
5 Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors – Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos - 2002
1 Minimum vertex cover in rectangle graphs – Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz - 2011
17 Strong computational lower bounds via parameterized complexity – Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia - 2006
17 Simplicity is beauty: improved upper bounds for Vertex Cover – Jianer Chen, Iyad A. Kanj, Ge Xia - 2005
16 Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs – Jochen Alber, Jiri Fiala - 2002