Author of the publication

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch

, , , , and . SIAM J. Comput., 48 (6): 1727--1762 (2019)
DOI: 10.1137/18M1194341

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.

 

Other publications of authors with the same name

Area-Optimal Simple Polygonalizations: The CG Challenge 2019., , , , and . CoRR, (2021)Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, , , , and . SIAM J. Comput., 48 (6): 1727--1762 (2019)Edge Sparsification for Geometric Tour Problems, , , and . Computing in Geometry and Topology, 3 (1): 1-22 (2024)Area-Optimal Simple Polygonalizations: The CG Challenge 2019., , , , and . ACM J. Exp. Algorithmics, (2022)CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata., , , , , and . Algorithmica, 83 (1): 387-412 (2021)Packing Disks into Disks with Optimal Worst-Case Density., , and . SoCG, volume 129 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Conflict-Free Coloring of Intersection Graphs, and . 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, volume 92 of LIPIcs, page 31:1--31:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Conflict-Free Coloring of Graphs, , , , , , , and . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022., , , and . ACM J. Exp. Algorithmics, (December 2023)Packing Disks into Disks with Optimal Worst-Case Density., , and . Discret. Comput. Geom., 69 (1): 51-90 (2023)