Author of the publication

Low-Stretch Spanning Trees of Graphs with Bounded Width.

, , , , and . SWAT, volume 162 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

No persons found for author name Borradaile, Glencora
add a person with the name Borradaile, Glencora
 

Other publications of authors with the same name

The 1-Neighbour Knapsack Problem., , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 71-84. Springer, (2011)Connectivity Oracles for Planar Graphs., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 316-327. Springer, (2012)Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets., and . CCCG, page 297-302. (2012)All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs., , , and . SoCG, volume 51 of LIPIcs, page 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest., , and . FOCS, page 115-124. IEEE Computer Society, (2008)Planar Induced Subgraphs of Sparse Graphs., , and . GD, volume 8871 of Lecture Notes in Computer Science, page 1-12. Springer, (2014)An O (n log n) algorithm for maximum st-flow in a directed planar graph., and . SODA, page 524-533. ACM Press, (2006)Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, , and . ACM Trans. Algorithms, 11 (3): 16:1--16:29 (January 2015)Boundary-to-Boundary Flows in Planar Graphs., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 67-80. Springer, (2013)Minor-Free Graphs Have Light Spanners., , and . FOCS, page 767-778. IEEE Computer Society, (2017)