|
34
|
Towards a Syntactic Characterization of PTAS
– Sanjeev Khanna, Rajeev Motwani
- 1996
|
|
260
|
Approximation algorithms for NP-complete problems on planar graphs
– B S Baker
- 1994
|
|
203
|
Easy Problems for Tree-Decomposable Graphs
– Stefan Arnborg, Jens Lagergren
- 1991
|
|
80
|
A separator theorem for graphs with an excluded minor and its applications
– Noga Alon, Paul Seymour, Robin Thomas
- 1990
|
|
89
|
Subgraph Isomorphism in Planar Graphs and Related Problems
– David Eppstein
- 1999
|
|
338
|
A Separator Theorem for Planar Graphs f
– Richard J. Lipton, Robert E. Tarjan
- 1977
|
|
514
|
Graph Theory
– R Diestel
- 2000
|
|
4
|
Graph Minors I: a short proof of the path-width theorem
– R Diestel
- 1995
|
|
10
|
Nowhere-zero flows
– P D Seymour
- 1995
|
|
9
|
Pólya’s permanent problem, Electron
– W McCuaig
|
|
28
|
Directed Tree-Width
– Thor Johnson, Neil Robertson, P. D. Seymour, Robin Thomas
- 1998
|
|
41
|
Graph minors IV. Tree-width and wellquasi-ordering
– N Robertson, P D Seymour
- 1990
|
|
2
|
Fixed-parameter tractability and logic
– J Flum, M Grohe
- 1999
|
|
2
|
A polynomialtime approximation scheme for weighted planar graph TSP
– Klein, A Woloszyn
- 1998
|
|
9
|
Graph minors. XIII: the disjoint paths problem
– N Roberson, P D Seymour
- 1995
|
|
4
|
Excluding a Countable Clique
– Reinhard Diestel, Robin Thomas
- 1998
|
|
25
|
Fixed-parameter tractability, definability, and model checking
– Jörg Flum, Martin Groheý
- 2001
|
|
42
|
Graph minors. XVI. Excluding a non-planar graph
– Neil Robertson, Paul D Seymour
|
|
64
|
Diameter and treewidth in minor-closed graph families
– D Eppstein
|
