Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring (2005)

Cached

Download Links

by Erik D. Demaine , Mohammadtaghi Hajiaghayi , Ken-ichi Kawarabayashi
Venue:In 46th Annual IEEE Symposium on Foundations of Computer Science
Citations:43 - 12 self

Documents Related by Co-Citation

311 Approximation algorithms for NP-complete problems on planar graphs,Vroc. 24th Ann – B S Baker - 1983
367 Parameterized Complexity Theory – J Flum, M Grohe - 2006
87 Diameter and treewidth in minor-closed graph families – David Eppstein
56 Local tree-width, excluded minors, and approximation algorithms – Martin Grohe
113 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
29 The bidimensionality Theory and Its Algorithmic Applications – Erik D. Demaine, Mohammadtaghi Hajiaghayi - 2005
242 Graph rewriting: An algebraic and logic approach – B Courcelle - 1990
28 Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications – Erik D. Demaine, Mohammadtaghi Hajiaghayi - 2003
117 Quickly excluding a planar graph – N Robertson, P D Seymour, R Thomas - 1994
55 Graph minors. XVI. Excluding a non-planar graph, preprint – N Robertson, P D Seymour - 1986
894 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
28 Excluding Any Graph as a Minor Allows a Low Tree-Width 2-Coloring – Matt Devos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce Reed, Paul Seymour, Dirk Vertigan - 2001
13 Catalan structures and dynamic programming in H-minor-free graphs – F Dorn, F V Fomin, D M Thilikos - 2008
129 On local and non-local properties – H GAIFMAN - 1982
721 Graph Theory – Reinhard Diestel - 2000
259 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
75 Deciding First-Order Properties of Locally Tree-Decomposable Graphs – Markus Frick, Martin Grohe - 1999
190 A linear-time algorithm for finding tree-decompositions of small treewidth – H L Bodlaender - 1996
39 Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions – Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin - 2005