Glencora Borradaile

	2012
22		Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen: Connectivity Oracles for Planar Graphs CoRR abs/1204.4159: (2012)
	2011
21		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
20		Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong: The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84
19		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
18		Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610
17		Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time CoRR abs/1003.1320: (2010)
16		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once CoRR abs/1003.1426: (2010)
15		Glencora Borradaile, Christian Wulff-Nilsen: Multiple source, single sink maximum flow in a planar graph CoRR abs/1008.4966: (2010)
14		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010)
	2009
13		Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182
12		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Symposium on Computational Geometry 2009: 371-376
11		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)
10		Glencora Borradaile, Erik D. Demaine, Siamak Tazari: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs CoRR abs/0902.1043: (2009)
9		Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong: Approximation Algorithms for Constrained Knapsack Problems CoRR abs/0910.0777: (2009)
8		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		Glencora Borradaile, Philip N. Klein, Claire Mathieu: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS 2008: 115-124
6		Glencora Borradaile, Philip N. Klein: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) 2008: 485-501
5		Glencora Borradaile: Planarity Testing. Encyclopedia of Algorithms 2008
	2007
4		Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein: A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294
3		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		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		Glencora Borradaile, Pascal Van Hentenryck: Safe and tight linear estimators for global optimization. Math. Program. 102(3): 495-517 (2005)

Coauthor Index

1	Erik D. Demaine	[10] [13]
2	Brent Heeringa	[9] [20]
3	Pascal Van Hentenryck	[1]
4	Philip N. Klein	[2] [3] [4] [6] [7] [8] [11] [19] [21]
5	James R. Lee	[12] [14] [16]
6	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[3] [4] [7] [11]
7	Shay Mozes	[19] [21]
8	Yahav Nussbaum	[19] [21]
9	Seth Pettie	[22]
10	Piotr Sankowski	[17] [18]
11	Anastasios Sidiropoulos	[12] [14] [16]
12	Siamak Tazari	[10] [13]
13	Gordon T. Wilfong	[9] [20]
14	Christian Wulff-Nilsen	[15] [17] [18] [19] [21] [22]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page