| Publication | Date of Publication | Type |
|---|
| The role of regularity in (hyper-)clique detection and implications for optimizing Boolean CSPs | 2026-09-29 | Paper |
| (Multivariate) k-SUM as barrier to succinct computation | 2026-08-31 | Paper |
| Fine-grained classification of detecting dominating patterns (edit) | 2026-08-31 | Paper |
| Fine-grained complexity of multiple domination and dominating patterns in sparse graphs | 2026-05-29 | Paper |
| Exploring the approximability landscape of 3SUM | 2026-05-26 | Paper |
Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
Journal of the ACM | 2025-11-27 | Paper |
| The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds | 2025-11-04 | Paper |
Smoothed analysis of the 2-opt heuristic for the TSP under Gaussian noise
Algorithmica | 2025-09-24 | Paper |
| A tight (non-combinatorial) conditional lower bound for Klee's measure problem in 3D | 2025-08-15 | Paper |
| Fine-grained complexity of analyzing compressed data: quantifying improvements over decompress-and-solve | 2025-08-06 | Paper |
| Quadratic conditional lower bounds for string problems and dynamic time warping | 2025-08-05 | Paper |
| The time complexity of fully sparse matrix multiplication | 2024-11-28 | Paper |
| The effect of sparsity on k-Dominating Set and related first-order graph properties | 2024-11-28 | Paper |
| Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality | 2024-11-14 | Paper |
The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
TheoretiCS | 2024-11-05 | Paper |
| Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) | 2024-10-16 | Paper |
| Polygon placement revisited: (degree of freedom + 1)-SUM hardness and an improvement via offline dynamic rectangle union | 2024-07-19 | Paper |
| A structural investigation of the approximability of polynomial-time problems | 2024-06-24 | Paper |
| Dynamic time warping under translation: approximation guided by space-filling curves | 2024-05-14 | Paper |
| Towards sub-quadratic diameter computation in geometric intersection graphs | 2024-05-14 | Paper |
| The fine-grained complexity of multi-dimensional ordering properties | 2024-02-12 | Paper |
Dynamic time warping under translation: approximation guided by space-filling curves
(available as arXiv preprint) | 2023-12-20 | Paper |
| Dynamic time warping under translation: approximation guided by space-filling curves | 2023-12-20 | Paper |
scientific article; zbMATH DE number 7768354 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
(available as arXiv preprint) | 2023-02-07 | Paper |
The fine-grained complexity of multi-dimensional ordering properties
Algorithmica | 2022-10-27 | Paper |
| A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties | 2022-07-27 | Paper |
Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction
(available as arXiv preprint) | 2022-07-21 | Paper |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance | 2022-07-18 | Paper |
Discrete Fréchet Distance under Translation
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Walking the dog fast in practice: algorithm engineering of the Fréchet distance
(available as arXiv preprint) | 2021-09-07 | Paper |
On nondeterministic derandomization of Freivalds' algorithm: consequences, avenues and algorithmic progress
(available as arXiv preprint) | 2021-08-04 | Paper |
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
scientific article; zbMATH DE number 7204473 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Secretary markets with local information
Distributed Computing | 2019-11-27 | Paper |
Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Tight analysis of randomized rumor spreading in complete graphs
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Dependent Randomized Rounding: The Bipartite Case
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Quasirandom Rumor Spreading: An Experimental Analysis
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Subquadratic algorithms for succinct stable matching
Algorithmica | 2019-05-21 | Paper |
Multivariate fine-grained complexity of longest common subsequence
(available as arXiv preprint) | 2018-03-15 | Paper |
| Multivariate fine-grained complexity of longest common subsequence | 2018-03-15 | Paper |
Improved protocols and hardness results for the two-player cryptogenography problem
(available as arXiv preprint) | 2017-12-19 | Paper |
Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
Algorithms and Computation | 2016-01-11 | Paper |
A quantization framework for smoothed analysis of Euclidean optimization problems
Algorithmica | 2015-11-19 | Paper |
Secretary markets with local information
Automata, Languages, and Programming | 2015-11-04 | Paper |
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
Automata, Languages, and Programming | 2015-10-27 | Paper |
Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
Theoretical Computer Science | 2014-12-02 | Paper |
Quasirandom rumor spreading, an experimental analysis
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
A quantization framework for smoothed analysis of Euclidean optimization problems
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Randomized rounding for routing and covering problems: experiments and improvements
Experimental Algorithms | 2010-05-04 | Paper |
