Marvin Künnemann

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 65

Top Venues

Saarland University, Germany (PHD)

Education History

Saarland University, Germany

PHD

Publications

Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. ITCS (2024)
Nick Fischer, Marvin Künnemann, Mirza Redzic
-Dominating Set and Related First-Order Graph Properties. SODA (2024)
Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
The Time Complexity of Fully Sparse Matrix Multiplication. SODA (2024)
Marvin Künnemann, Bodo Manthey, Rianne Veenstra
Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise. CoRR (2023)
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP (2023)
Nick Fischer, Marvin Künnemann, Mirza Redzic
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. CoRR (2023)
Egor Gorbachev, Marvin Künnemann
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4. SoCG (2023)
Egor Gorbachev, Marvin Künnemann
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d≥4. CoRR (2023)
Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
The Time Complexity of Fully Sparse Matrix Multiplication. CoRR (2023)
Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. CoRR (2023)
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. CoRR (2023)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. SoCG (2022)
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
A Structural Investigation of the Approximability of Polynomial-Time Problems. CoRR (2022)
Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. Algorithmica 84 (11) (2022)
Marvin Künnemann, André Nusser
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. SODA (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. SoCG (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, Zahra Parsaeian
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. CoRR (2022)
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, Dániel Marx, André Nusser
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves. CoRR (2022)
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
A Structural Investigation of the Approximability of Polynomial-Time Problems. ICALP (2022)
Marvin Künnemann
A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D. FOCS (2022)
Karl Bringmann, Marvin Künnemann, André Nusser
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm. ACM Trans. Algorithms 17 (3) (2021)
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Fine-Grained Completeness for Optimization in P. APPROX-RANDOM (2021)
Marvin Künnemann, André Nusser
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. CoRR (2021)
Karl Bringmann, Marvin Künnemann, André Nusser
Walking the dog fast in practice: Algorithm engineering of the Fréchet distance. J. Comput. Geom. 12 (1) (2021)
Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, Maria Paula Parga Nina
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. IPEC (2021)
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
Fine-Grained Completeness for Optimization in P. CoRR (2021)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Impossibility Results for Grammar-Compressed Linear Algebra. NeurIPS (2020)
Marvin Künnemann, Dániel Marx
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction. Computational Complexity Conference (2020)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Impossibility Results for Grammar-Compressed Linear Algebra. CoRR (2020)
Benjamin Doerr, Marvin Künnemann
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. IEEE Trans. Inf. Theory 66 (9) (2020)
Karl Bringmann, Marvin Künnemann, André Nusser
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. ESA (2020)
Marvin Künnemann, Dániel Marx
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction. CoRR (2020)
Karl Bringmann, Marvin Künnemann, André Nusser
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation. CoRR (2020)
Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. STOC (2019)
Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider
Subquadratic Algorithms for Succinct Stable Matching. Algorithmica 81 (7) (2019)
Karl Bringmann, Nick Fischer, Marvin Künnemann
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. Computational Complexity Conference (2019)
Karl Bringmann, Marvin Künnemann, André Nusser
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. CoRR (2019)
Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao
Secretary markets with local information. Distributed Comput. 32 (5) (2019)
Karl Bringmann, Philip Wellnitz, Marvin Künnemann
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. SODA (2019)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica 81 (10) (2019)
Karl Bringmann, Marvin Künnemann, André Nusser
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. SoCG (2019)
Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. CoRR (2019)
Karl Bringmann, Marvin Künnemann, André Nusser
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. SODA (2019)
Marvin Künnemann
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. ESA (2018)
Karl Bringmann, Marvin Künnemann
Multivariate Fine-Grained Complexity of Longest Common Subsequence. CoRR (2018)
Marvin Künnemann
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress. CoRR (2018)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. CoRR (2018)
Karl Bringmann, Marvin Künnemann, André Nusser
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. CoRR (2018)
Karl Bringmann, Marvin Künnemann
Multivariate Fine-Grained Complexity of Longest Common Subsequence. SODA (2018)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. CoRR (2017)
Karl Bringmann, Marvin Künnemann
Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds. Int. J. Comput. Geom. Appl. 27 (1-2) (2017)
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. ICALP (2017)
Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. FOCS (2017)
Lech Duraj, Marvin Künnemann, Adam Polak
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. IPEC (2017)
Marvin Künnemann, Ramamohan Paturi, Stefan Schneider
On the Fine-grained Complexity of One-Dimensional Dynamic Programming. CoRR (2017)
Benjamin Doerr, Marvin Künnemann
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. CoRR (2016)
Benjamin Doerr, Marvin Künnemann
Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. ICALP (2016)
Karl Bringmann, Marvin Künnemann
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. CoRR (2015)
Benjamin Doerr, Marvin Künnemann
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances. Theor. Comput. Sci. 561 (2015)
Marvin Künnemann, Bodo Manthey
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic. ICALP (1) (2015)
Karl Bringmann, Marvin Künnemann
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds. ISAAC (2015)
Radu Curticapean, Marvin Künnemann
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. Algorithmica 73 (3) (2015)
Marvin Künnemann, Bodo Manthey
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. CTW (2015)
Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao
Secretary Markets with Local Information. ICALP (2) (2015)
Karl Bringmann, Marvin Künnemann
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. FOCS (2015)
Benjamin Doerr, Marvin Künnemann
Tight Analysis of Randomized Rumor Spreading in Complete Graphs. ANALCO (2014)
Karl Bringmann, Marvin Künnemann
Improved approximation for Fréchet distance on c-packed curves matching conditional lower bounds. CoRR (2014)
Radu Curticapean, Marvin Künnemann
A quantization framework for smoothed analysis on Euclidean optimization problems. CTW (2013)
Radu Curticapean, Marvin Künnemann
A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems. ESA (2013)
Benjamin Doerr, Marvin Künnemann
Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations. IEEE Congress on Evolutionary Computation (2013)
Benjamin Doerr, Marvin Künnemann
How the (1+λ) evolutionary algorithm optimizes linear functions. GECCO (2013)
Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
Dependent Randomized Rounding: The Bipartite Case. ALENEX (2011)
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics 16 (2011)
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
Quasirandom Rumor Spreading: An Experimental Analysis CoRR (2010)
Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA (2010)
Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements CoRR (2010)
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX (2009)

Marvin Künnemann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marvin Künnemann