| Publication | Date of Publication | Type |
|---|
| A quasipolynomial (2 + ε )-approximation for planar sparsest cut | 2023-11-14 | Paper |
| Correlation clustering and two-edge-connected augmentation for planar graphs | 2023-10-06 | Paper |
| A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs | 2023-01-18 | Paper |
| Detecting race conditions in parallel programs that use one semaphore | 2023-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009565 | 2021-08-04 | Paper |
| New hardness results for planar graph problems in p and an algorithm for sparsest cut | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111697 | 2020-05-27 | Paper |
| A PTAS for bounded-capacity vehicle routing in planar graphs | 2020-01-16 | Paper |
| Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems | 2019-10-15 | Paper |
| Approximating k-center in planar graphs | 2019-06-20 | Paper |
| A subexponential parameterized algorithm for Subset TSP on planar graphs | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743426 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743427 | 2019-05-10 | Paper |
| Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633831 | 2019-05-06 | Paper |
| The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs | 2018-11-05 | Paper |
| Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs | 2018-10-30 | Paper |
| A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580152 | 2018-08-13 | Paper |
| Race-condition detection in parallel computation with semaphores (extended abstract) | 2017-12-05 | Paper |
| Approximating connectivity domination in weighted bounded-genus graphs | 2017-09-29 | Paper |
| Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time | 2017-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955023 | 2017-01-24 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2016-09-29 | Paper |
| A randomized linear-time algorithm for finding minimum spanning trees | 2016-09-01 | Paper |
| Faster shortest-path algorithms for planar graphs | 2016-09-01 | Paper |
| An O ( n log n ) algorithm for maximum st -flow in a directed planar graph | 2015-11-11 | Paper |
| On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms | 2015-09-02 | Paper |
| A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection | 2015-08-21 | Paper |
| Excluded minors, network decomposition, and multicommodity flow | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934724 | 2014-12-18 | Paper |
| A subset spanner for Planar graphs, with application to subset TSP | 2014-11-25 | Paper |
| An O ( n log n ) approximation scheme for Steiner tree in planar graphs | 2014-11-18 | Paper |
| Shortest paths in directed planar graphs with negative lengths | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921664 | 2014-10-13 | Paper |
| Structured recursive separator decompositions for planar graphs in linear time | 2014-08-07 | Paper |
| Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs | 2014-08-07 | Paper |
| Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time | 2014-07-30 | Paper |
| A Cryptography Primer | 2014-07-09 | Paper |
| Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time | 2013-08-12 | Paper |
| Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time | 2011-08-12 | Paper |
| Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs | 2011-07-06 | Paper |
| An O (n log n) algorithm for maximum st-flow in a directed planar graph | 2010-08-16 | Paper |
| Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs | 2009-07-14 | Paper |
| Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon | 2009-02-17 | Paper |
| A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights | 2008-12-22 | Paper |
| The Two-Edge Connectivity Survivable Network Problem in Planar Graphs | 2008-08-28 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2005-11-11 | Paper |
| Approximation algorithms for finding low-degree subgraphs | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829018 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459561 | 2004-03-29 | Paper |
| Detecting race conditions in parallel programs that use semaphores | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768381 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531827 | 2002-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263721 | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234131 | 2000-08-03 | Paper |
| A data structure for bicategories, with application to speeding up an approximation algorithm | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228487 | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952689 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952720 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252025 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234152 | 1999-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250161 | 1999-06-17 | Paper |
| A fully dynamic approximation scheme for shortest paths in planar graphs | 1999-01-06 | Paper |
| A randomized linear-time algorithm to find minimum spanning trees | 1998-02-02 | Paper |
| A Randomized Parallel Algorithm for Single-Source Shortest Paths | 1997-12-18 | Paper |
| Faster shortest-path algorithms for planar graphs | 1997-10-28 | Paper |
| Approximation Algorithms for Steiner and Directed Multicuts | 1997-07-06 | Paper |
| Efficient Parallel Algorithms for Chordal Graphs | 1996-10-16 | Paper |
| An approximate max-flow min-cut relation for undirected multicommodity flow, with applications | 1996-04-16 | Paper |
| A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees | 1996-04-11 | Paper |
| When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks | 1995-07-26 | Paper |
| Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs | 1994-09-18 | Paper |
| Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts | 1994-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283450 | 1994-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288579 | 1994-04-19 | Paper |
| The Lattice Structure of Flow in Planar Graphs | 1993-10-14 | Paper |
| Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036610 | 1993-05-18 | Paper |
| A parallel algorithm for approximating the minimum cycle cover | 1993-04-01 | Paper |
| A parallel algorithm for eliminating cycles in undirected graphs | 1990-01-01 | Paper |
| On the time-space complexity of reachability queries for preprocessed graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732113 | 1989-01-01 | Paper |
| An efficient parallel algorithm for planarity | 1988-01-01 | Paper |
| Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM | 1988-01-01 | Paper |
