Author:
Adler Isolde,Dorn Frederic,Fomin Fedor V.,Sau Ignasi,Thilikos Dimitrios M.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Faster Parameterized Algorithms for Minor Containment (2010), http://users.uoa.gr/~sedthilk/papers/minorch.pdf
2. Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 641–650 (2008)
3. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science. Formal Models and Semantics (B), vol. B, pp. 193–242 (1990)
4. Dawar, A., Grohe, M., Kreutzer, S.: Locally Excluding a Minor. In: Proc. of the 22nd IEEE Symposium on Logic in Computer Science (LICS), pp. 270–279 (2007)
5. Demaine, E.D., Hajiaghayi, M.T., Kawarabayashi, K.-i.: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. In: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 637–646 (2005)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献