| 2026 | ALENEX | Engineering Dominating Patterns: A Fine-grained Case Study. | Jonathan Dransfeld, Marvin Knnemann, Mirza Redzic, Marcus Wunderlich |
| 2026 | ICALP | When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs? | Timo Fritsch, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2026 | STOC | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2025 | ESA | Fine-Grained Classification of Detecting Dominating Patterns. | Jonathan Dransfeld, Marvin Knnemann, Mirza Redzic |
| 2025 | ESA | (Multivariate) k-SUM as Barrier to Succinct Computation. | Geri Gokaj, Marvin Knnemann, Sabine Storandt, Carina Truschel |
| 2025 | ICALP | The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. | Nick Fischer, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2024 | ESA | Exploring the Approximability Landscape of 3SUM. | Karl Bringmann, Ahmed Ghazy, Marvin Knnemann |
| 2024 | SODA | The Time Complexity of Fully Sparse Matrix Multiplication. | Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Knnemann |
| 2024 | SODA | The Effect of Sparsity on | Nick Fischer, Marvin Knnemann, Mirza Redzic |
| 2023 | ICALP | Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. | Marvin Knnemann, Filip Mazowiecki, Lia Schtze, Henry Sinclair-Banks, Karol Wegrzycki |
| 2022 | FOCS | A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D. | Marvin Knnemann |
| 2022 | ICALP | A Structural Investigation of the Approximability of Polynomial-Time Problems. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Knnemann |
| 2022 | SODA | Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. | Marvin Knnemann, Andr Nusser |
| 2020 | ESA | When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Frchet Distance Under Translation. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2019 | SODA | Frchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2019 | SODA | Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. | Karl Bringmann, Marvin Knnemann, Philip Wellnitz |
| 2019 | STOC | Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. | Karl Bringmann, Marvin Knnemann, Karol Wegrzycki |
| 2018 | ESA | On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. | Marvin Knnemann |
| 2018 | SODA | Multivariate Fine-Grained Complexity of Longest Common Subsequence. | Karl Bringmann, Marvin Knnemann |
| 2017 | FOCS | Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. | Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Knnemann |
| 2017 | ICALP | On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. | Marvin Knnemann, Ramamohan Paturi, Stefan Schneider |
| 2016 | ICALP | Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. | Benjamin Doerr, Marvin Knnemann |
| 2015 | FOCS | Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. | Karl Bringmann, Marvin Knnemann |
| 2015 | ICALP | Secretary Markets with Local Information. | Ning Chen, Martin Hoefer, Marvin Knnemann, Chengyu Lin, Peihan Miao |
| 2015 | ICALP | Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic. | Marvin Knnemann, Bodo Manthey |
| 2015 | ISAAC | Improved Approximation for Frchet Distance on c-packed Curves Matching Conditional Lower Bounds. | Karl Bringmann, Marvin Knnemann |
| 2013 | CEC | Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. | Benjamin Doerr, Marvin Knnemann |
| 2013 | ESA | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. | Radu Curticapean, Marvin Knnemann |
| 2013 | GECCO | How the (1+λ) evolutionary algorithm optimizes linear functions. | Benjamin Doerr, Marvin Knnemann |
| 2011 | ALENEX | Dependent Randomized Rounding: The Bipartite Case. | Benjamin Doerr, Marvin Knnemann, Magnus Wahlstrm |
| 2009 | ALENEX | Quasirandom Rumor Spreading: An Experimental Analysis. | Benjamin Doerr, Tobias Friedrich, Marvin Knnemann, Thomas Sauerwald |