( en | de | ru )

 

Disambiguation of "Scheffer, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
Efficiently Reconfiguring a Connected Swarm of Labeled Robots.

, , , , and . ISAAC, volume 248 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Christian Scheffer

Christian Scheffer

Christian Scheffer

Simone Scheffer

Guido Scheffer

 

Other publications of authors with the same name

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours., , , , and . ALENEX, page 1-14. SIAM, (2023)Coordinated Motion Planning: Efficiently Reconfiguring a Connected Swarm of Labeled Robots, , , , and . 33rd International Symposium on Algorithms and Computation (ISAAC 2022), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), page 17:1--17:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2022)A Closer Cut: Computing Near-Optimal Lawn Mowing Tours, , , , and . CoRR, (2022)Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces, , , , , , and . Algorithmica, 82 (2): 165--187 (2020)Packing Squares into a Disk with Optimal Worst-Case Density., , , , , and . SoCG, volume 189 of LIPIcs, page 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dispersive Vertex Guarding for Simple and Non-Simple Polygons., , , , and . CoRR, (2024)Space Ants: Episode II - Coordinating Connected Catoms, , , , , , and . International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), page 65:1--65:6. Dagstuhl, Germany, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2022)Conflict-Free Coloring of Graphs, , , , , , , and . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)Packing Disks into Disks with Optimal Worst-Case Density., , and . Discret. Comput. Geom., 69 (1): 51-90 (2023)Train Scheduling: Hardness and Algorithms.. WALCOM, volume 12049 of Lecture Notes in Computer Science, page 342-347. Springer, (2020)