Author:
Banerjee Niranka,Chakraborty Sankardeep,Raman Venkatesh,Roy Sasanka,Saurabh Saket
Publisher
Springer International Publishing
Reference27 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
2. Lecture Notes in Computer Science;T Asano,2009
3. Lecture Notes in Computer Science;T Asano,2008
4. Lecture Notes in Computer Science;T Asano,2011
5. Asano, T., Doerr, B.: Memory-constrained algorithms for shortest path problem. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG (2011)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献