Quasirandom Rumor Spreading: An Experimental Analysis. - Benjamin Doerr; Tobias Friedrich 001; Marvin Künnemann; Thomas Sauerwald (ALENEX, 2009)

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. - Benjamin Doerr; Marvin Künnemann; Magnus Wahlström (SEA, 2010)

Dependent Randomized Rounding: The Bipartite Case. - Benjamin Doerr; Marvin Künnemann; Magnus Wahlström (ALENEX, 2011)

Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. - Benjamin Doerr; Marvin Künnemann (IEEE Congress on Evolutionary Computation, 2013)

A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. - Radu Curticapean; Marvin Künnemann (ESA, 2013)

How the (1+λ) evolutionary algorithm optimizes linear functions. - Benjamin Doerr; Marvin Künnemann (GECCO, 2013)

Tight Analysis of Randomized Rumor Spreading in Complete Graphs. - Benjamin Doerr; Marvin Künnemann (ANALCO, 2014)

On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. - Marvin Künnemann; Bodo Manthey (CTW, 2015)

Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. - Karl Bringmann; Marvin Künnemann (FOCS, 2015)

Secretary Markets with Local Information. - Ning Chen 005; Martin Hoefer 001; Marvin Künnemann; Chengyu Lin 001; Peihan Miao 001 (ICALP (2), 2015)

Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic. - Marvin Künnemann; Bodo Manthey (ICALP (1), 2015)

Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds. - Karl Bringmann; Marvin Künnemann (ISAAC, 2015)

Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. - Benjamin Doerr; Marvin Künnemann (Theor. Comput. Sci., 2015)

Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. - Benjamin Doerr; Marvin Künnemann (ICALP, 2016)

Tight(er) bounds for similarity measures, smoothed approximation and broadcasting. - Marvin Künnemann (2016)

Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. - Amir Abboud; Arturs Backurs; Karl Bringmann; Marvin Künnemann (FOCS, 2017)

On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. - Marvin Künnemann; Ramamohan Paturi; Stefan Schneider 003 (ICALP, 2017)

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. - Lech Duraj; Marvin Künnemann; Adam Polak 001 (IPEC, 2017)

On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. - Marvin Künnemann (ESA, 2018)

Multivariate Fine-Grained Complexity of Longest Common Subsequence. - Karl Bringmann; Marvin Künnemann (SODA, 2018)

A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. - Karl Bringmann; Nick Fischer; Marvin Künnemann (CCC, 2019)

Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. - Karl Bringmann; Marvin Künnemann; André Nusser (SoCG, 2019)

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. - Karl Bringmann; Marvin Künnemann; André Nusser (SODA, 2019)

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. - Karl Bringmann; Marvin Künnemann; Philip Wellnitz (SODA, 2019)

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. - Karl Bringmann; Marvin Künnemann; Karol Wegrzycki (STOC, 2019)

Subquadratic Algorithms for Succinct Stable Matching. - Marvin Künnemann; Daniel Moeller; Ramamohan Paturi; Stefan Schneider 003 (Algorithmica, 2019)

Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. - Marvin Künnemann; Dániel Marx (CCC, 2020)

When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. - Karl Bringmann; Marvin Künnemann; André Nusser (ESA, 2020)

Impossibility Results for Grammar-Compressed Linear Algebra. - Amir Abboud; Arturs Backurs; Karl Bringmann; Marvin Künnemann (NeurIPS, 2020)

Fine-Grained Completeness for Optimization in P. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Marvin Künnemann (APPROX-RANDOM, 2021)

The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. - Haozhe An; Mohit Gurumukhani; Russell Impagliazzo; Michael Jaber; Marvin Künnemann; Maria Paula Parga Nina (IPEC, 2021)

Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm. - Karl Bringmann; Marvin Künnemann; André Nusser (ACM Trans. Algorithms, 2021)

Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; Dániel Marx; André Nusser (SoCG, 2022)

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. - Karl Bringmann; Sándor Kisfaludi-Bak; Marvin Künnemann; André Nusser; Zahra Parsaeian (SoCG, 2022)

A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D. - Marvin Künnemann (FOCS, 2022)

A Structural Investigation of the Approximability of Polynomial-Time Problems. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Marvin Künnemann (ICALP, 2022)

Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. - Marvin Künnemann; André Nusser (SODA, 2022)

Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4. - Egor Gorbachev; Marvin Künnemann (SoCG, 2023)

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. - Marvin Künnemann; Filip Mazowiecki; Lia Schütze; Henry Sinclair-Banks; Karol Wegrzycki (ICALP, 2023)

The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. - Nick Fischer; Marvin Künnemann; Mirza Redzic (CoRR, 2023)

Exploring the Approximability Landscape of 3SUM. - Karl Bringmann; Ahmed Ghazy; Marvin Künnemann (ESA, 2024)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. - Karl Bringmann; Allan Grønlund; Marvin Künnemann; Kasper Green Larsen (ITCS, 2024)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. - Marvin Künnemann; Mirza Redzic (IPEC, 2024)

The Time Complexity of Fully Sparse Matrix Multiplication. - Amir Abboud; Karl Bringmann; Nick Fischer; Marvin Künnemann (SODA, 2024)

The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. - Nick Fischer; Marvin Künnemann; Mirza Redzic (SODA, 2024)

On Extremal Properties of k-CNF: Capturing Threshold Functions. - Mohit Gurumukhani; Marvin Künnemann; Ramamohan Paturi (CoRR, 2024)

Fine-Grained Classification of Detecting Dominating Patterns. - Jonathan Dransfeld; Marvin Künnemann; Mirza Redzic (ESA, 2025)

(Multivariate) k-SUM as Barrier to Succinct Computation. - Geri Gokaj; Marvin Künnemann; Sabine Storandt; Carina Truschel (ESA, 2025)

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. - Nick Fischer; Marvin Künnemann; Mirza Redzic; Julian Stieß (ICALP, 2025)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer Arithmetic. - Geri Gokaj; Marvin Künnemann (ITCS, 2025)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic. - Geri Gokaj; Marvin Künnemann (CoRR, 2025)

Engineering Dominating Patterns: A Fine-grained Case Study. - Jonathan Dransfeld; Marvin Künnemann; Mirza Redzic; Marcus Wunderlich (CoRR, 2025)

Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality. - Marvin Künnemann; Filip Mazowiecki; Lia Schütze; Henry Sinclair-Banks; Karol Wegrzycki (J. ACM, 2025)

Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise. - Marvin Künnemann; Bodo Manthey; Rianne Veenstra (Algorithmica, 2025)