Author of the publication

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours

, , , , and . Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, page 1--14. SIAM, (2023)
DOI: 10.1137/1.9781611977561.CH1

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

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)Connected Assembly and Reconfiguration by Finite Automata., , , and . CoRR, (2019)Particle-Based Assembly Using Precise Global Control., , , and . Algorithmica, 84 (10): 2871-2897 (2022)The prefix Fréchet similarity.. Comput. Geom., (2022)The Prefix Fréchet Similarity.. WALCOM, volume 11355 of Lecture Notes in Computer Science, page 96-107. Springer, (2019)Train Scheduling: Hardness and Algorithms.. WALCOM, volume 12049 of Lecture Notes in Computer Science, page 342-347. Springer, (2020)Packing Disks into Disks with Optimal Worst-Case Density., , and . Discret. Comput. Geom., 69 (1): 51-90 (2023)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)Approximate shortest distances among smooth obstacles in 3D., and . J. Comput. Geom., 10 (1): 389-422 (2019)