Quickly deciding minor-closed parameters in general graphs

Robertson, 1995, Graph minors. XII. Distance on a surface, Journal of Combinatorial Theory, Series B, 64, 240, 10.1006/jctb.1995.1034

Robertson, 2004, Graph minors. XX. Wagner’s conjecture, Journal of Combinatorial Theory, Series B, 92, 325, 10.1016/j.jctb.2004.08.001

Frick, 2001, Deciding first-order properties of locally tree-decomposable structures, Journal of the ACM, 48, 1184, 10.1145/504794.504798

Fellows, 1988, Nonconstructive tools for proving polynomial-time decidability, Journal of the ACM, 35, 727, 10.1145/44483.44491

Friedman, 1987, The metamathematics of the graph minor theorem, vol. 65, 229

Downey, 1999

Courcelle, 1990, Graph rewriting: an algebraic and logic approach, vol. B, 193

Robertson, 1994, Quickly excluding a planar graph, Journal of Combinatorial Theory, Series B, 62, 323, 10.1006/jctb.1994.1073

E. Amir, Efficient approximation for triangulation of minimum treewidth, in: Proc. 17th Conf. Uncertainty in Artificial Intelligence, 2001, pp. 7–15

Robertson, 1995, Graph minors. XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, 63, 65, 10.1006/jctb.1995.1006

E.D. Demaine, F.V. Fomin, M. Hajiaghayi, D.M. Thilikos, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, in: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, 2004, pp. 823–832

Demaine, 2004, Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, 18, 501, 10.1137/S0895480103433410

E.D. Demaine, M. Hajiaghayi, Bidimensionality: New connections between FPT algorithms and PTASs, in: Proc. 16th Ann. ACM-SIAM Sympos. Discrete Algorithms, Vancouver, 2005, pp. 590–601