| Publication | Date of Publication | Type |
|---|
| On complexity of 1-center in various metrics | 2025-01-14 | Paper |
| On diameter approximation in directed graphs | 2025-01-06 | Paper |
| Can you solve closest string faster than exhaustive search? | 2025-01-06 | Paper |
| What else can Voronoi diagrams do for diameter in planar graphs? | 2025-01-06 | Paper |
| The time complexity of fully sparse matrix multiplication | 2024-11-28 | Paper |
| Worst-case to expander-case reductions | 2024-09-25 | Paper |
| Friendly cut sparsifiers and faster Gomory-Hu trees | 2024-07-19 | Paper |
| Improved approximation algorithms and lower bounds for search-diversification problems | 2024-06-24 | Paper |
| Faster combinatorial \(k\)-clique algorithms | 2024-05-31 | Paper |
| On the fine-grained complexity of approximating \(k\)-center in sparse graphs | 2024-05-14 | Paper |
| Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics | 2024-05-08 | Paper |
| Reachability Preservers: New Extremal Bounds and Approximation Algorithms | 2024-03-19 | Paper |
| Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond | 2023-12-08 | Paper |
| Subcubic algorithms for Gomory–Hu tree in unweighted graphs | 2023-11-14 | Paper |
| SETH-based Lower Bounds for Subset Sum and Bicriteria Path | 2023-10-31 | Paper |
| Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091155 | 2022-07-21 | Paper |
| Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. | 2022-07-21 | Paper |
| Scheduling lower bounds via AND subset sum | 2022-04-04 | Paper |
| Smaller Cuts, Higher Lower Bounds | 2022-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5158499 | 2021-10-25 | Paper |
| Tighter connections between Formula-SAT and shaving logs | 2021-07-28 | Paper |
| Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds | 2021-06-15 | Paper |
| New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs | 2021-02-02 | Paper |
| Fooling views: a new lower bound technique for distributed computations under congestion | 2021-01-22 | Paper |
| New hardness results for planar graph problems in p and an algorithm for sparsest cut | 2021-01-19 | Paper |
| Dynamic set cover: improved algorithms and lower bounds | 2020-01-30 | Paper |
| SETH-based lower bounds for subset sum and bicriteria path | 2019-10-15 | Paper |
| More consequences of falsifying SETH and the orthogonal vectors conjecture | 2019-08-22 | Paper |
| If the current clique algorithms are optimal, so is Valiant's parser | 2018-12-19 | Paper |
| A hierarchy of lower bounds for sublinear additive spanners | 2018-12-05 | Paper |
| Subtree isomorphism revisited | 2018-11-13 | Paper |
| Near-linear lower bounds for distributed distance computations, even in sparse networks | 2018-08-16 | Paper |
| Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs | 2018-07-16 | Paper |
| Subtree isomorphism revisited | 2018-07-16 | Paper |
| A Hierarchy of Lower Bounds for Sublinear Additive Spanners | 2018-07-16 | Paper |
| Error Amplification for Pairwise Spanner Lower Bounds | 2018-07-16 | Paper |
| Matching Triangles and Basing Hardness on an Extremely Popular Conjecture | 2018-07-04 | Paper |
| The 4/3 additive spanner exponent is tight | 2018-05-17 | Paper |
| Towards hardness of approximation for polynomial time problems | 2018-05-03 | Paper |
| Near-optimal compression for the planar graph metric | 2018-03-15 | Paper |
| Reachability preservers: new extremal bounds and approximation algorithms | 2018-03-15 | Paper |
| Subcubic equivalences between graph centrality problems, APSP and diameter | 2017-10-05 | Paper |
| More applications of the polynomial method to algorithm design | 2017-10-05 | Paper |
| The 4/3 additive spanner exponent is tight | 2017-09-29 | Paper |
| Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made | 2017-09-29 | Paper |
| Matching triangles and basing hardness on an extremely popular conjecture | 2015-08-21 | Paper |
| Losing weight by gaining edges | 2014-10-08 | Paper |
| Consequences of Faster Alignment of Sequences | 2014-07-01 | Paper |
| Exact weight subgraphs and the \(k\)-sum conjecture | 2013-08-06 | Paper |
