Publisher
Springer International Publishing
Reference15 articles.
1. Lecture Notes in Computer Science;V Arvind,2002
2. Lecture Notes in Computer Science;A Björklund,2009
3. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2007), pp. 298–307 (2007)
4. Lecture Notes in Computer Science;R Curticapean,2013
5. Curticapean, R., Marx, D.: Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), pp. 130–139 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献