Author of the publication

The Rectilinear Convex Hull of Line Segments.

, , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 32-45. Springer, (2023)

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

Approximability of (Simultaneous) Class Cover for Boxes., , and . CCCG, page 149-156. (2021)Scalable Data Structures (Dagstuhl Seminar 23211)., , , , and . Dagstuhl Reports, 13 (5): 114-135 (2023)A General Technique for Searching in Implicit Sets via Function Inversion., , , and . CoRR, (2023)How fast can we play Tetris greedily with rectangular pieces?, and . Theor. Comput. Sci., (2024)Conditional Lower Bounds for Dynamic Geometric Measure Problems., and . ESA, volume 244 of LIPIcs, page 39:1-39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Finding the saddlepoint faster than sorting., , , , and . CoRR, (2023)The Rectilinear Convex Hull of Line Segments., , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 32-45. Springer, (2023)Finding the saddlepoint faster than sorting., , , , and . SOSA, page 168-178. SIAM, (2024)An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility., , and . ESA, volume 204 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An Optimal Randomized Algorithm for Finding the Saddlepoint., , , , and . ESA, volume 308 of LIPIcs, page 44:1-44:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)