- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i11 |      | Glencora Borradaile, Philip N. Klein: The two-edge connectivity survivable-network design problem in planar graphs. CoRR abs/1302.2184 (2013) |
| i10 | | Glencora Borradaile, Philip N. Klein, Claire Mathieu: A polynomial-time approximation scheme for Euclidean Steiner forest. CoRR abs/1302.7270 (2013) |
| 2012 | ||
| j5 | | Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong: The knapsack problem with neighbour constraints. J. Discrete Algorithms 16: 224-235 (2012) |
| c14 | | Glencora Borradaile, David Eppstein: Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG 2012: 297-302 |
| c13 | | Javad Azimi, Alan Fern, Xiaoli Zhang Fern, Glencora Borradaile, Brent Heeringa: Batch Active Learning via Coordinated Matching. ICML 2012 |
| c12 | | Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen: Connectivity Oracles for Planar Graphs. SWAT 2012: 316-327 |
| c11 | | Anna Harutyunyan, Glencora Borradaile, Chris Chambers, Christopher Scaffidi: Planted-model evaluation of algorithms for identifying differences between spreadsheets. VL/HCC 2012: 7-14 |
| i9 | | Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen: Connectivity Oracles for Planar Graphs. CoRR abs/1204.4159 (2012) |
| i8 | | Glencora Borradaile, David Eppstein: Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CoRR abs/1206.2254 (2012) |
| i7 | | Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang: Egalitarian Graph Orientations. CoRR abs/1212.2178 (2012) |
| 2011 | ||
| c10 | | Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179 |
| c9 | | Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong: The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84 |
| i6 | | Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011) |
| 2010 | ||
| j4 | | Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010) |
| c8 | | Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610 |
| i5 | | Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. CoRR abs/1003.1320 (2010) |
| i4 | | Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. CoRR abs/1003.1426 (2010) |
| i3 | | Glencora Borradaile, Christian Wulff-Nilsen: Multiple source, single sink maximum flow in a planar graph. CoRR abs/1008.4966 (2010) |
| 2009 | ||
| j3 | | 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) |
| j2 | | Glencora Borradaile, Philip N. Klein, Claire Mathieu: An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Transactions on Algorithms 5(3) (2009) |
| c7 | | Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Symposium on Computational Geometry 2009: 371-376 |
| c6 | | Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182 |
| i2 | | Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. CoRR abs/0902.1043 (2009) |
| i1 | | Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong: Approximation Algorithms for Constrained Knapsack Problems. CoRR abs/0910.0777 (2009) |
| 2008 | ||
| c5 | | Glencora Borradaile, Philip N. Klein, Claire Mathieu: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS 2008: 115-124 |
| c4 | | Glencora Borradaile, Philip N. Klein: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) 2008: 485-501 |
| r1 | | |
| 2007 | ||
| c3 | | Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein: A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294 |
| c2 | | 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 | ||
| c1 | | 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 | ||
| j1 | | Glencora Borradaile, Pascal Van Hentenryck: Safe and tight linear estimators for global optimization. Math. Program. 102(3): 495-517 (2005) |
Colors in the list of coauthors
Last update Tue May 21 13:16:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page