Author of the publication

All-pairs shortest paths for unweighted undirected graphs in o(mn) time.

. SODA, page 514-523. ACM Press, (2006)

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

On Hardness of Jumbled Indexing., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 114-125. Springer, (2014)Linear-Space Data Structures for Range Mode Query in Arrays., , , , and . Theory Comput. Syst., 55 (4): 719-741 (2014)Necklaces, Convolutions, and X + Y., , , , , , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 160-171. Springer, (2006)Computing the Nearest Neighbor Transform Exactly with Only Double Precision., , , and . ISVD, page 66-74. IEEE Computer Society, (2012)Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size., and . SoCG, volume 258 of LIPIcs, page 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem.. SoCG, volume 258 of LIPIcs, page 24:1-24:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Further Results on Colored Range Searching., , and . SoCG, volume 164 of LIPIcs, page 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Dynamic Geometric Data Structures via Shallow Cuttings.. SoCG, volume 129 of LIPIcs, page 24:1-24:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Faster Approximate Diameter and Distance Oracles in Planar Graphs., and . ESA, volume 87 of LIPIcs, page 25:1-25:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Guest Editors' Foreword., and . Discret. Comput. Geom., 52 (3): 425-426 (2014)