Author:
Adler Isolde,Kolliopoulos Stavros G.,Thilikos Dimitrios M.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Lecture Notes in Computer Science;I. Adler,2011
2. Graduate Texts in Mathematics;R. Diestel,2005
3. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
4. Golumbic, M.C., Kaplan, H., Shamir, R.: On the complexity of DNA physical mapping. Adv. in Appl. Math. 15, 251–261 (1994)
5. Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: 43rd ACM Symposium on Theory of Computing (STOC 2011), San Jose, California, June 6-8 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献