Author of the publication

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.

, , , , and . Discret. Comput. Geom., 58 (2): 482-504 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem., , , , , and . Comb. Probab. Comput., (1993)Tight stretch factors for L1- and L∞-Delaunay triangulations., , , and . Comput. Geom., 48 (3): 237-250 (2015)The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations., , , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 205-216. Springer, (2012)Edge coloring regular graphs of high degree., and . Discret. Math., (1997)A framework for computational thinking across the curriculum., , , and . ITiCSE, page 123-127. ACM, (2010)New Bounds for the Firing Squad Problem on a Ring., , , and . SIROCCO, volume 13 of Proceedings in Informatics, page 17-31. Carleton Scientific, (2002)There are Plane Spanners of Degree 4 and Moderate Stretch Factor., , , and . Discret. Comput. Geom., 53 (3): 514-546 (2015)Upper and Lower Bounds for Online Routing on Delaunay Triangulations., , , , and . Discret. Comput. Geom., 58 (2): 482-504 (2017)Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks., and . ALGOSENSORS, volume 4240 of Lecture Notes in Computer Science, page 95-106. Springer, (2006)Improved Parameterized Algorithms for Planar Dominating Set., and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 399-410. Springer, (2002)