G. Borradaile

Most-cited papers

An O(n log n) approximation scheme for Steiner tree in planar graphs
G. Borradaile, P. Klein, Claire Mathieu
2009TALG113 citations
Semantic Scholar
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
G. Borradaile, P. Klein, S. Mozes, Yahav Nussbaum +1 more
2011IEEE Annual Symposium on Foundations of Computer Science109 citations Open access
Semantic Scholar
An O (n log n) algorithm for maximum st-flow in a directed planar graph
G. Borradaile, P. Klein
2006ACM-SIAM Symposium on Discrete Algorithms102 citations
Semantic Scholar
A polynomial-time approximation scheme for Steiner tree in planar graphs
G. Borradaile, C. Kenyon-Mathieu, P. Klein
2007ACM-SIAM Symposium on Discrete Algorithms74 citations
Semantic Scholar
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
G. Borradaile, E. Demaine, Siamak Tazari
2009Algorithmica57 citations Open access
Semantic Scholar
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
G. Borradaile, P. Sankowski, Christian Wulff-Nilsen
2010IEEE Annual Symposium on Foundations of Computer Science55 citations
Semantic Scholar
Greedy spanners are optimal in doubling metrics
G. Borradaile, Hung Le, Christian Wulff-Nilsen
2017ACM-SIAM Symposium on Discrete Algorithms52 citations
Semantic Scholar
An O(n log n) algorithm for maximum st-flow in a directed planar graph
G. Borradaile, P. Klein
2009JACM47 citations
Semantic Scholar
Variably oriented co-planar primary folds
G. Borradaile
1972Geological Magazine43 citations
Semantic Scholar
Batch Active Learning via Coordinated Matching
Javad Azimi, Alan Fern, Xiaoli Zhang-fern, G. Borradaile +1 more
2012International Conference on Machine Learning42 citations
Semantic Scholar
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
G. Borradaile, P. Klein, Claire Mathieu
20082008 49th Annual IEEE Symposium on Foundations of Computer Science41 citations Open access
Semantic Scholar
Minor-Free Graphs Have Light Spanners
G. Borradaile, Hung Le, Christian Wulff-Nilsen
2017IEEE Annual Symposium on Foundations of Computer Science36 citations Open access
Semantic Scholar
Optimal dynamic program for r-domination problems over tree decompositions
G. Borradaile, Hung Le
2015International Symposium on Parameterized and Exact Computation36 citations
Semantic Scholar
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
G. Borradaile, D. Eppstein, A. Nayyeri, Christian Wulff-Nilsen
2014International Symposium on Computational Geometry35 citations
Semantic Scholar
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon
G. Borradaile, P. Klein, Claire Mathieu
2007Workshop on Algorithms and Data Structures33 citations
Semantic Scholar
The knapsack problem with neighbour constraints
G. Borradaile, Brent Heeringa, G. Wilfong
2009J. Discrete Algorithms27 citations Open access
Semantic Scholar
Egalitarian Graph Orientations
G. Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa +2 more
2012J. Graph Algorithms Appl.25 citations Open access
Semantic Scholar
Minimum cycle and homology bases of surface-embedded graphs
G. Borradaile, Erin W. Chambers, Kyle J. Fox, A. Nayyeri
2016Journal of Computational Geometry21 citations
Semantic Scholar
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
G. Borradaile, P. Klein
2008International Colloquium on Automata, Languages and Programming20 citations
Semantic Scholar
Exploiting Planarity for Network Flow and Connectivity Problems
P. Klein, G. Borradaile
200820 citations
Semantic Scholar
Whose tweets are surveilled for the police: an audit of a social-media monitoring tool via log files
G. Borradaile, Brett C. Burkhardt, Alexandria Leclerc
2020FAT*15 citations Open access
Semantic Scholar
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
G. Borradaile, A. Nayyeri, Farzad Zafarani
2015Embedded Systems and Applications15 citations Open access
Semantic Scholar
Randomly removing g handles at once
G. Borradaile, James R. Lee, Anastasios Sidiropoulos
2009SCG '0915 citations Open access
Semantic Scholar
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
G. Borradaile, William Maxwell, A. Nayyeri
2020International Symposium on Computational Geometry14 citations
Semantic Scholar
Density decompositions of networks
G. Borradaile, Theresa Migler, G. Wilfong
2014J. Graph Algorithms Appl.14 citations Open access
Semantic Scholar
Sousveillance Capitalism
G. Borradaile, Joshua Reeves
2020Surveillance & Society10 citations Open access
Semantic Scholar
Planted-model evaluation of algorithms for identifying differences between spreadsheets
A. Harutyunyan, G. Borradaile, Christopher Chambers, Christopher Scaffidi
2012IEEE Symposium on Visual Languages / Human-Centric Computing Languages and Environments10 citations
Semantic Scholar
The Motivated Can Encrypt (Even with PGP)
G. Borradaile, Kelsy Kretschmer, Michele Gretes, Alexandria Leclerc
2021Proceedings on Privacy Enhancing Technologies9 citations Open access
Semantic Scholar
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs
G. Borradaile, P. Klein
2013ACM Trans. Algorithms8 citations Open access
Semantic Scholar
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)
G. Borradaile, P. Klein, Dániel Marx, Claire Mathieu
2013Dagstuhl Reports8 citations
Semantic Scholar
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls
G. Borradaile, Erin W. Chambers
2014Discrete & Computational Geometry7 citations Open access
Semantic Scholar
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
G. Borradaile, D. Eppstein
2012Computational geometry7 citations Open access
Semantic Scholar
Connectivity Oracles for Planar Graphs
G. Borradaile, Seth Pettie, Christian Wulff-Nilsen
2012Scandinavian Workshop on Algorithm Theory7 citations
Semantic Scholar
Embedded-width: A variant of treewidth for plane graphs
G. Borradaile, Jeff Erickson, Hung Le, Robbie Weber
2017arXiv.org6 citations
Semantic Scholar
Journal of Graph Algorithms and Applications Planar Induced Subgraphs of Sparse Graphs
G. Borradaile, D. Eppstein, Pingan Zhu, Borradaile +3 more
5 citations
Semantic Scholar
Lower Bounds for Testing Digraph Connectivity with One-Pass Streaming Algorithms
G. Borradaile, Claire Mathieu, Theresa Migler
2014IEEE Letters of the Computer Society4 citations Open access
Semantic Scholar
Approximation Algorithms for Constrained Knapsack Problems
G. Borradaile, Brent Heeringa, G. Wilfong
2009arXiv.org4 citations
Semantic Scholar
Low-stretch spanning trees of graphs with bounded width
G. Borradaile, Erin W. Chambers, D. Eppstein, William Maxwell +1 more
2020Scandinavian Workshop on Algorithm Theory3 citations
Semantic Scholar
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs
G. Borradaile, Hung Le, Bai-Gong Zheng
2019Analysis of Experimental Algorithms - Special Event3 citations
Semantic Scholar
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs
G. Borradaile, Bai-Gong Zheng
2017International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques3 citations
Semantic Scholar
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph
G. Borradaile, Hung Le, Melissa Sherman-Bennett
2017Graphs and Combinatorics3 citations Open access
Semantic Scholar
Boundary-to-Boundary Flows in Planar Graphs
G. Borradaile, A. Harutyunyan
2013International Workshop on Combinatorial Algorithms3 citations
Semantic Scholar
Maximum st-Flow in Directed Planar Graphs via Shortest Paths
G. Borradaile, A. Harutyunyan
2013International Workshop on Combinatorial Algorithms3 citations Open access
Semantic Scholar
The 1-Neighbour Knapsack Problem
G. Borradaile, Brent Heeringa, G. Wilfong
2011International Workshop on Combinatorial Algorithms3 citations
Semantic Scholar
Time-dependent shortest paths in bounded treewidth graphs
G. Borradaile, M. Shirley
2017arXiv.org2 citations
Semantic Scholar
Multiple source, single sink maximum flow in a planar graph
G. Borradaile, Christian Wulff-Nilsen
2010arXiv.org2 citations
Semantic Scholar
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs
G. Borradaile, Hung Le
2017arXiv.org1 citations
Semantic Scholar
Planarity Testing
G. Borradaile
2016Encyclopedia of Algorithms1 citations
Semantic Scholar
Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
G. Borradaile
2016Encyclopedia of Algorithms1 citations
Semantic Scholar
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets
G. Borradaile, D. Eppstein
2012Canadian Conference on Computational Geometry1 citations
Semantic Scholar