default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Marvin Künnemann
@inproceedings{DBLP:conf/esa/BringmannGK24,
author = {Karl Bringmann and
Ahmed Ghazy and
Marvin K{\"{u}}nnemann},
editor = {Timothy Chan and
Johannes Fischer and
John Iacono and
Grzegorz Herman},
title = {Exploring the Approximability Landscape of 3SUM},
booktitle = {32nd Annual European Symposium on Algorithms, {ESA} 2024, September
2-4, 2024, Royal Holloway, London, United Kingdom},
series = {LIPIcs},
volume = {308},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ESA.2024.34},
doi = {10.4230/LIPICS.ESA.2024.34},
timestamp = {Tue, 24 Sep 2024 17:19:50 +0200},
biburl = {https://dblp.org/rec/conf/esa/BringmannGK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BringmannGKL24,
author = {Karl Bringmann and
Allan Gr{\o}nlund and
Marvin K{\"{u}}nnemann and
Kasper Green Larsen},
editor = {Venkatesan Guruswami},
title = {The {NFA} Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower
Bounds},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {22:1--22:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.22},
doi = {10.4230/LIPICS.ITCS.2024.22},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BringmannGKL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudBFK24,
author = {Amir Abboud and
Karl Bringmann and
Nick Fischer and
Marvin K{\"{u}}nnemann},
editor = {David P. Woodruff},
title = {The Time Complexity of Fully Sparse Matrix Multiplication},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4670--4703},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.167},
doi = {10.1137/1.9781611977912.167},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudBFK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FischerKR24,
author = {Nick Fischer and
Marvin K{\"{u}}nnemann and
Mirza Redzic},
editor = {David P. Woodruff},
title = {The Effect of Sparsity on \emph{k}-Dominating Set and Related First-Order
Graph Properties},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4704--4727},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.168},
doi = {10.1137/1.9781611977912.168},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FischerKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GorbachevK23,
author = {Egor Gorbachev and
Marvin K{\"{u}}nnemann},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's
Measure Problem and Related Problems in Dimensions d {\(\geq\)} 4},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {36:1--36:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.36},
doi = {10.4230/LIPICS.SOCG.2023.36},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GorbachevK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KunnemannMSSW23,
author = {Marvin K{\"{u}}nnemann and
Filip Mazowiecki and
Lia Sch{\"{u}}tze and
Henry Sinclair{-}Banks and
Karol Wegrzycki},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Coverability in {VASS} Revisited: Improving Rackoff's Bound to Obtain
Conditional Optimality},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {131:1--131:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.131},
doi = {10.4230/LIPICS.ICALP.2023.131},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KunnemannMSSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-08612,
author = {Egor Gorbachev and
Marvin K{\"{u}}nnemann},
title = {Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's
Measure Problem and Related Problems in Dimensions d{\(\geq\)}4},
journal = {CoRR},
volume = {abs/2303.08612},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.08612},
doi = {10.48550/ARXIV.2303.08612},
eprinttype = {arXiv},
eprint = {2303.08612},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-08612.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01581,
author = {Marvin K{\"{u}}nnemann and
Filip Mazowiecki and
Lia Sch{\"{u}}tze and
Henry Sinclair{-}Banks and
Karol Wegrzycki},
title = {Coverability in {VASS} Revisited: Improving Rackoff's Bound to Obtain
Conditional Optimality},
journal = {CoRR},
volume = {abs/2305.01581},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01581},
doi = {10.48550/ARXIV.2305.01581},
eprinttype = {arXiv},
eprint = {2305.01581},
timestamp = {Fri, 05 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-00306,
author = {Marvin K{\"{u}}nnemann and
Bodo Manthey and
Rianne Veenstra},
title = {Smoothed Analysis of the 2-Opt Heuristic for the {TSP} under Gaussian
Noise},
journal = {CoRR},
volume = {abs/2308.00306},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.00306},
doi = {10.48550/ARXIV.2308.00306},
eprinttype = {arXiv},
eprint = {2308.00306},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-00306.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-06317,
author = {Amir Abboud and
Karl Bringmann and
Nick Fischer and
Marvin K{\"{u}}nnemann},
title = {The Time Complexity of Fully Sparse Matrix Multiplication},
journal = {CoRR},
volume = {abs/2309.06317},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.06317},
doi = {10.48550/ARXIV.2309.06317},
eprinttype = {arXiv},
eprint = {2309.06317},
timestamp = {Tue, 19 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-06317.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-10204,
author = {Karl Bringmann and
Allan Gr{\o}nlund and
Marvin K{\"{u}}nnemann and
Kasper Green Larsen},
title = {The {NFA} Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower
Bounds},
journal = {CoRR},
volume = {abs/2311.10204},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.10204},
doi = {10.48550/ARXIV.2311.10204},
eprinttype = {arXiv},
eprint = {2311.10204},
timestamp = {Wed, 22 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-10204.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-14593,
author = {Nick Fischer and
Marvin K{\"{u}}nnemann and
Mirza Redzic},
title = {The Effect of Sparsity on k-Dominating Set and Related First-Order
Graph Properties},
journal = {CoRR},
volume = {abs/2312.14593},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.14593},
doi = {10.48550/ARXIV.2312.14593},
eprinttype = {arXiv},
eprint = {2312.14593},
timestamp = {Thu, 18 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-14593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnGIJKN22,
author = {Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin K{\"{u}}nnemann and
Maria Paula Parga Nina},
title = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties},
journal = {Algorithmica},
volume = {84},
number = {11},
pages = {3156--3191},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01014-x},
doi = {10.1007/S00453-022-01014-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnGIJKN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannKKMN22,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx and
Andr{\'{e}} Nusser},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling
Curves},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.20},
doi = {10.4230/LIPICS.SOCG.2022.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannKKMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannKKNP22,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser and
Zahra Parsaeian},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Towards Sub-Quadratic Diameter Computation in Geometric Intersection
Graphs},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {21:1--21:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.21},
doi = {10.4230/LIPICS.SOCG.2022.21},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannKKNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kunnemann22,
author = {Marvin K{\"{u}}nnemann},
title = {A tight (non-combinatorial) conditional lower bound for Klee's Measure
Problem in 3D},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {555--566},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00059},
doi = {10.1109/FOCS54457.2022.00059},
timestamp = {Sat, 31 Dec 2022 17:14:50 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kunnemann22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannCFK22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Marvin K{\"{u}}nnemann},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {A Structural Investigation of the Approximability of Polynomial-Time
Problems},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {30:1--30:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.30},
doi = {10.4230/LIPICS.ICALP.2022.30},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannCFK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KunnemannN22,
author = {Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness
and an Improvement via Offline Dynamic Rectangle Union},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3181--3201},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.124},
doi = {10.1137/1.9781611977073.124},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/KunnemannN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-03663,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser and
Zahra Parsaeian},
title = {Towards Sub-Quadratic Diameter Computation in Geometric Intersection
Graphs},
journal = {CoRR},
volume = {abs/2203.03663},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.03663},
doi = {10.48550/ARXIV.2203.03663},
eprinttype = {arXiv},
eprint = {2203.03663},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-03663.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07898,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx and
Andr{\'{e}} Nusser},
title = {Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling
Curves},
journal = {CoRR},
volume = {abs/2203.07898},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.07898},
doi = {10.48550/ARXIV.2203.07898},
eprinttype = {arXiv},
eprint = {2203.07898},
timestamp = {Mon, 28 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-07898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11681,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Marvin K{\"{u}}nnemann},
title = {A Structural Investigation of the Approximability of Polynomial-Time
Problems},
journal = {CoRR},
volume = {abs/2204.11681},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11681},
doi = {10.48550/ARXIV.2204.11681},
eprinttype = {arXiv},
eprint = {2204.11681},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11681.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BringmannKN21,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {Walking the dog fast in practice: Algorithm engineering of the Fr{\'{e}}chet
distance},
journal = {J. Comput. Geom.},
volume = {12},
number = {1},
pages = {70--108},
year = {2021},
url = {https://doi.org/10.20382/jocg.v12i1a4},
doi = {10.20382/JOCG.V12I1A4},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BringmannKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannKN21,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {Discrete Fr{\'{e}}chet Distance under Translation: Conditional
Hardness and an Improved Algorithm},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {3},
pages = {25:1--25:42},
year = {2021},
url = {https://doi.org/10.1145/3460656},
doi = {10.1145/3460656},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BringmannKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BringmannCFK21,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Marvin K{\"{u}}nnemann},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Fine-Grained Completeness for Optimization in {P}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {9:1--9:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.9},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BringmannCFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/AnGIJKN21,
author = {Haozhe An and
Mohit Gurumukhani and
Russell Impagliazzo and
Michael Jaber and
Marvin K{\"{u}}nnemann and
Maria Paula Parga Nina},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {The Fine-Grained Complexity of Multi-Dimensional Ordering Properties},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.3},
doi = {10.4230/LIPICS.IPEC.2021.3},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/AnGIJKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-01721,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Marvin K{\"{u}}nnemann},
title = {Fine-Grained Completeness for Optimization in {P}},
journal = {CoRR},
volume = {abs/2107.01721},
year = {2021},
url = {https://arxiv.org/abs/2107.01721},
eprinttype = {arXiv},
eprint = {2107.01721},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-01721.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-02544,
author = {Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness
and an Improvement via Offline Dynamic Rectangle Union},
journal = {CoRR},
volume = {abs/2111.02544},
year = {2021},
url = {https://arxiv.org/abs/2111.02544},
eprinttype = {arXiv},
eprint = {2111.02544},
timestamp = {Fri, 05 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-02544.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DoerrK20,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
title = {Improved Protocols and Hardness Results for the Two-Player Cryptogenography
Problem},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {9},
pages = {5729--5741},
year = {2020},
url = {https://doi.org/10.1109/TIT.2020.2978385},
doi = {10.1109/TIT.2020.2978385},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/DoerrK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KunnemannM20,
author = {Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx},
editor = {Shubhangi Saraf},
title = {Finding Small Satisfying Assignments Faster Than Brute Force: {A}
Fine-Grained Perspective into Boolean Constraint Satisfaction},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {27:1--27:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.27},
doi = {10.4230/LIPICS.CCC.2020.27},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/KunnemannM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BringmannKN20,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete
Fr{\'{e}}chet Distance Under Translation},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.25},
doi = {10.4230/LIPICS.ESA.2020.25},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BringmannKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AbboudBBK20,
author = {Amir Abboud and
Arturs Backurs and
Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Impossibility Results for Grammar-Compressed Linear Algebra},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/645e6bfdd05d1a69c5e47b20f0a91d46-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AbboudBBK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-11541,
author = {Marvin K{\"{u}}nnemann and
D{\'{a}}niel Marx},
title = {Finding Small Satisfying Assignments Faster Than Brute Force: {A}
Fine-grained Perspective into Boolean Constraint Satisfaction},
journal = {CoRR},
volume = {abs/2005.11541},
year = {2020},
url = {https://arxiv.org/abs/2005.11541},
eprinttype = {arXiv},
eprint = {2005.11541},
timestamp = {Thu, 28 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-11541.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07510,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete
Fr{\'{e}}chet Distance under Translation},
journal = {CoRR},
volume = {abs/2008.07510},
year = {2020},
url = {https://arxiv.org/abs/2008.07510},
eprinttype = {arXiv},
eprint = {2008.07510},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07510.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-14181,
author = {Amir Abboud and
Arturs Backurs and
Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Impossibility Results for Grammar-Compressed Linear Algebra},
journal = {CoRR},
volume = {abs/2010.14181},
year = {2020},
url = {https://arxiv.org/abs/2010.14181},
eprinttype = {arXiv},
eprint = {2010.14181},
timestamp = {Mon, 02 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-14181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KunnemannMPS19,
author = {Marvin K{\"{u}}nnemann and
Daniel Moeller and
Ramamohan Paturi and
Stefan Schneider},
title = {Subquadratic Algorithms for Succinct Stable Matching},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2991--3024},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00564-x},
doi = {10.1007/S00453-019-00564-X},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KunnemannMPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurajKP19,
author = {Lech Duraj and
Marvin K{\"{u}}nnemann and
Adam Polak},
title = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {3968--3992},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0485-7},
doi = {10.1007/S00453-018-0485-7},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DurajKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ChenHKLM19,
author = {Ning Chen and
Martin Hoefer and
Marvin K{\"{u}}nnemann and
Chengyu Lin and
Peihan Miao},
title = {Secretary markets with local information},
journal = {Distributed Comput.},
volume = {32},
number = {5},
pages = {361--378},
year = {2019},
url = {https://doi.org/10.1007/s00446-018-0327-5},
doi = {10.1007/S00446-018-0327-5},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/ChenHKLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BringmannFK19,
author = {Karl Bringmann and
Nick Fischer and
Marvin K{\"{u}}nnemann},
editor = {Amir Shpilka},
title = {A Fine-Grained Analogue of Schaefer's Theorem in {P:} Dichotomy of
Exists{\^{}}k-Forall-Quantified First-Order Graph Properties},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {31:1--31:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.31},
doi = {10.4230/LIPICS.CCC.2019.31},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BringmannFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannKN19,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
editor = {Gill Barequet and
Yusu Wang},
title = {Walking the Dog Fast in Practice: Algorithm Engineering of the Fr{\'{e}}chet
Distance},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {17:1--17:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.17},
doi = {10.4230/LIPICS.SOCG.2019.17},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannWK19,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Philip Wellnitz},
editor = {Timothy M. Chan},
title = {Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches
in Compressed Texts},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1126--1145},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.69},
doi = {10.1137/1.9781611975482.69},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannWK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannKN19,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
editor = {Timothy M. Chan},
title = {Fr{\'{e}}chet Distance Under Translation: Conditional Hardness
and an Algorithm via Offline Dynamic Grid Reachability},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2902--2921},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.180},
doi = {10.1137/1.9781611975482.180},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannKW19,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Karol Wegrzycki},
editor = {Moses Charikar and
Edith Cohen},
title = {Approximating {APSP} without scaling: equivalence of approximate min-plus
and exact min-max},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {943--954},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316373},
doi = {10.1145/3313276.3316373},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-01504,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {Walking the Dog Fast in Practice: Algorithm Engineering of the Fr{\'{e}}chet
Distance},
journal = {CoRR},
volume = {abs/1901.01504},
year = {2019},
url = {http://arxiv.org/abs/1901.01504},
eprinttype = {arXiv},
eprint = {1901.01504},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-01504.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-11078,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Karol Wegrzycki},
title = {Approximating {APSP} without Scaling: Equivalence of Approximate Min-Plus
and Exact Min-Max},
journal = {CoRR},
volume = {abs/1907.11078},
year = {2019},
url = {http://arxiv.org/abs/1907.11078},
eprinttype = {arXiv},
eprint = {1907.11078},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-11078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kunnemann18,
author = {Marvin K{\"{u}}nnemann},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences,
Avenues and Algorithmic Progress},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {56:1--56:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.56},
doi = {10.4230/LIPICS.ESA.2018.56},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/Kunnemann18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannK18,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Artur Czumaj},
title = {Multivariate Fine-Grained Complexity of Longest Common Subsequence},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1216--1235},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.79},
doi = {10.1137/1.9781611975031.79},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00796,
author = {Amir Abboud and
Arturs Backurs and
Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Fine-Grained Complexity of Analyzing Compressed Data: Quantifying
Improvements over Decompress-And-Solve},
journal = {CoRR},
volume = {abs/1803.00796},
year = {2018},
url = {http://arxiv.org/abs/1803.00796},
eprinttype = {arXiv},
eprint = {1803.00796},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00796.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00938,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Multivariate Fine-Grained Complexity of Longest Common Subsequence},
journal = {CoRR},
volume = {abs/1803.00938},
year = {2018},
url = {http://arxiv.org/abs/1803.00938},
eprinttype = {arXiv},
eprint = {1803.00938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09189,
author = {Marvin K{\"{u}}nnemann},
title = {On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences,
Avenues and Algorithmic Progress},
journal = {CoRR},
volume = {abs/1806.09189},
year = {2018},
url = {http://arxiv.org/abs/1806.09189},
eprinttype = {arXiv},
eprint = {1806.09189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09189.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10982,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Andr{\'{e}} Nusser},
title = {Fr{\'{e}}chet Distance Under Translation: Conditional Hardness
and an Algorithm via Offline Dynamic Grid Reachability},
journal = {CoRR},
volume = {abs/1810.10982},
year = {2018},
url = {http://arxiv.org/abs/1810.10982},
eprinttype = {arXiv},
eprint = {1810.10982},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10982.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BringmannK17,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Improved Approximation for Fr{\'{e}}chet Distance on c-Packed
Curves Matching Conditional Lower Bounds},
journal = {Int. J. Comput. Geom. Appl.},
volume = {27},
number = {1-2},
pages = {85--120},
year = {2017},
url = {https://doi.org/10.1142/S0218195917600056},
doi = {10.1142/S0218195917600056},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BringmannK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudBBK17,
author = {Amir Abboud and
Arturs Backurs and
Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Chris Umans},
title = {Fine-Grained Complexity of Analyzing Compressed Data: Quantifying
Improvements over Decompress-and-Solve},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {192--203},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.26},
doi = {10.1109/FOCS.2017.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudBBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KunnemannPS17,
author = {Marvin K{\"{u}}nnemann and
Ramamohan Paturi and
Stefan Schneider},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {On the Fine-Grained Complexity of One-Dimensional Dynamic Programming},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.21},
doi = {10.4230/LIPICS.ICALP.2017.21},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KunnemannPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DurajKP17,
author = {Lech Duraj and
Marvin K{\"{u}}nnemann and
Adam Polak},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {15:1--15:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.15},
doi = {10.4230/LIPICS.IPEC.2017.15},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/DurajKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KunnemannPS17,
author = {Marvin K{\"{u}}nnemann and
Ramamohan Paturi and
Stefan Schneider},
title = {On the Fine-grained Complexity of One-Dimensional Dynamic Programming},
journal = {CoRR},
volume = {abs/1703.00941},
year = {2017},
url = {http://arxiv.org/abs/1703.00941},
eprinttype = {arXiv},
eprint = {1703.00941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KunnemannPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-10075,
author = {Lech Duraj and
Marvin K{\"{u}}nnemann and
Adam Polak},
title = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence},
journal = {CoRR},
volume = {abs/1709.10075},
year = {2017},
url = {http://arxiv.org/abs/1709.10075},
eprinttype = {arXiv},
eprint = {1709.10075},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-10075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Kunnemann16,
author = {Marvin K{\"{u}}nnemann},
title = {Tight(er) bounds for similarity measures, smoothed approximation and
broadcasting},
school = {Saarland University, Germany},
year = {2016},
url = {https://doi.org/10.22028/D291-25431},
doi = {10.22028/D291-25431},
urn = {urn:nbn:de:bsz:291-scidok-65991},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Kunnemann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DoerrK16,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Improved Protocols and Hardness Results for the Two-Player Cryptogenography
Problem},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {150:1--150:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.150},
doi = {10.4230/LIPICS.ICALP.2016.150},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DoerrK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DoerrK16,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
title = {Improved Protocols and Hardness Results for the Two-Player Cryptogenography
Problem},
journal = {CoRR},
volume = {abs/1603.06113},
year = {2016},
url = {http://arxiv.org/abs/1603.06113},
eprinttype = {arXiv},
eprint = {1603.06113},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DoerrK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CurticapeanK15,
author = {Radu Curticapean and
Marvin K{\"{u}}nnemann},
title = {A Quantization Framework for Smoothed Analysis of Euclidean Optimization
Problems},
journal = {Algorithmica},
volume = {73},
number = {3},
pages = {483--510},
year = {2015},
url = {https://doi.org/10.1007/s00453-015-0043-5},
doi = {10.1007/S00453-015-0043-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CurticapeanK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DoerrK15,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
title = {Optimizing linear functions with the (1+{\(\lambda\)}) evolutionary
algorithm - Different asymptotic runtimes for different instances},
journal = {Theor. Comput. Sci.},
volume = {561},
pages = {3--23},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.03.015},
doi = {10.1016/J.TCS.2014.03.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DoerrK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannK15,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Venkatesan Guruswami},
title = {Quadratic Conditional Lower Bounds for String Problems and Dynamic
Time Warping},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {79--97},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.15},
doi = {10.1109/FOCS.2015.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenHKLM15,
author = {Ning Chen and
Martin Hoefer and
Marvin K{\"{u}}nnemann and
Chengyu Lin and
Peihan Miao},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Secretary Markets with Local Information},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {552--563},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_44},
doi = {10.1007/978-3-662-47666-6\_44},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenHKLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KunnemannM15,
author = {Marvin K{\"{u}}nnemann and
Bodo Manthey},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Towards Understanding the Smoothed Approximation Ratio of the 2-Opt
Heuristic},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {859--871},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_70},
doi = {10.1007/978-3-662-47672-7\_70},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KunnemannM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BringmannK15,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Improved Approximation for Fr{\'{e}}chet Distance on c-packed
Curves Matching Conditional Lower Bounds},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {517--528},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_44},
doi = {10.1007/978-3-662-48971-0\_44},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BringmannK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/KunnemannM15,
author = {Marvin K{\"{u}}nnemann and
Bodo Manthey},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the
{TSP}},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {1--4},
year = {2015},
timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/KunnemannM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannK15,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Quadratic Conditional Lower Bounds for String Problems and Dynamic
Time Warping},
journal = {CoRR},
volume = {abs/1502.01063},
year = {2015},
url = {http://arxiv.org/abs/1502.01063},
eprinttype = {arXiv},
eprint = {1502.01063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DoerrK14,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Tight Analysis of Randomized Rumor Spreading in Complete Graphs},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {82--91},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.8},
doi = {10.1137/1.9781611973204.8},
timestamp = {Tue, 23 May 2017 01:10:30 +0200},
biburl = {https://dblp.org/rec/conf/analco/DoerrK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannK14,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
title = {Improved approximation for Fr{\'{e}}chet distance on c-packed
curves matching conditional lower bounds},
journal = {CoRR},
volume = {abs/1408.1340},
year = {2014},
url = {http://arxiv.org/abs/1408.1340},
eprinttype = {arXiv},
eprint = {1408.1340},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/DoerrK13,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
title = {Royal road functions and the {(1} + {\(\lambda\)}) evolutionary algorithm:
Almost no speed-up from larger offspring populations},
booktitle = {Proceedings of the {IEEE} Congress on Evolutionary Computation, {CEC}
2013, Cancun, Mexico, June 20-23, 2013},
pages = {424--431},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/CEC.2013.6557600},
doi = {10.1109/CEC.2013.6557600},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/cec/DoerrK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CurticapeanK13,
author = {Radu Curticapean and
Marvin K{\"{u}}nnemann},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {A Quantization Framework for Smoothed Analysis of Euclidean Optimization
Problems},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {349--360},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_30},
doi = {10.1007/978-3-642-40450-4\_30},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/CurticapeanK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/DoerrK13,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
editor = {Christian Blum and
Enrique Alba},
title = {How the (1+{\(\lambda\)}) evolutionary algorithm optimizes linear
functions},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} '13, Amsterdam,
The Netherlands, July 6-10, 2013},
pages = {1589--1596},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2463372.2463569},
doi = {10.1145/2463372.2463569},
timestamp = {Wed, 13 Jul 2022 16:15:15 +0200},
biburl = {https://dblp.org/rec/conf/gecco/DoerrK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CurticapeanK13,
author = {Radu Curticapean and
Marvin K{\"{u}}nnemann},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {A quantization framework for smoothed analysis on Euclidean optimization
problems},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {71--74},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CurticapeanK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DoerrFKS11,
author = {Benjamin Doerr and
Tobias Friedrich and
Marvin K{\"{u}}nnemann and
Thomas Sauerwald},
title = {Quasirandom rumor spreading: An experimental analysis},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025379},
doi = {10.1145/1963190.2025379},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DoerrFKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DoerrKW11,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann and
Magnus Wahlstr{\"{o}}m},
editor = {Matthias M{\"{u}}ller{-}Hannemann and
Renato Fonseca F. Werneck},
title = {Dependent Randomized Rounding: The Bipartite Case},
booktitle = {Proceedings of the Thirteenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2011, Holiday Inn San Francisco Golden Gateway,
San Francisco, California, USA, January 22, 2011},
pages = {96--106},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611972917.10},
doi = {10.1137/1.9781611972917.10},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/DoerrKW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/DoerrKW10,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann and
Magnus Wahlstr{\"{o}}m},
editor = {Paola Festa},
title = {Randomized Rounding for Routing and Covering Problems: Experiments
and Improvements},
booktitle = {Experimental Algorithms, 9th International Symposium, {SEA} 2010,
Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6049},
pages = {190--201},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13193-6\_17},
doi = {10.1007/978-3-642-13193-6\_17},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/DoerrKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0372,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann and
Magnus Wahlstr{\"{o}}m},
title = {Randomized Rounding for Routing and Covering Problems: Experiments
and Improvements},
journal = {CoRR},
volume = {abs/1007.0372},
year = {2010},
url = {http://arxiv.org/abs/1007.0372},
eprinttype = {arXiv},
eprint = {1007.0372},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0372.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-5357,
author = {Benjamin Doerr and
Tobias Friedrich and
Marvin K{\"{u}}nnemann and
Thomas Sauerwald},
title = {Quasirandom Rumor Spreading: An Experimental Analysis},
journal = {CoRR},
volume = {abs/1012.5357},
year = {2010},
url = {http://arxiv.org/abs/1012.5357},
eprinttype = {arXiv},
eprint = {1012.5357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-5357.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DoerrFKS09,
author = {Benjamin Doerr and
Tobias Friedrich and
Marvin K{\"{u}}nnemann and
Thomas Sauerwald},
editor = {Irene Finocchi and
John Hershberger},
title = {Quasirandom Rumor Spreading: An Experimental Analysis},
booktitle = {Proceedings of the Eleventh Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2009, New York, New York, USA, January 3, 2009},
pages = {145--153},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972894.14},
doi = {10.1137/1.9781611972894.14},
timestamp = {Wed, 03 Jan 2018 16:51:51 +0100},
biburl = {https://dblp.org/rec/conf/alenex/DoerrFKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-26 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
