====== Marvin Künnemann-Goos ======

<WRAP group>
<WRAP column 25%>
{{:people:mk.jpg?nolink&225 |}}
</WRAP>
<WRAP column 65%>
**Head of the Algorithms & Complexity Group**\\

Karlsruhe Institute of Technology (KIT)\\
Institute of Theoretical Informatics\\
\\
|         email | <marvin.kuennemann@kit.edu>                                                                                            |
|        office | room 317, [[https://www.kit.edu/campusplan/index.php?id=50.34|Computer Science building 50.34]]  |
|  office hours | by appointment                                                                                                       |
</WRAP>
</WRAP>

== Research Interests ==

  * fine-grained complexity, hardness in P 
  * algorithm engineering
  * probabilistic analysis of algorithms, randomized methods

== Recent Academic Service ==

PC member for SODA 2027, ICALP 2025, STOC 2023, IPEC 2022, CCC 2022, ESA 2021, WG 2021, STOC 2020, IPEC 2020

== Selected Publications ==

B. Dudek, N. Fischer, G. Gokaj, C. Jin, M. Künnemann, X. Mao, and M. Redzic.\\
//Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression
Detection//.\\
In: **STOC 2026** [[https://doi.org/10.48550/arXiv.2603.28843|(arXiv)]]\\
\\

M. Künnemann, F. Mazowiecki, L. Schütze, H. Sinclair-Banks, and K. Węgrzycki.\\
//Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality//.\\
In: **J. ACM** 72.5 (2025). Preliminary version won  **ICALP 2023 Track B Best Paper Award** [[https://doi.org/10.48550/arXiv.2305.01581|(arXiv)]]\\
\\

N. Fischer, M. Künnemann, and M. Redzic.\\
//The Effect of Sparsity on k -Dominating Set and Related First-Order Graph Properties//.\\
In: **SODA 2024,** [[https://doi.org/10.48550/arXiv.2312.14593|(arXiv)]]\\
\\

A. Abboud, K. Bringmann, N. Fischer, and M. Künnemann.\\
//The Time Complexity of Fully Sparse Matrix Multiplication//.\\
In: **SODA 2024** [[https://doi.org/10.48550/arXiv.2309.06317|(arXiv)]]\\
\\

M. Künnemann\\
//A tight (non-combinatorial) conditional lower bound for Klee’s Measure Problem in 3D//.\\
In: **FOCS 2022**. [[https://ieeexplore.ieee.org/document/9996905|(conference version)]] {{ :people:focs22-kmp.pdf |(pdf)}}\\
\\
K. Bringmann and M. Künnemann.\\
//Multivariate Fine-Grained Complexity of Longest Common Subsequence//.\\
In: **SODA 2018**. [[http://arxiv.org/abs/1803.00938|(arXiv)]]\\
\\

M. Künnemann, R. Paturi, and S. Schneider.\\
//On the Fine-Grained Complexity of One-Dimensional Dynamic Programming//.\\
In: **ICALP 2017**. [[https://arxiv.org/abs/1703.00941|(arxiv)]]\\
\\

A. Abboud, A. Backurs, K. Bringmann, and M. Künnemann.\\
//Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve//.\\
In: **FOCS 2017**. [[http://arxiv.org/abs/1803.00796|(arXiv)]]\\
\\

K. Bringmann and M. Künnemann.\\
//Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping//.\\
In: **FOCS 2015**. [[http://arxiv.org/abs/1502.01063|(arxiv)]]\\
\\

For a more comprehensive list, see below.

===== Publications =====

{{section>:publist:52_735_marvinknnemann_byyear_nopreprint:&nofooter&noeditbtn}}