Author:
Di Battista Giuseppe,Tamassia Roberto
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. G. Ausiello, G.F. Italiano, A. Marchetti-Spaccamela and U. Nanni, “Incremental Algorithms for Minimal Length Paths,” Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 12–21.
2. D. Bienstock and C.L. Monma, “On the Complexity of Covering Vertices by Faces in a Planar Graph,” SIAM J. Computing 17 (1988), 53–76.
3. A.L. Buchsbaum, P.C. Kanellakis and J.S. Vitter, “A Data Structure for Arc Insertion and Regular Path Finding,” Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 22–31.
4. G. Di Battista and R. Tamassia, “Algorithms for Plane Representations of Acyclic Digraphs,” Theoretical Computer Science 61 (1988), 175–198.
5. G. Di Battista and R. Tamassia, “Incremental Planarity Testing,” Proc. 30th IEEE Symp. on Foundations of Computer Science (1989), 436–441.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献