Publisher
Springer Berlin Heidelberg
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths;Treewidth, Kernels, and Algorithms;2020
3. Surfing with Rod;Computability and Complexity;2016-12-01
4. Cameo of a Consummate Computabilist;Computability and Complexity;2016-12-01
5. The M-Hierarchy, and XP-Optimality;Texts in Computer Science;2013