|
260
|
Approximation algorithms for NP-complete problems on planar graphs
– B S Baker
- 1994
|
|
214
|
Graph minors. XIII. The disjoint paths problem
– N Robertson, P D Seymour
- 1995
|
|
94
|
Quickly excluding a planar graph
– N Robertson, P D Seymour, R Thomas
- 1994
|
|
46
|
Local tree-width, excluded minors, and approximation algorithms
– Martin Grohe
|
|
54
|
Tree width and tangles: A new connectivity measure and some applications
– B Reed
- 1997
|
|
228
|
Parameterized Complexity Theory
– J Flum, M Grohe
- 2006
|
|
138
|
A linear-time algorithm for finding tree-decompositions of small treewidth
– H L Bodlaender
- 1996
|
|
697
|
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
|
|
89
|
Subgraph Isomorphism in Planar Graphs and Related Problems
– David Eppstein
- 1999
|
|
213
|
Graph rewriting: An algebraic and logic approach
– B Courcelle
- 1990
|
|
64
|
Diameter and treewidth in minor-closed graph families
– D Eppstein
|
|
21
|
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
– Erik D. Demaine, Mohammadtaghi Hajiaghayi
- 2003
|
|
42
|
Graph minors. XVI. Excluding a non-planar graph
– Neil Robertson, Paul D Seymour
|
|
20
|
The bidimensionality Theory and Its Algorithmic Applications
– Erik D. Demaine, Mohammadtaghi Hajiaghayi
- 2005
|
|
119
|
On local and nonlocal properties
– H Gaifman
- 1982
|
|
130
|
Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Math
– A Proskurowski, S Arnborg
- 1989
|
|
27
|
Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-Minor-Free Graphs
– Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
- 2003
|
|
35
|
Lower bound of the hadwiger number of graphs by their average degree
– A Kostochka
- 1984
|
|
514
|
Graph Theory
– R Diestel
- 2000
|
