Glencora Borradaile

Brett Burkhardt

Alexandria LeClerc

Proceedings of the FAT* '20: Conference on Fairness, 2020

Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes.

[BibT_eX]

[DOI]

William Maxwell

Amir Nayyeri

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Density decompositions of networks.

[BibT_eX]

[DOI]

Theresa Migler

J. Graph Algorithms Appl., 2019

Greedy spanners are optimal in doubling metrics.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Minimum cycle and homology bases of surface-embedded graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Egalitarian Graph Orientations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph.

[BibT_eX]

[DOI]

Melissa Sherman-Bennett

Graphs Comb., 2017

Time-dependent shortest paths in bounded treewidth graphs.

[BibT_eX]

[DOI]

Morgan Shirley

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Minor-Free Graphs Have Light Spanners.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Planarity Testing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Planar Maximum s- t Flow.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Improving robustness of next-hop routing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

A PTAS for Three-Edge Connectivity in Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Dynamic Program for r-Domination Problems over Tree Decompositions.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.

[BibT_eX]

[DOI]

Amir Nayyeri

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.

[BibT_eX]

[DOI]

Piotr Sankowski

ACM Trans. Algorithms, 2015

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Planar Induced Subgraphs of Sparse Graphs.

[BibT_eX]

[DOI]

Pingan Zhu

J. Graph Algorithms Appl., 2015

Near-linear-time deterministic plane Steiner spanners for well-spaced point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs.

[BibT_eX]

[DOI]

Amir Nayyeri

Farzad Zafarani

Proceedings of the Algorithms - ESA 2015, 2015

2014

Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls.

[BibT_eX]

[DOI]

Erin Wolf Chambers

Discret. Comput. Geom., 2014

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

[BibT_eX]

[DOI]

Theresa Migler

CoRR, 2014

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

[BibT_eX]

[DOI]

Erik D. Demaine

Siamak Tazari

Algorithmica, 2014

2013

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

Maximum st-Flow in Directed Planar Graphs via Shortest Paths.

[BibT_eX]

[DOI]

Anna Harutyunyan

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Boundary-to-Boundary Flows in Planar Graphs.

[BibT_eX]

[DOI]

Anna Harutyunyan

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

The knapsack problem with neighbour constraints.

[BibT_eX]

[DOI]

Brent Heeringa

J. Discrete Algorithms, 2012

Planted-model evaluation of algorithms for identifying differences between spreadsheets.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, 2012

Connectivity Oracles for Planar Graphs.

[BibT_eX]

[DOI]

Seth Pettie

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Batch Active Learning via Coordinated Matching.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

The 1-Neighbour Knapsack Problem.

[BibT_eX]

[DOI]

Brent Heeringa

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Multiple source, single sink maximum flow in a planar graph

[BibT_eX]

[DOI]

CoRR, 2010

Randomly removing g handles at once.

[BibT_eX]

[DOI]

James R. Lee

Anastasios Sidiropoulos

Comput. Geom., 2010

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.

[BibT_eX]

[DOI]

Piotr Sankowski

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.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

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

[BibT_eX]

[DOI]

J. ACM, 2009

Approximation Algorithms for Constrained Knapsack Problems

[BibT_eX]

[DOI]

Brent Heeringa

CoRR, 2009

2008

Planarity Testing.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Exploiting Planarity for Network Flow and Connectivity Problems.

[BibT_eX]

[DOI]

PhD thesis, 2008

The Two-Edge Connectivity Survivable Network Problem in Planar Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A polynomial-time approximation scheme for Steiner tree in planar graphs.

[BibT_eX]

[DOI]

Claire Kenyon-Mathieu

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.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Safe and tight linear estimators for global optimization.

[BibT_eX]

[DOI]