Author:
Bose Prosenjit,Gudmundsson Joachim,Smid Michiel
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. D. Barnette. Trees in polyhedral graphs. Canadian Journal of Mathematics, 18:731–736, 1966.
2. P. Bose and P. Morin. Online routing in triangulations. In Proc. 10th Annu. Internat. Sympos. Algorithms Comput., volume 1741 of Lecture Notes Comput. Sci., pages 113–122. Springer-Verlag, 1999.
3. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 53–62, 1993.
4. Das and D. Joseph. Which triangulations approximate the complete graph? In Proc. International Symposium on Optimal Algorithms, volume 401 of Lecture Notes Comput. Sci., pages 168–192. Springer-Verlag, 1989.
5. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 215–222, 1995.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献