Upper and lower bounds for online routing on Delaunay triangulations, Lecture Notes in Computer Science, vol.9294, pp.203-214, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01207275
Upper and lower bounds for online routing on Delaunay triangulations, Discrete & Computational Geometry, vol.58, issue.2, pp.482-504, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01207275
Tight stretch factors for L 1 and L ? Delaunay triangulations, Computational Geometry, vol.48, issue.3, pp.237-250, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00964470
Competitive online routing on Delaunay triangulations, Algorithm Theory-SWAT 2014-14th Scandinavian Symposium and Workshops, vol.8503, pp.98-109, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01092761
Competitive routing in the half-theta-6-graph, Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pp.1319-1328, 2012. ,
Online routing in triangulations, Algorithms and Computation, vol.1741, pp.113-122, 1999. ,
There is a planar graph almost as good as the complete graph, Proceedings of the Second Annual Symposium on Computational Geometry, SCG '86, pp.169-177, 1986. ,
There are planar graphs almost as good as the complete graph, Journal of Computer and System Sciences, vol.39, issue.2, pp.205-219, 1989. ,
The stretch factor of hexagonDelaunay triangulations, 2017. ,
Delaunay graphs are almost as good as complete graphs, Discrete & Computational Geometry, vol.5, issue.1, pp.399-407, 1990. ,
Classes of graphs which approximate the complete euclidean graph, Discrete & Computational Geometry, vol.7, issue.1, pp.13-28, 1992. ,
Geometric Spanner Networks, 2007. ,
Improved upper bound on the stretch factor of Delaunay triangulations, Proceedings of the Twenty-seventh Annual Symposium on Computational Geometry, SoCG '11, pp.264-273, 2011. ,
Toward the tight bound of the stretch factor of Delaunay triangulations, Proceedings of the Canadian Conference on Computational Geometry, CCCG '11, 2011. ,