Towards tight(er) bounds for the Excluded Grid Theorem

Graph Minors .XIII. The Disjoint Paths Problem

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1995 · 1.3K citations

Natural Sciences, Mathematics, Combinatorics +8

Graph minors. V. Excluding a planar graph

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1986 · 756 citations

Computing, Computer Science, Combinatorics +8

Graph minors. I. Excluding a forest

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1983 · 587 citations

Natural Sciences, Forestry, Graph Visualization +5

Quickly Excluding a Planar Graph

Neil Robertson, Paul Seymour, Rajan M. Thomas · Journal of Combinatorial Theory Series B · 1994 · 459 citations

Computing, Computer Science, Computational Geometry +5

The Bidimensionality Theory and Its Algorithmic Applications

Erik D. Demaine, Mohammad Taghi Hajiaghayi · The Computer Journal · 2007 · 225 citations · Full text

Computing, Computer Science, Mathematics +15