Follow
Glencora Borradaile
Glencora Borradaile
Professor of Computer Science, Oregon State University
Verified email at onid.oregonstate.edu
Title
Cited by
Cited by
Year
An O(n log n) approximation scheme for Steiner tree in planar graphs
G Borradaile, P Klein, C Mathieu
ACM Transactions on Algorithms (TALG) 5 (3), 1-31, 2009
1782009
An O(n log n) algorithm for maximum st-flow in a directed planar graph
G Borradaile, P Klein
Journal of the ACM (JACM) 56 (2), 1-30, 2009
1652009
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen
SIAM Journal on Computing 46 (4), 1280-1303, 2017
1392017
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
G Borradaile, ED Demaine, S Tazari
Algorithmica 68 (2), 287-311, 2014
662014
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
G Borradaile, P Sankowski, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015
632015
Batch active learning via coordinated matching
J Azimi, A Fern, X Zhang-Fern, G Borradaile, B Heeringa
arXiv preprint arXiv:1206.6458, 2012
562012
Optimal dynamic program for r-domination problems over tree decompositions
G Borradaile, H Le
arXiv preprint arXiv:1502.00716, 2015
452015
Greedy spanners are optimal in doubling metrics
G Borradaile, H Le, C Wulff-Nilsen
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
402019
All-pairs minimum cuts in near-linear time for surface-embedded graphs
G Borradaile, D Eppstein, A Nayyeri, C Wulff-Nilsen
arXiv preprint arXiv:1411.7055, 2014
392014
Minor-free graphs have light spanners
G Borradaile, H Le, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
352017
The knapsack problem with neighbour constraints
G Borradaile, B Heeringa, G Wilfong
Journal of Discrete Algorithms 16, 224-235, 2012
352012
Safe and tight linear estimators for global optimization
G Borradaile, PV Hentenryck
Mathematical Programming 102, 495-517, 2005
342005
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
G Borradaile, PN Klein, C Mathieu
Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007
332007
Egalitarian graph orientations
G Borradaile, J Iglesias, T Migler, A Ochoa, G Wilfong, L Zhang
arXiv preprint arXiv:1212.2178, 2012
292012
Minimum cycle and homology bases of surface embedded graphs
G Borradaile, EW Chambers, K Fox, A Nayyeri
arXiv preprint arXiv:1607.05112, 2016
282016
A polynomial-time approximation scheme for Euclidean Steiner forest
G Borradaile, PN Klein, C Mathieu
ACM Transactions on Algorithms (TALG) 11 (3), 1-20, 2015
282015
Exploiting planarity for network flow and connectivity problems
G Borradaile
Brown University, 2008
262008
Sousveillance capitalism
G Borradaile, J Reeves
Surveillance & Society 18 (2), 272-275, 2020
232020
A polynomial-time approximation scheme for Euclidean Steiner forest
G Borradaile, PN Klein, C Mathieu
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 115-124, 2008
212008
The two-edge connectivity survivable network problem in planar graphs
G Borradaile, P Klein
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
192008
The system can't perform the operation now. Try again later.
Articles 1–20