( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Every Polygon Can Be Untangled.

, , и . EuroCG, стр. 62-65. (2000)

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.

Meike Rotermund

Josef Roters

Franz Rotering

Helene Rotermund

Lothar Rotermund

 

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

Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings, , и . CoRR, (2013)Every Polygon Can Be Untangled., , и . EuroCG, стр. 62-65. (2000)Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension., , , и . SODA, стр. 836-843. SIAM, (2008)Approximate Minimum-Weight Matching with Outliers Under Translation., , , , , , и . ISAAC, том 123 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Common Developments of Several Different Orthogonal Boxes., , , , , и . CCCG, (2011)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)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)Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results.. CoRR, (2019)