| 2009 |
|---|
| 10 | EE | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
STACS 2009: 171-182 |
| 9 | EE | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
CoRR abs/0902.1043: (2009) |
| 8 | EE | Glencora Borradaile,
Philip N. Klein:
An O(n log n) algorithm for maximum st-flow in a directed planar graph.
J. ACM 56(2): (2009) |
| 2008 |
|---|
| 7 | EE | Glencora Borradaile,
Philip N. Klein,
Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.
FOCS 2008: 115-124 |
| 6 | EE | Glencora Borradaile,
Philip N. Klein:
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs.
ICALP (1) 2008: 485-501 |
| 5 | EE | Glencora Borradaile:
Planarity Testing.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 4 | EE | Glencora Borradaile,
Claire Kenyon-Mathieu,
Philip N. Klein:
A polynomial-time approximation scheme for Steiner tree in planar graphs.
SODA 2007: 1285-1294 |
| 3 | EE | Glencora Borradaile,
Philip N. Klein,
Claire Mathieu:
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon.
WADS 2007: 275-286 |
| 2006 |
|---|
| 2 | EE | Glencora Borradaile,
Philip N. Klein:
An O (n log n) algorithm for maximum st-flow in a directed planar graph.
SODA 2006: 524-533 |
| 2005 |
|---|
| 1 | EE | Glencora Borradaile,
Pascal Van Hentenryck:
Safe and tight linear estimators for global optimization.
Math. Program. 102(3): 495-517 (2005) |
