Author of the publication

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs.

, and . SODA, page 4410-4450. SIAM, (2024)

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

An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism., , and . CoRR, (2023)Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees., and . SODA, page 190-210. SIAM, (2022)Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)., , and . SoCG, volume 164 of LIPIcs, page 83:1-83:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Halving by a Thousand Cuts or Punctures., and . CoRR, (2022)Least Squares-Based Filter for Remote SensingImage Noise Reduction., , , and . IEEE Trans. Geosci. Remote. Sens., 46 (7): 2044-2049 (2008)Coordinated Motion Planning Through Randomized k-Opt., , , and . CoRR, (2021)Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs., and . CoRR, (2023)Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs., and . SODA, page 4410-4450. SIAM, (2024)Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)., , and . SoCG, volume 224 of LIPIcs, page 72:1-72:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures., and . SODA, page 1493-1511. SIAM, (2023)