Author:
Kratsch Stefan,Wahlström Magnus
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. On generating triangle-free graphs;Brügmann;Electronic Notes in Discrete Mathematics,2009
2. Fast FPT-algorithms for cleaning grids;Díaz,2006
3. Problem kernels for NP-complete edge deletion problems: split and related graphs;Guo,2007
4. A more effective linear kernelization for cluster editing;Guo;Theoretical Computer Science,2009
5. J. Guo, J. Uhlmann, Kernelization and complexity results for connectivity augmentation problems, in: Dehne et al. [25], pp. 483–494.
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献