| Publication | Date of Publication | Type |
|---|
| What else can Voronoi diagrams do for diameter in planar graphs? | 2025-01-06 | Paper |
| Minimum cut in \(O(m \log^2 n)\) time | 2024-10-07 | Paper |
| Improved compression of the Okamura-Seymour metric | 2024-09-11 | Paper |
| A note on a recent algorithm for minimum cut | 2024-05-14 | Paper |
| The fine-grained complexity of episode matching | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147419 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147524 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187842 | 2024-01-15 | Paper |
| Exact Distance Oracles for Planar Graphs with Failing Vertices | 2023-10-31 | Paper |
| On the hardness of computing the edit distance of shallow trees | 2023-08-04 | Paper |
| Compressed range minimum queries | 2023-07-28 | Paper |
| Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) | 2023-04-26 | Paper |
| Dynamic String Alignment. | 2023-02-07 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-05-10 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-03-22 | Paper |
| Near-optimal distance emulator for planar graphs | 2021-08-04 | Paper |
| Submatrix maximum queries in Monge and partial Monge matrices are equivalent to predecessor search | 2021-05-03 | Paper |
| Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time | 2021-04-14 | Paper |
| Dispersion on trees | 2020-05-27 | Paper |
| Compressed range minimum queries | 2020-02-20 | Paper |
| Almost optimal distance oracles for planar graphs | 2020-01-30 | Paper |
| Efficient dynamic approximate distance oracles for vertex-labeled planar graphs | 2019-12-19 | Paper |
| Exact Distance Oracles for Planar Graphs with Failing Vertices | 2019-10-15 | Paper |
| Short and simple cycle separators in planar graphs | 2019-09-12 | Paper |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications | 2019-05-10 | Paper |
| Exact distance oracles for planar graphs | 2019-05-10 | Paper |
| Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n \log^2 n)\)-time algorithm | 2019-05-06 | Paper |
| Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications | 2018-11-05 | Paper |
| Efficient dynamic approximate distance oracles for vertex-labeled planar graphs | 2018-06-22 | Paper |
| Efficient vertex-label distance oracles for planar graphs | 2018-04-12 | Paper |
| Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time | 2018-03-15 | Paper |
| Better tradeoffs for exact distance oracles in planar graphs | 2018-03-15 | Paper |
| Near-optimal compression for the planar graph metric | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607913 | 2018-03-15 | Paper |
| Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) | 2018-03-15 | Paper |
| Faster shortest paths in dense distance graphs, with applications | 2018-02-16 | Paper |
| The nearest colored node in a tree | 2018-02-16 | Paper |
| The nearest colored node in a tree | 2017-10-17 | Paper |
| Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time | 2017-08-16 | Paper |
| Short and simple cycle separators in planar graphs | 2017-06-16 | Paper |
| Efficient vertex-label distance oracles for planar graphs | 2016-02-26 | Paper |
| Submatrix maximum queries in Monge matrices are equivalent to predecessor search | 2015-10-27 | Paper |
| A polynomial-time bicriteria approximation scheme for planar bisection | 2015-08-21 | Paper |
| Shortest paths in directed planar graphs with negative lengths | 2014-11-18 | Paper |
| An optimal decomposition algorithm for tree edit distance | 2014-11-18 | Paper |
| Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm | 2014-11-18 | Paper |
| Structured recursive separator decompositions for planar graphs in linear time | 2014-08-07 | Paper |
| Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time | 2014-07-30 | Paper |
| Improved submatrix maximum queries in Monge matrices | 2014-07-01 | Paper |
| Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time | 2011-08-12 | Paper |
| The train delivery problem -- vehicle routing meets bin packing | 2011-02-15 | Paper |
| Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579429 | 2010-08-06 | Paper |
| Fast algorithms for computing tree LCS | 2009-10-09 | Paper |
| Speeding up HMM decoding and training by exploiting sequence repetitions | 2009-08-27 | Paper |
| New construction for a QMA complete three-local Hamiltonian | 2008-10-14 | Paper |
| Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions | 2008-06-17 | Paper |
| Fast Algorithms for Computing Tree LCS | 2008-06-17 | Paper |
| An Optimal Decomposition Algorithm for Tree Edit Distance | 2007-11-28 | Paper |
