( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Competitive Online Routing on Delaunay Triangulations.

, , , и . Int. J. Comput. Geom. Appl., 27 (4): 241-254 (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.

Peter Bose

Michael Böse

Tarit Bose

Peter Böse

Detlef Böse

 

Другие публикации лиц с тем же именем

Computing the Greedy Spanner in Near-Quadratic Time., , , , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 390-401. Springer, (2008)Spanners of Additively Weighted Point Sets., , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 367-377. Springer, (2008)An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times., , , и . SWAT, том 6139 из Lecture Notes in Computer Science, стр. 38-49. Springer, (2010)Spanners of Complete k -Partite Geometric Graphs., , , , , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 170-181. Springer, (2008)Art Gallery Localization., , , и . CoRR, (2017)The dilation of the Delaunay triangulation is greater than π/2, , , , и . CoRR, (2010)Computing the k-Crossing Visibility Region of a Point in a Polygon., , , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 10-21. Springer, (2019)Constructing Plane Spanners of Bounded Degree and Low Weight., , и . Algorithmica, 42 (3-4): 249-264 (2005)On the separation of a polyhedron from its single-part mold., , и . CASE, стр. 61-66. IEEE, (2017)A Polynomial Bound for Untangling Geometric Planar Graphs., , , , , и . Electron. Notes Discret. Math., (2008)