Author:
Marx Dániel,Schlotter Ildikó
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference37 articles.
1. Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641–650 (2008)
2. Lecture Notes in Computer Science;S. Arnborg,1991
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
4. Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5(1), 59–68 (1994)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A more accurate view of the Flat Wall Theorem;Journal of Graph Theory;2024-05-13
2. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Combing a Linkage in an Annulus;SIAM Journal on Discrete Mathematics;2023-10-13
4. k-apices of minor-closed graph classes. I. Bounding the obstructions;Journal of Combinatorial Theory, Series B;2023-07
5. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable;ACM Transactions on Algorithms;2023-05-05