Author:
Chambers Erin W.,Colin de Verdière Éric,Erickson Jeff,Lazarus Francis,Whittlesey Kim
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference20 articles.
1. J. Blömer, Computing sums of radicals in polynomial time, in: Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., 1991, pp. 670–677
2. S. Cabello, Many distances in planar graphs, in: Proc. 17th Annu. ACM–SIAM Sympos. Discrete Algorithms, 2006, pp. 1213–1220
3. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs;Cabello,2005
4. Shortest paths on a polyhedron, part I: Computing shortest paths;Chen;Int. J. Comput. Geom. Appl.,1996
5. É. Colin de Verdière, J. Erickson, Tightening non-simple paths and cycles on surfaces, in: Proc. 17th Annu. ACM–SIAM Sympos. Discrete Algorithms, 2006, pp. 192–201
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献