1. Fast minor testing in planar graphs;Adler,2010
2. I. Adler, M. Grohe, S. Kreutzer, Computing excluded minors, in: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2008, pp. 641–650.
3. Graph rewriting: An algebraic and logic approach;Courcelle,1990
4. Locally excluding a minor;Dawar,2007
5. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs;Demaine;Journal of the ACM,2005