( en | de | ru )

 

Disambiguation of "Borradaile, Glencora"

Author of the publication

copydeleteadd this publication to your clipboard
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

An O (n log n) algorithm for maximum st-flow in a directed planar graph., and . SODA, page 524-533. ACM Press, (2006)Boundary-to-Boundary Flows in Planar Graphs., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 67-80. Springer, (2013)Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time., , and . ACM Trans. Algorithms, 11 (3): 16:1-16:29 (2015)Minor-Free Graphs Have Light Spanners., , and . FOCS, page 767-778. IEEE Computer Society, (2017)Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls., and . Discret. Comput. Geom., 51 (4): 979-996 (2014)The knapsack problem with neighbour constraints., , and . J. Discrete Algorithms, (2012)Planar Induced Subgraphs of Sparse Graphs., , and . GD, volume 8871 of Lecture Notes in Computer Science, page 1-12. Springer, (2014)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)Approximation Algorithms for Constrained Knapsack Problems, , and . CoRR, (2009)Density decompositions of networks., , and . CoRR, (2014)