Marvin Künnemann
Orcid: 0000-0003-4813-4852Affiliations:
- TU Kaiserslautern, Germany
- Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany (former)
- Saarland University, Saarbrücken, Germany (former)
According to our database1,
Marvin Künnemann
authored at least 44 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
The Effect of Sparsity on <i>k</i>-Dominating Set and Related First-Order Graph Properties.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
CoRR, 2023
CoRR, 2023
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d ≥ 4.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
Algorithmica, 2022
Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3D.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm.
ACM Trans. Algorithms, 2021
J. Comput. Geom., 2021
Proceedings of the Approximation, 2021
2020
IEEE Trans. Inf. Theory, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction.
Proceedings of the 35th Computational Complexity Conference, 2020
2019
Algorithmica, 2019
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties.
Proceedings of the 34th Computational Complexity Conference, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds.
Int. J. Comput. Geom. Appl., 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
PhD thesis, 2016
2015
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances.
Theor. Comput. Sci., 2015
Algorithmica, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014
2013
Proceedings of the Genetic and Evolutionary Computation Conference, 2013
Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013
2011
ACM J. Exp. Algorithmics, 2011
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011
2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010