Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Graph minors. X. Obstructions to tree-decomposition

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1991 · 670 citations

Natural Sciences, Computer Science, Mathematics +11

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

Call routing and the ratcatcher

Paul Seymour, Robin Thomas · COMBINATORICA · 1994 · 395 citations

Computing, Zoology, Animal Behavior +6

Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs

Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi et al. · Journal of the ACM · 2005 · 331 citations

Computing, Computer Science, Mathematics +13

Supereulerian graphs: A survey

Paul A. Catlin · Journal of Graph Theory · 1992 · 161 citations

Natural Sciences, Mathematics, Combinatorics +9