Author of the publication

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

Conflict-Free Coloring of Graphs, , , , , , , and . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)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)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)Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces., , , , , , , and . ICRA, page 2508-2514. IEEE, (2020)Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces, , , , , , and . Algorithmica, 82 (2): 165--187 (2020)Parallel Online Algorithms for the Bin Packing Problem., , , and . Algorithmica, 85 (1): 296-323 (2023)Edge Sparsification for Geometric Tour Problems., , , and . Comput. Geom. Topol., 3 (1): 1:1-1:23 (2024)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)Parallel Online Algorithms for the Bin Packing Problem., , , and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 106-119. Springer, (2019)