Glencora Borradaile

Publication Activity (10 Years)

Years Active: 2005-2021
Publications (10 Years): 30

Top Topics

Monadic Datalog

Top Venues

ACM Trans. Algorithms

J. Graph Algorithms Appl.

Publications

Glencora Borradaile, Kelsy Kretschmer, Michele Gretes, Alexandria LeClerc
The Motivated Can Encrypt (Even with PGP). CoRR (2021)
Glencora Borradaile, Kelsy Kretschmer, Michele Gretes, Alexandria LeClerc
The Motivated Can Encrypt (Even with PGP). Proc. Priv. Enhancing Technol. 2021 (3) (2021)
Glencora Borradaile, William Maxwell, Amir Nayyeri
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. SoCG (2020)
Glencora Borradaile, Brett Burkhardt, Alexandria LeClerc
Whose tweets are surveilled for the police: an audit of a social-media monitoring tool via log files. FAT* (2020)
Glencora Borradaile, William Maxwell, Amir Nayyeri
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes. CoRR (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-stretch spanning trees of graphs with bounded width. CoRR (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT (2020)
Glencora Borradaile, Brett Burkhardt, Alexandria LeClerc
Whose Tweets are Surveilled for the Police: An Audit of Social-Media Monitoring Tool via Log Files. CoRR (2020)
Glencora Borradaile, Theresa Migler, Gordon T. Wilfong
Density decompositions of networks. J. Graph Algorithms Appl. 23 (4) (2019)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Greedy spanners are optimal in doubling metrics. SODA (2019)
Glencora Borradaile, Hung Le, Baigong Zheng
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. SEA² (2019)
Glencora Borradaile, Hung Le, Baigong Zheng
Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs. CoRR (2018)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Greedy spanners are optimal in doubling metrics. CoRR (2017)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Minor-free graphs have light spanners. CoRR (2017)
Glencora Borradaile, Baigong Zheng
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs. APPROX-RANDOM (2017)
Glencora Borradaile, Hung Le, Melissa Sherman-Bennett
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. Graphs Comb. 33 (6) (2017)
Glencora Borradaile, Hung Le
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. CoRR (2017)
Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber
Embedded-width: A variant of treewidth for plane graphs. CoRR (2017)
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. SIAM J. Comput. 46 (4) (2017)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Minor-Free Graphs Have Light Spanners. FOCS (2017)
Glencora Borradaile, Morgan Shirley
Time-dependent shortest paths in bounded treewidth graphs. CoRR (2017)
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang
Egalitarian Graph Orientations. J. Graph Algorithms Appl. 21 (4) (2017)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8 (2) (2017)
Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, Lisa Zhang
Improving robustness of next-hop routing. J. Comb. Optim. 31 (3) (2016)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum cycle and homology bases of surface embedded graphs. CoRR (2016)
Glencora Borradaile, Philip N. Klein
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs. ACM Trans. Algorithms 12 (3) (2016)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG (2016)
Glencora Borradaile, Baigong Zheng
A PTAS for Three-Edge Connectivity in Planar Graphs. CoRR (2016)
Glencora Borradaile, Hung Le
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. IPEC (2016)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG (2016)
Glencora Borradaile, Amir Nayyeri, Farzad Zafarani
Towards single face shortest vertex-disjoint paths in undirected planar graphs. CoRR (2015)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11 (3) (2015)
Glencora Borradaile, Amir Nayyeri, Farzad Zafarani
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. ESA (2015)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ACM Trans. Algorithms 11 (3) (2015)
Glencora Borradaile, David Eppstein
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets. Comput. Geom. 49 (2015)
Glencora Borradaile, Hung Le
Optimal dynamic program for r-domination problems over tree decompositions. CoRR (2015)
Glencora Borradaile, David Eppstein, Pingan Zhu
Planar Induced Subgraphs of Sparse Graphs. J. Graph Algorithms Appl. 19 (1) (2015)
Glencora Borradaile, Erin Wolf Chambers
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 51 (4) (2014)
Glencora Borradaile, Theresa Migler, Gordon T. Wilfong
Density decompositions of networks. CoRR (2014)
Glencora Borradaile, David Eppstein, Pingan Zhu
Planar Induced Subgraphs of Sparse Graphs. Graph Drawing (2014)
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Algorithmica 68 (2) (2014)
Glencora Borradaile, Claire Mathieu, Theresa Migler
Lower bounds for testing digraph connectivity with one-pass streaming algorithms. CoRR (2014)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR (2014)
Glencora Borradaile, William Sean Kennedy, Gordon T. Wilfong, Lisa Zhang
Improving Robustness of Next-Hop Routing. CoRR (2014)
Glencora Borradaile, Erin Wolf Chambers
Covering nearly surface-embedded graphs with a fixed number of balls. CoRR (2014)
Glencora Borradaile, David Eppstein, Pingan Zhu
Planar Induced Subgraphs of Sparse Graphs. CoRR (2014)
Glencora Borradaile, Anna Harutyunyan
Boundary-to-Boundary Flows in Planar Graphs. IWOCA (2013)
Glencora Borradaile, Anna Harutyunyan
Maximum st-flow in directed planar graphs via shortest paths CoRR (2013)
Glencora Borradaile, Philip N. Klein
The two-edge connectivity survivable-network design problem in planar graphs CoRR (2013)
Glencora Borradaile, Anna Harutyunyan
Maximum st-Flow in Directed Planar Graphs via Shortest Paths. IWOCA (2013)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
A polynomial-time approximation scheme for Euclidean Steiner forest CoRR (2013)
Glencora Borradaile, Anna Harutyunyan
Boundary-to-boundary flows in planar graphs. CoRR (2013)
Glencora Borradaile, Philip N. Klein, Dániel Marx, Claire Mathieu
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports 3 (10) (2013)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16 (2012)
Glencora Borradaile, David Eppstein
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets CoRR (2012)
Glencora Borradaile, David Eppstein
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG (2012)
Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
Connectivity Oracles for Planar Graphs. SWAT (2012)
Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
Connectivity Oracles for Planar Graphs CoRR (2012)
Anna Harutyunyan, Glencora Borradaile, Chris Chambers, Christopher Scaffidi
Planted-model evaluation of algorithms for identifying differences between spreadsheets. VL/HCC (2012)
Javad Azimi, Alan Fern, Xiaoli Zhang Fern, Glencora Borradaile, Brent Heeringa
Batch Active Learning via Coordinated Matching. ICML (2012)
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang
Egalitarian Graph Orientations CoRR (2012)
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 (2011)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
The 1-Neighbour Knapsack Problem. IWOCA (2011)
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)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS (2010)
Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos
Randomly removing g handles at once CoRR (2010)
Glencora Borradaile, Christian Wulff-Nilsen
Multiple source, single sink maximum flow in a planar graph CoRR (2010)
Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos
Randomly removing g handles at once. Comput. Geom. 43 (8) (2010)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time CoRR (2010)
Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong
Approximation Algorithms for Constrained Knapsack Problems CoRR (2009)
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS (2009)
Glencora Borradaile, Philip N. Klein
-flow in a directed planar graph. J. ACM 56 (2) (2009)
Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos
Randomly removing g handles at once. SCG (2009)
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs CoRR (2009)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5 (3) (2009)
Glencora Borradaile, Philip N. Klein
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) (2008)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS (2008)
Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein
A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA (2007)
Glencora Borradaile, Philip N. Klein, Claire Mathieu
) Approximation Scheme with Singly-Exponential Dependence on Epsilon. WADS (2007)
Glencora Borradaile, Philip N. Klein
-flow in a directed planar graph. SODA (2006)
Glencora Borradaile, Pascal Van Hentenryck
Safe and tight linear estimators for global optimization. Math. Program. 102 (3) (2005)