| Publication | Date of Publication | Type |
|---|
| 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q6152159 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6182148 | 2023-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090879 | 2023-11-20 | Paper |
| When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation | 2023-02-07 | Paper |
| The fine-grained complexity of multi-dimensional ordering properties | 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 | 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 | 2022-02-16 | Paper |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance | 2021-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009621 | 2021-08-04 | Paper |
| Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem | 2020-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111351 | 2020-05-27 | Paper |
| Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max | 2020-01-30 | Paper |
| Secretary markets with local information | 2019-11-27 | Paper |
| Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability | 2019-10-15 | Paper |
| Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts | 2019-10-15 | Paper |
| Tight Analysis of Randomized Rumor Spreading in Complete Graphs | 2019-09-17 | Paper |
| Dependent Randomized Rounding: The Bipartite Case | 2019-09-12 | Paper |
| Quasirandom Rumor Spreading: An Experimental Analysis | 2019-09-11 | Paper |
| Subquadratic algorithms for succinct stable matching | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607967 | 2018-03-15 | Paper |
| Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem | 2017-12-19 | Paper |
| Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds | 2017-10-20 | Paper |
| Subquadratic algorithms for succinct stable matching | 2016-07-25 | Paper |
| Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds | 2016-01-11 | Paper |
| A quantization framework for smoothed analysis of Euclidean optimization problems | 2015-11-19 | Paper |
| Secretary Markets with Local Information | 2015-11-04 | Paper |
| Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic | 2015-10-27 | Paper |
| Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances | 2014-12-02 | Paper |
| Quasirandom rumor spreading | 2014-04-01 | Paper |
| A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems | 2013-09-17 | Paper |
| Randomized Rounding for Routing and Covering Problems: Experiments and Improvements | 2010-05-04 | Paper |
