Author:
Kardoš František,Katrenič Ján,Schiermeyer Ingo
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. NP-hard graph problems and boundary classes of graphs;Alekseev;Theoretical Computer Science,2007
2. On computing the dissociation number and the induced matching number of bipartite graphs;Boliac;Ars Combinatorics,2004
3. Minimum k-path vertex cover;Brešar;Discrete Applied Mathematics,2011
4. Independent packings in structured graphs;Cameron;Mathematical Programming,2006
5. Improved upper bounds for vertex cover;Chen;Theoretical Computer Science,2010
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献