( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.

, , , , , и . Graph Drawing, том 9411 из Lecture Notes in Computer Science, стр. 447-459. Springer, (2015)

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.

Ludwig Durocher

Alain Durocher

Stéphane Haussler

Stéphane Klein

Stéphane Müller

 

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

Minimum Ply Covering of Points with Unit Squares., , и . CoRR, (2022)On the Biplanar Crossing Number of Kn., , и . CCCG, стр. 93-100. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)A Structured Latent Space for Human Body Motion Generation., , , и . 3DV, стр. 557-566. IEEE, (2022)Cops and Robbers on 1-Planar Graphs., , , , , , , , и . GD (2), том 14466 из Lecture Notes in Computer Science, стр. 3-17. Springer, (2023)Clustering Moving Entities in Euclidean Space., и . SWAT, том 162 из LIPIcs, стр. 22:1-22:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras., , , , и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2014)Revisiting the Problem of Searching on a Line., , и . ESA, том 8125 из Lecture Notes in Computer Science, стр. 205-216. Springer, (2013)Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs., , , и . DIALM-POMC, стр. 79-86. ACM, (2008)Drawing Plane Triangulations with Few Segments, pp. 40-45., и . CCCG, Carleton University, Ottawa, Canada, (2014)Non-Crossing Matching of Online Points., , , , и . CCCG, стр. 233-239. (2020)