| 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 |
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 |
Top Tree Compression of Tries.
| 2023-02-03 | 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 |
Top tree compression of tries
Algorithmica | 2022-01-18 | Paper |
Near-optimal distance emulator for planar graphs
| 2021-08-04 | Paper |
A faster construction of greedy consensus trees
| 2021-07-28 | Paper |
A faster FPTAS for \#Knapsack
| 2021-07-28 | 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 |
Incremental distance products via faulty shortest paths
Information Processing Letters | 2020-08-04 | Paper |
Dispersion on trees
| 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 |
Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n \log^2 n)\)-time algorithm
| 2019-05-06 | Paper |
Approximating the Diameter of Planar Graphs in Near Linear Time
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Bookmarks in grammar-compressed strings
| 2018-10-17 | Paper |
Improved bounds for randomized preemptive online matching
Information and Computation | 2018-03-21 | 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 |
scientific article; zbMATH DE number 6850341 (Why is no real title available?)
| 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
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 |
Optimal distance labeling schemes for trees
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Random access to grammar-compressed strings
| 2017-09-29 | Paper |
On Cartesian trees and range minimum queries
Algorithmica | 2017-05-17 | Paper |
Improved bounds for online preemptive matching
| 2017-01-30 | Paper |
Longest common extensions in trees
Theoretical Computer Science | 2016-06-16 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Algorithmica | 2015-11-19 | Paper |
Submatrix maximum queries in Monge matrices are equivalent to predecessor search
Automata, Languages, and Programming | 2015-10-27 | Paper |
Longest common extensions in trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Random access to grammar-compressed strings and trees
SIAM Journal on Computing | 2015-06-11 | Paper |
Tree compression with top trees
Information and Computation | 2015-06-09 | Paper |
Replacement paths and distance sensitivity oracles via fast matrix multiplication
ACM Transactions on Algorithms | 2014-12-05 | 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 |
Consequences of Faster Alignment of Sequences
Automata, Languages, and Programming | 2014-07-01 | Paper |
Improved submatrix maximum queries in Monge matrices
Automata, Languages, and Programming | 2014-07-01 | Paper |
Approximating the maximum consecutive subsums of a sequence
Theoretical Computer Science | 2014-03-13 | Paper |
Towards optimal packed string matching
Theoretical Computer Science | 2014-03-13 | Paper |
On approximating string selection problems with outliers
Theoretical Computer Science | 2014-01-10 | Paper |
Binary jumbled pattern matching on trees and tree-like structures
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximating the diameter of planar graphs in near linear time
Automata, Languages, and Programming | 2013-08-06 | Paper |
Tree compression with top trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
A note on exact distance labeling
Information Processing Letters | 2013-04-04 | Paper |
Unified compression-based acceleration of edit-distance computation
Algorithmica | 2013-03-05 | Paper |
Optimal packed string matching
| 2012-08-31 | Paper |
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
Combinatorial Pattern Matching | 2012-08-14 | Paper |
On approximating string selection problems with outliers
Combinatorial Pattern Matching | 2012-08-14 | Paper |
A unified algorithm for accelerating edit-distance computation via text-compression
| 2012-04-24 | Paper |
Distance oracles for vertex-labeled graphs
Automata, Languages and Programming | 2011-07-07 | Paper |
Fast RNA structure alignment for crossing input structures
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Computing the girth of a planar graph in \(O(n \log n)\) time
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
scientific article; zbMATH DE number 5764837 (Why is no real title available?)
| 2010-08-06 | Paper |
Indexing a Dictionary for Subset Matching Queries
Algorithms and Applications | 2010-05-04 | 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 |
On Cartesian Trees and Range Minimum Queries
Automata, Languages and Programming | 2009-07-14 | Paper |
Computing the Girth of a Planar Graph in O(n logn) Time
Automata, Languages and Programming | 2009-07-14 | Paper |
Fast RNA Structure Alignment for Crossing Input Structures
Combinatorial Pattern Matching | 2009-07-07 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | 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 |
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
