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

Documents Related by Co-Citation

101 Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs – Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier - 2002
305 Approximation algorithms for NPcomplete problems on planar graphs – B S Baker - 1983
150 Vertex Cover: Further Observations and Further Improvements – Jianer Chen, Iyad A. Kanj, Weijia Jia - 1999
864 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
29 Graph separators: a parameterized view – Jochen Alber, Henning Fernau, Rolf Niedermeier - 2001
27 Improved parameterized algorithms for planar dominating set – Iyad Kanj, Ljubomir Perković
35 Fixed parameter algorithms for planar dominating set and related problems – Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier - 2000
35 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
82 Diameter and Treewidth in Minor-Closed Graph Families – David Eppstein - 1999
65 Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up – Fedor V. Fomin, Dimitrios M. Thilikos - 2002
54 Local tree-width, excluded minors, and approximation algorithms – Martin Grohe
73 Deciding First-Order Properties of Locally Tree-Decomposable Graphs – Markus Frick, Martin Grohe - 1999
20 Maximum clique transversals – Maw-Shang Chang, Ton Kloks, Chuan-Min Lee - 2001
20 New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k Disjoint Cycles on Plane and Planar Graphs – T Kloks, C-M Lee, J Liu - 2002
32 Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs – Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, Dimitrios M. Thilikos - 2003
86 Call routing and the ratcatcher – P D Seymour, R Thomas - 1994
23 Complexity of domination-type problems in graphs – Jan Arne Telle - 1994
43 Upper Bounds for Vertex Cover Further Improved – Rolf Niedermeier, Peter Rossmanith
107 Quickly excluding a planar graph – Neil Robertson, Paul D Seymour, Robin Thomas - 1994