| Publication | Date of Publication | Type |
|---|
| Minor-free graphs have light spanners | 2025-08-06 | Paper |
| Min st-cut oracle for planar graphs with near-linear preprocessing time | 2025-04-29 | Paper |
scientific article; zbMATH DE number 7759283 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
(available as arXiv preprint) | 2023-11-02 | Paper |
A PTAS for three-edge-connected survivable network design in planar graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Greedy spanners are optimal in doubling metrics
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Density decompositions of networks
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
The two-edge connectivity survivable-network design problem in planar graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Optimal dynamic program for \(r\)-domination problems over tree decompositions
(available as arXiv preprint) | 2018-04-10 | Paper |
Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
Graphs and Combinatorics | 2018-02-14 | Paper |
All-pairs minimum cuts in near-linear time for surface-embedded graphs
(available as arXiv preprint) | 2018-01-30 | Paper |
| Minimum cycle and homology bases of surface embedded graphs | 2018-01-30 | Paper |
Randomly removing \(g\) handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
SIAM Journal on Computing | 2017-08-16 | Paper |
Egalitarian graph orientations
Journal of Graph Algorithms and Applications | 2017-07-13 | Paper |
Minimum cycle and homology bases of surface-embedded graphs
Journal of Computational Geometry | 2017-03-30 | Paper |
Improving robustness of next-hop routing
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
Computational Geometry | 2016-01-29 | Paper |
Towards single face shortest vertex-disjoint paths in undirected planar graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
An \(O(n\log n)\) algorithm for maximum \(st\)-flow in a directed planar graph
Journal of the ACM | 2015-11-11 | Paper |
Planar induced subgraphs of sparse graphs
Journal of Graph Algorithms and Applications | 2015-05-18 | Paper |
Planar induced subgraphs of sparse graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| scientific article; zbMATH DE number 6381762 (Why is no real title available?) | 2014-12-18 | Paper |
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Algorithmica | 2014-12-02 | Paper |
An O(n n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Covering nearly surface-embedded graphs with a fixed number of balls
Discrete & Computational Geometry | 2014-09-12 | Paper |
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Boundary-to-Boundary Flows in Planar Graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Maximum st-Flow in Directed Planar Graphs via Shortest Paths
Lecture Notes in Computer Science | 2014-01-17 | Paper |
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Connectivity Oracles for Planar Graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs | 2012-04-24 | Paper |
The 1-Neighbour Knapsack Problem
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Randomly removing \(g\) handles at once
Computational Geometry | 2010-09-02 | Paper |
An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
Lecture Notes in Computer Science | 2009-02-17 | Paper |
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Safe and tight linear estimators for global optimization
Mathematical Programming. Series A. Series B | 2005-04-29 | Paper |
