| Publication | Date of Publication | Type |
|---|
| Faster 0-1-knapsack via near-convex min-plus-convolution | 2025-01-06 | Paper |
| Faster sublinear-time edit distance | 2024-11-28 | Paper |
| The time complexity of fully sparse matrix multiplication | 2024-11-28 | Paper |
| Dynamic dynamic time warping | 2024-11-28 | Paper |
| Approximating Subset Sum Ratio faster than Subset Sum | 2024-11-28 | Paper |
| The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds | 2024-11-05 | Paper |
| Tight bounds for approximate near neighbor searching for time series under the Fréchet distance | 2024-07-19 | Paper |
| Deterministic and Las Vegas algorithms for sparse nonnegative convolution | 2024-07-19 | Paper |
| A structural investigation of the approximability of polynomial-time problems | 2024-06-24 | Paper |
| Faster knapsack algorithms via bounded monotone min-plus-convolution | 2024-06-24 | Paper |
| Improved sublinear-time edit distance for preprocessed strings | 2024-06-24 | Paper |
| Traversing the FFT computation tree for dimension-independent sparse Fourier transforms | 2024-05-14 | Paper |
| Fast and simple modular subset sum | 2024-05-14 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | 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 |
| Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147362 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147363 | 2024-01-15 | Paper |
| Dynamic time warping under translation: approximation guided by space-filling curves | 2023-12-20 | Paper |
| Almost-optimal sublinear-time edit distance in the low distance regime | 2023-12-08 | Paper |
| Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090879 | 2023-11-20 | Paper |
| Sparse nonnegative convolution is equivalent to dense nonnegative convolution | 2023-11-14 | Paper |
| SETH-based Lower Bounds for Subset Sum and Bicriteria Path | 2023-10-31 | Paper |
| A Linear-Time n 0.4 -Approximation for Longest Common Subsequence | 2023-10-23 | Paper |
| Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) | 2023-04-26 | Paper |
| When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5044450 | 2022-10-31 | Paper |
| A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090981 | 2022-07-21 | Paper |
| Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088945 | 2022-07-18 | Paper |
| Fine-Grained Complexity Theory (Tutorial) | 2022-07-18 | Paper |
| On Geometric Set Cover for Orthants | 2022-05-11 | Paper |
| Faster minimization of tardy processing time on a single machine | 2022-05-03 | Paper |
| Scheduling lower bounds via AND subset sum | 2022-04-04 | Paper |
| Fine-grained complexity theory: conditional lower bounds for computational geometry | 2022-03-22 | Paper |
| Discrete Fréchet Distance under Translation | 2022-02-16 | Paper |
| Greedy routing and the algorithmic small-world phenomenon | 2022-01-31 | Paper |
| Walking the dog fast in practice: algorithm engineering of the Fréchet distance | 2021-09-07 | Paper |
| Multivariate analysis of orthogonal range searching and graph distances | 2021-08-04 | Paper |
| Tighter connections between Formula-SAT and shaving logs | 2021-07-28 | Paper |
| Polyline simplification has cubic complexity | 2021-03-17 | Paper |
| Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum | 2021-01-19 | Paper |
| Multivariate analysis of orthogonal range searching and graph distances | 2020-08-12 | Paper |
| Sampling geometric inhomogeneous random graphs in linear time | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111456 | 2020-05-27 | Paper |
| On algebraic branching programs of small width | 2020-05-26 | Paper |
| Clique-based lower bounds for parsing tree-adjoining grammars | 2020-05-25 | Paper |
| Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max | 2020-01-30 | Paper |
| A PTAS for ℓp-Low Rank Approximation | 2019-10-15 | Paper |
| Fréchet distance under translation: conditional hardness and an algorithm via offline dynamic grid reachability | 2019-10-15 | Paper |
| SETH-based lower bounds for subset sum and bicriteria path | 2019-10-15 | Paper |
| Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts | 2019-10-15 | Paper |
| More consequences of falsifying SETH and the orthogonal vectors conjecture | 2019-08-22 | Paper |
| Fast fencing | 2019-08-22 | Paper |
| Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product | 2019-05-07 | Paper |
| On Algebraic Branching Programs of Small Width | 2019-02-25 | Paper |
| Geometric inhomogeneous random graphs | 2019-01-25 | Paper |
| De-anonymization of heterogeneous random graphs in quasilinear time | 2019-01-11 | Paper |
| Maximum volume subset selection for anchored boxes | 2018-08-13 | Paper |
| A near-linear pseudopolynomial time algorithm for subset sum | 2018-07-16 | Paper |
| A note on hardness of diameter approximation | 2018-03-16 | Paper |
| Multivariate fine-grained complexity of longest common subsequence | 2018-03-15 | Paper |
| Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) | 2018-03-15 | Paper |
| Hitting Set for hypergraphs of low VC-dimension | 2018-03-02 | Paper |
| Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds | 2017-10-20 | Paper |
| Greedy routing and the algorithmic small-world phenomenon | 2017-10-11 | Paper |
| Efficient sampling methods for discrete distributions | 2017-10-10 | Paper |
| Approximability of the discrete Fréchet distance | 2017-10-10 | Paper |
| Don't be greedy when calculating hypervolume contributions | 2017-07-14 | Paper |
| The logarithmic hypervolume indicator | 2017-07-14 | Paper |
| Approximability of the discrete Fréchet distance | 2017-03-30 | Paper |
| Balls into bins via local search: cover time and maximum load | 2017-03-03 | Paper |
| Parameterized complexity dichotomy for Steiner Multicut | 2017-01-24 | Paper |
| Efficient optimization of many objectives by approximation-guided evolution | 2016-10-06 | Paper |
| Balls into bins via local search: cover time and maximum load | 2016-07-25 | Paper |
| Parameterized complexity dichotomy for \textsc{Steiner Multicut} | 2016-06-13 | Paper |
| Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds | 2016-01-11 | Paper |
| Online checkpointing with improved worst-case guarantees | 2015-12-21 | Paper |
| Ultra-fast load balancing on scale-free networks | 2015-11-04 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2015-09-03 | Paper |
| Speeding up many-objective optimization by Monte Carlo approximations | 2015-08-27 | Paper |
| Counting triangulations and other crossing-free structures via onion layers | 2015-06-26 | Paper |
| Counting triangulations and other crossing-free structures approximately | 2015-04-27 | Paper |
| De-anonymization of heterogeneous random graphs in quasilinear time | 2014-10-08 | Paper |
| Succinct sampling from discrete distributions | 2014-08-07 | Paper |
| Counting crossing-free structures | 2014-08-07 | Paper |
| Internal DLA: efficient simulation of a physical growth model (extended abstract) | 2014-07-01 | Paper |
| Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\) | 2014-04-03 | Paper |
| A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations | 2013-12-11 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2013-09-20 | Paper |
| Bringing order to special cases of Klee's measure problem | 2013-09-20 | Paper |
| Approximation quality of the hypervolume indicator | 2013-08-26 | Paper |
| Efficient sampling methods for discrete distributions | 2013-08-12 | Paper |
| Exact and efficient generation of geometric random variates and random graphs | 2013-08-06 | Paper |
| Online checkpointing with improved worst-case guarantees | 2013-08-06 | Paper |
| An improved algorithm for Klee's measure problem on fat boxes | 2012-05-18 | Paper |
| Approximating the least hypervolume contributor: NP-hard in general, but fast in practice | 2012-05-14 | Paper |
| Tight bounds for the approximation ratio of the hypervolume indicator | 2010-10-26 | Paper |
| Approximating the volume of unions and intersections of high-dimensional geometric objects | 2010-07-28 | Paper |
| Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects | 2009-01-29 | Paper |
