Glencora Borradaile

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