Author:
Baste Julien,Sau Ignasi,Thilikos Dimitrios M.
Funder
Agence Nationale de la Recherche
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth;Baste,2017
2. A complexity dichotomy for hitting small planar minors parameterized by treewidth;Baste,2018
3. Hitting minors on bounded treewidth graphs. III. Lower bounds;Baste;J. Comput. Syst. Sci.,2020
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献