( en | de | ru )

 

Disambiguation of "Durocher, Stephane"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Barrier Coverage with Relocatable Sensors in the Plane.

, , , , , , , , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 170-182. Springer, (2013)

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.

Ludwig Durocher

Alain Durocher

Stéphane Müller

Stéphane Klein

Stéphane Haussler

 

Other publications of authors with the same name

On the Biplanar Crossing Number of Kn., , and . CCCG, page 93-100. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Minimum Ply Covering of Points with Unit Squares., , and . CoRR, (2022)A Structured Latent Space for Human Body Motion Generation., , , and . 3DV, page 557-566. IEEE, (2022)Cops and Robbers on 1-Planar Graphs., , , , , , , , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 3-17. Springer, (2023)Clustering Moving Entities in Euclidean Space., and . SWAT, volume 162 of LIPIcs, page 22:1-22:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximation algorithms for minimum ply covering of points with unit squares and unit disks., , and . Theor. Comput. Sci., (2025)Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs., , , and . DIALM-POMC, page 79-86. ACM, (2008)Drawing Plane Triangulations with Few Segments, pp. 40-45., and . CCCG, Carleton University, Ottawa, Canada, (2014)Non-Crossing Matching of Online Points., , , , and . CCCG, page 233-239. (2020)Minimizing the Number of Arcs Linking a Permutation of Points in the Plane., , and . CCCG, (2006)