Glencora Borradaile

Available identifiers

zbMath Open borradaile.glencoraMaRDI QIDQ266047

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6059174	2023-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q6059969	2023-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5002603	2021-07-28	Paper
Greedy spanners are optimal in doubling metrics	2019-10-15	Paper
Density decompositions of networks	2019-09-16	Paper
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs	2018-11-05	Paper
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time	2018-10-30	Paper
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest	2018-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4634391	2018-04-10	Paper
Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph	2018-02-14	Paper
Minimum cycle and homology bases of surface-embedded graphs	2018-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q3132856	2018-01-30	Paper
Randomly removing g handles at once	2017-10-20	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2017-08-16	Paper
Egalitarian Graph Orientations	2017-07-13	Paper
Minimum cycle and homology bases of surface-embedded graphs	2017-03-30	Paper
Improving robustness of next-hop routing	2016-04-13	Paper
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets	2016-01-29	Paper
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs	2015-11-19	Paper
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph	2015-11-11	Paper
Planar Induced Subgraphs of Sparse Graphs	2015-05-18	Paper
Planar Induced Subgraphs of Sparse Graphs	2015-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q2934724	2014-12-18	Paper
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs	2014-12-02	Paper
An O ( n log n ) approximation scheme for Steiner tree in planar graphs	2014-11-18	Paper
Covering nearly surface-embedded graphs with a fixed number of balls	2014-09-12	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2014-07-30	Paper
Boundary-to-Boundary Flows in Planar Graphs	2014-01-17	Paper
Maximum st-Flow in Directed Planar Graphs via Shortest Paths	2014-01-17	Paper
The knapsack problem with neighbour constraints	2013-01-18	Paper
Connectivity Oracles for Planar Graphs	2012-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q5389975	2012-04-24	Paper
The 1-Neighbour Knapsack Problem	2012-01-13	Paper
Randomly removing \(g\) handles at once	2010-09-02	Paper
An O (n log n) algorithm for maximum st-flow in a directed planar graph	2010-08-16	Paper
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon	2009-02-17	Paper
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs	2008-08-28	Paper
Safe and tight linear estimators for global optimization	2005-04-29	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Glencora Borradaile