( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Shortest path to a segment and quickest visibility queries.

, , , , , , , и . J. Comput. Geom., 7 (2): 77-100 (2016)

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.

Lothar Rotermund

Johannes Roter

Inge Rotermund

Manfred Rötel

Peter Rotering

 

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

Non-Crossing Frameworks with Non-Crossing Reciprocals., , , , , и . Discret. Comput. Geom., 32 (4): 567-600 (2004)Every Collinear Set in a Planar Graph Is Free., , , , и . SODA, стр. 1521-1538. SIAM, (2019)Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results.. CoRR, (2019)Congruence Testing of Point Sets in Three and Four Dimensions - Results and Techniques.. MACIS, том 9582 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2015)On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays.. Aegean Workshop on Computing, том 227 из Lecture Notes in Computer Science, стр. 70-83. Springer, (1986)Plane Graphs with Parity Constraints., , , , , , и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2009)Common Developments of Several Different Orthogonal Boxes., , , , , и . CCCG, (2011)Approximate Minimum-Weight Matching with Outliers Under Translation., , , , , , и . ISAAC, том 123 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The geometric dilation of three points., , , и . J. Comput. Geom., 10 (1): 532-549 (2019)Welcome from the Editors-in-Chief., и . J. Comput. Geom., 1 (1): 1-2 (2010)