Author:
Eiben Eduard,Ganian Robert,Hamm Thekla,Kwon O-joung
Funder
National Research Foundation of Korea
Austrian Science Fund
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference65 articles.
1. An FPT algorithm for elimination distance to bounded degree graphs;Agrawal,2021
2. NP-completeness of the hamiltonian cycle problem for bipartite graphs;Akiyama;J. Inf. Process.,1980
3. Graph classes with structured neighborhoods and algorithmic applications;Belmonte;Theor. Comput. Sci.,2013
4. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
5. (Meta) kernelization;Bodlaender;J. ACM,2016
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献