Author of the publication

Faster Algorithms for the Geometric Transportation Problem.

, , , , and . Symposium on Computational Geometry, volume 77 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Trajectory planning for an articulated probe., , and . Comput. Geom., (2020)Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions., , and . ACM Trans. Algorithms, 19 (2): 13:1-13:22 (April 2023)A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection., , and . STOC, page 841-850. ACM, (2015)Maintaining Reeb Graphs of Triangulated 2-Manifolds., , and . FSTTCS, volume 93 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimum Cuts in Surface Graphs., , , and . SIAM J. Comput., 52 (1): 156-195 (February 2023)Online Scheduling on Identical Machines using SRPT., and . SODA, page 120-128. SIAM, (2011)Energy Efficient Scheduling of Parallelizable Jobs., , and . SODA, page 948-957. SIAM, (2013)An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles., , and . SODA, page 1179-1192. SIAM, (2016)Counting and sampling minimum cuts in genus g graphs., , and . SoCG, page 249-258. ACM, (2013)Minimum Cycle and Homology Bases of Surface Embedded Graphs., , , and . SoCG, volume 51 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)