Glencora Borradaile

According to our database1, Glencora Borradaile authored at least 51 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Whose Tweets are Surveilled for the Police: An Audit of Social-Media Monitoring Tool via Log Files.
CoRR, 2020

2019
Density decompositions of networks.
J. Graph Algorithms Appl., 2019

Greedy spanners are optimal in doubling metrics.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018
Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs.
CoRR, 2018

2017
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput., 2017

Minimum cycle and homology bases of surface-embedded graphs.
JoCG, 2017

Egalitarian Graph Orientations.
J. Graph Algorithms Appl., 2017

Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph.
Graphs and Combinatorics, 2017

Time-dependent shortest paths in bounded treewidth graphs.
CoRR, 2017

Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs.
CoRR, 2017

Embedded-width: A variant of treewidth for plane graphs.
CoRR, 2017

Minor-Free Graphs Have Light Spanners.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs.
Proceedings of the Approximation, 2017

2016
Planarity Testing.
Encyclopedia of Algorithms, 2016

Planar Maximum s- t Flow.
Encyclopedia of Algorithms, 2016

Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs.
Encyclopedia of Algorithms, 2016

The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs.
ACM Trans. Algorithms, 2016

Improving robustness of next-hop routing.
J. Comb. Optim., 2016

A PTAS for Three-Edge Connectivity in Planar Graphs.
CoRR, 2016

Optimal Dynamic Program for r-Domination Problems over Tree Decompositions.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
ACM Trans. Algorithms, 2015

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.
ACM Trans. Algorithms, 2015

Planar Induced Subgraphs of Sparse Graphs.
J. Graph Algorithms Appl., 2015

Near-linear-time deterministic plane Steiner spanners for well-spaced point sets.
Comput. Geom., 2015

Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls.
Discrete & Computational Geometry, 2014

Lower bounds for testing digraph connectivity with one-pass streaming algorithms.
CoRR, 2014

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
Algorithmica, 2014

2013
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421).
Dagstuhl Reports, 2013

Maximum st-Flow in Directed Planar Graphs via Shortest Paths.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Boundary-to-Boundary Flows in Planar Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
The knapsack problem with neighbour constraints.
J. Discrete Algorithms, 2012

Planted-model evaluation of algorithms for identifying differences between spreadsheets.
Proceedings of the 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, 2012

Connectivity Oracles for Planar Graphs.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Batch Active Learning via Coordinated Matching.
Proceedings of the 29th International Conference on Machine Learning, 2012

Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
The 1-Neighbour Knapsack Problem.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
Multiple source, single sink maximum flow in a planar graph
CoRR, 2010

Randomly removing g handles at once.
Comput. Geom., 2010

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
An O(n log n) approximation scheme for Steiner tree in planar graphs.
ACM Trans. Algorithms, 2009

An O(n log n) algorithm for maximum st-flow in a directed planar graph.
J. ACM, 2009

Approximation Algorithms for Constrained Knapsack Problems
CoRR, 2009

2008
Planarity Testing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The Two-Edge Connectivity Survivable Network Problem in Planar Graphs.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A polynomial-time approximation scheme for Steiner tree in planar graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
An O (n log n) algorithm for maximum st-flow in a directed planar graph.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Safe and tight linear estimators for global optimization.
Math. Program., 2005


  Loading...