| 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
Theory of Computing Systems | 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 |
| scientific article; zbMATH DE number 7788499 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788598 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788645 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Exact distance oracles for planar graphs with failing vertices
ACM Transactions on Algorithms | 2023-10-31 | Paper |
On the hardness of computing the edit distance of shallow trees
String Processing and Information Retrieval | 2023-08-04 | Paper |
Compressed range minimum queries
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
ACM Transactions on Algorithms | 2023-04-26 | Paper |
| Dynamic String Alignment. | 2023-02-07 | Paper |
Fault-tolerant distance labeling for planar graphs
Theoretical Computer Science | 2022-05-10 | Paper |
Fault-tolerant distance labeling for planar graphs
Structural Information and Communication Complexity | 2022-03-22 | Paper |
Near-optimal distance emulator for planar graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Submatrix maximum queries in Monge and partial Monge matrices are equivalent to predecessor search
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
SIAM Journal on Computing | 2021-04-14 | Paper |
Dispersion on trees
(available as arXiv preprint) | 2020-05-27 | Paper |
Compressed range minimum queries
Theoretical Computer Science | 2020-02-20 | Paper |
Almost optimal distance oracles for planar graphs
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs
Theory of Computing Systems | 2019-12-19 | Paper |
Exact distance oracles for planar graphs with failing vertices
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Short and simple cycle separators in planar graphs
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 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
(available as arXiv preprint) | 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
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Efficient vertex-label distance oracles for planar graphs
Theory of Computing Systems | 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 |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
(available as arXiv preprint) | 2018-03-15 | Paper |
| Better tradeoffs for exact distance oracles in planar graphs | 2018-03-15 | Paper |
Better tradeoffs for exact distance oracles in planar graphs
(available as arXiv preprint) | 2018-03-15 | Paper |
| Near-optimal compression for the planar graph metric | 2018-03-15 | Paper |
Near-optimal compression for the planar graph metric
(available as arXiv preprint) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850341 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850341 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
| Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) | 2018-03-15 | Paper |
Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)
(available as arXiv preprint) | 2018-03-15 | Paper |
Faster shortest paths in dense distance graphs, with applications
Theoretical Computer Science | 2018-02-16 | Paper |
The nearest colored node in a tree
Theoretical Computer Science | 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
SIAM Journal on Computing | 2017-08-16 | Paper |
Short and simple cycle separators in planar graphs
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Efficient vertex-label distance oracles for planar graphs
Lecture Notes in Computer Science | 2016-02-26 | Paper |
Submatrix maximum queries in Monge matrices are equivalent to predecessor search
Automata, Languages, and Programming | 2015-10-27 | Paper |
A polynomial-time bicriteria approximation scheme for planar bisection
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | 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 |
Improved submatrix maximum queries in Monge matrices
Automata, Languages, and Programming | 2014-07-01 | Paper |
Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The train delivery problem -- vehicle routing meets bin packing
Approximation and Online Algorithms | 2011-02-15 | Paper |
Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764837 (Why is no real title available?) | 2010-08-06 | Paper |
Fast algorithms for computing tree LCS
Theoretical Computer Science | 2009-10-09 | Paper |
Speeding up HMM decoding and training by exploiting sequence repetitions
Algorithmica | 2009-08-27 | Paper |
New construction for a QMA complete three-local Hamiltonian
Journal of Mathematical Physics | 2008-10-14 | Paper |
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Fast Algorithms for Computing Tree LCS
Combinatorial Pattern Matching | 2008-06-17 | Paper |
An Optimal Decomposition Algorithm for Tree Edit Distance
Automata, Languages and Programming | 2007-11-28 | Paper |
