Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Karl Bringmann
@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, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BringmannGKL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannFHKKR24,
author = {Karl Bringmann and
Nick Fischer and
Ivor {van der Hoog} and
Evangelos Kipouridis and
Tomasz Kociumaka and
Eva Rotenberg},
editor = {David P. Woodruff},
title = {Dynamic Dynamic Time Warping},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {208--242},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.10},
doi = {10.1137/1.9781611977912.10},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannFHKKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bringmann24,
author = {Karl Bringmann},
editor = {David P. Woodruff},
title = {Approximating Subset Sum Ratio faster than Subset Sum},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1260--1277},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.50},
doi = {10.1137/1.9781611977912.50},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Bringmann24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannCFK24,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Tomasz Kociumaka},
editor = {David P. Woodruff},
title = {Faster Sublinear-Time Edit Distance},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3274--3301},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.117},
doi = {10.1137/1.9781611977912.117},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannCFK24.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 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudBFK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-04356,
author = {Karl Bringmann and
Frank Staals and
Karol Wegrzycki and
Geert van Wordragen},
title = {Fine-Grained Complexity of Earth Mover's Distance under Translation},
journal = {CoRR},
volume = {abs/2403.04356},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.04356},
doi = {10.48550/ARXIV.2403.04356},
eprinttype = {arXiv},
eprint = {2403.04356},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-04356.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannCD23,
author = {Karl Bringmann and
Vincent Cohen{-}Addad and
Debarati Das},
title = {A Linear-Time \emph{n}\({}^{\mbox{0.4}}\)-Approximation for Longest
Common Subsequence},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {1},
pages = {9:1--9:24},
year = {2023},
url = {https://doi.org/10.1145/3568398},
doi = {10.1145/3568398},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BringmannCD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BringmannC23,
author = {Karl Bringmann and
Alejandro Cassis},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {24:1--24:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.24},
doi = {10.4230/LIPICS.ESA.2023.24},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/BringmannC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannCF23,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer},
title = {Negative-Weight Single-Source Shortest Paths in Near-Linear Time:
Now Faster!},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {515--538},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00038},
doi = {10.1109/FOCS57990.2023.00038},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannCF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannKMNYZ23,
author = {Karl Bringmann and
Michael Kapralov and
Mikhail Makarov and
Vasileios Nakos and
Amir Yagudin and
Amir Zandieh},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Traversing the {FFT} Computation Tree for Dimension-Independent Sparse
Fourier Transforms},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4768--4845},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch177},
doi = {10.1137/1.9781611977554.CH177},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannKMNYZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBF23,
author = {Amir Abboud and
Karl Bringmann and
Nick Fischer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive
Combinatorics},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {391--404},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585240},
doi = {10.1145/3564246.3585240},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudBF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-05279,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer},
title = {Negative-Weight Single-Source Shortest Paths in Near-Linear Time:
Now Faster!},
journal = {CoRR},
volume = {abs/2304.05279},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.05279},
doi = {10.48550/ARXIV.2304.05279},
eprinttype = {arXiv},
eprint = {2304.05279},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-05279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01593,
author = {Karl Bringmann and
Alejandro Cassis},
title = {Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution},
journal = {CoRR},
volume = {abs/2305.01593},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01593},
doi = {10.48550/ARXIV.2305.01593},
eprinttype = {arXiv},
eprint = {2305.01593},
timestamp = {Fri, 05 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-03075,
author = {Karl Bringmann},
title = {Knapsack with Small Items in Near-Quadratic Time},
journal = {CoRR},
volume = {abs/2308.03075},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.03075},
doi = {10.48550/ARXIV.2308.03075},
eprinttype = {arXiv},
eprint = {2308.03075},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-03075.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-2310-07595,
author = {Karl Bringmann},
title = {Approximating Subset Sum Ratio faster than Subset Sum},
journal = {CoRR},
volume = {abs/2310.07595},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.07595},
doi = {10.48550/ARXIV.2310.07595},
eprinttype = {arXiv},
eprint = {2310.07595},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-07595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-18128,
author = {Karl Bringmann and
Nick Fischer and
Ivor {van der Hoog} and
Evangelos Kipouridis and
Tomasz Kociumaka and
Eva Rotenberg},
title = {Dynamic Dynamic Time Warping},
journal = {CoRR},
volume = {abs/2310.18128},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.18128},
doi = {10.48550/ARXIV.2310.18128},
eprinttype = {arXiv},
eprint = {2310.18128},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-18128.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-01759,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Tomasz Kociumaka},
title = {Faster Sublinear-Time Edit Distance},
journal = {CoRR},
volume = {abs/2312.01759},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.01759},
doi = {10.48550/ARXIV.2312.01759},
eprinttype = {arXiv},
eprint = {2312.01759},
timestamp = {Tue, 12 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-01759.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannFHSW22,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1341--1356},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00928-w},
doi = {10.1007/S00453-022-00928-W},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannFHSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BringmannKLMM22,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler and
Yannic Maus and
Anisur Rahaman Molla},
title = {Greedy routing and the algorithmic small-world phenomenon},
journal = {J. Comput. Syst. Sci.},
volume = {125},
pages = {59--105},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.11.003},
doi = {10.1016/J.JCSS.2021.11.003},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BringmannKLMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AbboudBHS22,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {Scheduling lower bounds via {AND} subset sum},
journal = {J. Comput. Syst. Sci.},
volume = {127},
pages = {29--40},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.01.005},
doi = {10.1016/J.JCSS.2022.01.005},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AbboudBHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbboudBHS22,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {SETH-based Lower Bounds for Subset Sum and Bicriteria Path},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {1},
pages = {6:1--6:22},
year = {2022},
url = {https://doi.org/10.1145/3450524},
doi = {10.1145/3450524},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AbboudBHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BanyassadyBBBFH22,
author = {Bahareh Banyassady and
Mark de Berg and
Karl Bringmann and
Kevin Buchin and
Henning Fernau and
Dan Halperin and
Irina Kostitsyna and
Yoshio Okamoto and
Stijn Slot},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.12},
doi = {10.4230/LIPICS.SOCG.2022.12},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/BanyassadyBBBFH22.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, 01 Jun 2022 01:00: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/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 = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannCFK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannC22,
author = {Karl Bringmann and
Alejandro Cassis},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {31:1--31:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.31},
doi = {10.4230/LIPICS.ICALP.2022.31},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannCFN22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Improved Sublinear-Time Edit Distance for Preprocessed Strings},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {32:1--32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.32},
doi = {10.4230/LIPICS.ICALP.2022.32},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannCFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BringmannCM22,
author = {Karl Bringmann and
Nofar Carmeli and
Stefan Mengel},
editor = {Leonid Libkin and
Pablo Barcel{\'{o}}},
title = {Tight Fine-Grained Bounds for Direct Access on Join Queries},
booktitle = {{PODS} '22: International Conference on Management of Data, Philadelphia,
PA, USA, June 12 - 17, 2022},
pages = {427--436},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3517804.3526234},
doi = {10.1145/3517804.3526234},
timestamp = {Wed, 15 Jun 2022 08:52:54 +0200},
biburl = {https://dblp.org/rec/conf/pods/BringmannCM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannDNP22,
author = {Karl Bringmann and
Anne Driemel and
Andr{\'{e}} Nusser and
Ioannis Psarros},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Tight Bounds for Approximate Near Neighbor Searching for Time Series
under the Fr{\'{e}}chet Distance},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {517--550},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.25},
doi = {10.1137/1.9781611977073.25},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannDNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannFN22,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3069--3090},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.119},
doi = {10.1137/1.9781611977073.119},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannCFN22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Almost-optimal sublinear-time edit distance in the low distance regime},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1102--1115},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519990},
doi = {10.1145/3519935.3519990},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannCFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBKZ22,
author = {Amir Abboud and
Karl Bringmann and
Seri Khoury and
Or Zamir},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hardness of approximation in p via short cycle removal: cycle detection,
distance oracles, and beyond},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1487--1500},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520066},
doi = {10.1145/3519935.3520066},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudBKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sosa/2022,
editor = {Karl Bringmann and
Timothy M. Chan},
title = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066},
doi = {10.1137/1.9781611977066},
isbn = {978-1-61197-706-6},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-02401,
author = {Karl Bringmann and
Nofar Carmeli and
Stefan Mengel},
title = {Tight Fine-Grained Bounds for Direct Access on Join Queries},
journal = {CoRR},
volume = {abs/2201.02401},
year = {2022},
url = {https://arxiv.org/abs/2201.02401},
eprinttype = {arXiv},
eprint = {2201.02401},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-02401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08066,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
title = {Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime},
journal = {CoRR},
volume = {abs/2202.08066},
year = {2022},
url = {https://arxiv.org/abs/2202.08066},
eprinttype = {arXiv},
eprint = {2202.08066},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08066.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-10465,
author = {Amir Abboud and
Karl Bringmann and
Seri Khoury and
Or Zamir},
title = {Hardness of Approximation in {P} via Short Cycle Removal: Cycle Detection,
Distance Oracles, and Beyond},
journal = {CoRR},
volume = {abs/2204.10465},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.10465},
doi = {10.48550/ARXIV.2204.10465},
eprinttype = {arXiv},
eprint = {2204.10465},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-10465.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/corr/abs-2204-14137,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
title = {Improved Sublinear-Time Edit Distance for Preprocessed Strings},
journal = {CoRR},
volume = {abs/2204.14137},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.14137},
doi = {10.48550/ARXIV.2204.14137},
eprinttype = {arXiv},
eprint = {2204.14137},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-14137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-07777,
author = {Bahareh Banyassady and
Mark de Berg and
Karl Bringmann and
Kevin Buchin and
Henning Fernau and
Dan Halperin and
Irina Kostitsyna and
Yoshio Okamoto and
Stijn Slot},
title = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds},
journal = {CoRR},
volume = {abs/2205.07777},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.07777},
doi = {10.48550/ARXIV.2205.07777},
eprinttype = {arXiv},
eprint = {2205.07777},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-07777.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-08493,
author = {Karl Bringmann and
Alejandro Cassis},
title = {Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution},
journal = {CoRR},
volume = {abs/2205.08493},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.08493},
doi = {10.48550/ARXIV.2205.08493},
eprinttype = {arXiv},
eprint = {2205.08493},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-08493.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-11996,
author = {Karl Bringmann and
Nofar Carmeli},
title = {Unbalanced Triangle Detection and Enumeration Hardness for Unions
of Conjunctive Queries},
journal = {CoRR},
volume = {abs/2210.11996},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.11996},
doi = {10.48550/ARXIV.2210.11996},
eprinttype = {arXiv},
eprint = {2210.11996},
timestamp = {Tue, 25 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-11996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-07058,
author = {Amir Abboud and
Karl Bringmann and
Nick Fischer},
title = {Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive
Combinatorics},
journal = {CoRR},
volume = {abs/2211.07058},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.07058},
doi = {10.48550/ARXIV.2211.07058},
eprinttype = {arXiv},
eprint = {2211.07058},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-07058.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 = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/BringmannCFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Bringmann21,
author = {Karl Bringmann},
editor = {Liesbeth De Mol and
Andreas Weiermann and
Florin Manea and
David Fern{\'{a}}ndez{-}Duque},
title = {Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational
Geometry},
booktitle = {Connecting with Computability - 17th Conference on Computability in
Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12813},
pages = {60--70},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80049-9\_6},
doi = {10.1007/978-3-030-80049-9\_6},
timestamp = {Tue, 20 Jul 2021 15:29:21 +0200},
biburl = {https://dblp.org/rec/conf/cie/Bringmann21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannN21,
author = {Karl Bringmann and
Andr{\'{e}} Nusser},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff
Distance Under Translation},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.18},
doi = {10.4230/LIPICS.SOCG.2021.18},
timestamp = {Fri, 04 Jun 2021 14:36:21 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannD21,
author = {Karl Bringmann and
Debarati Das},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {A Linear-Time n\({}^{\mbox{0.4}}\)-Approximation for Longest Common
Subsequence},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {39:1--39:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.39},
doi = {10.4230/LIPICS.ICALP.2021.39},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BringmannD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannS21,
author = {Karl Bringmann and
Jasper Slusallek},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are
Probably Optimal},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {40:1--40:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.40},
doi = {10.4230/LIPICS.ICALP.2021.40},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannN21,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Fast n-Fold Boolean Convolution via Additive Combinatorics},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {41:1--41:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.41},
doi = {10.4230/LIPICS.ICALP.2021.41},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannW21,
author = {Karl Bringmann and
Philip Wellnitz},
editor = {D{\'{a}}niel Marx},
title = {On Near-Linear-Time Algorithms for Dense Subset Sum},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1777--1796},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.107},
doi = {10.1137/1.9781611976465.107},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannN21,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {D{\'{a}}niel Marx},
title = {A Fine-Grained Perspective on Approximating Subset Sum and Partition},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1797--1815},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.108},
doi = {10.1137/1.9781611976465.108},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BringmannN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AxiotisBBJNTW21,
author = {Kyriakos Axiotis and
Arturs Backurs and
Karl Bringmann and
Ce Jin and
Vasileios Nakos and
Christos Tzamos and
Hongxun Wu},
editor = {Hung Viet Le and
Valerie King},
title = {Fast and Simple Modular Subset Sum},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {57--67},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.6},
doi = {10.1137/1.9781611976496.6},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/AxiotisBBJNTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannFN21,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sparse nonnegative convolution is equivalent to dense nonnegative
convolution},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1711--1724},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451090},
doi = {10.1145/3406325.3451090},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannFN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07696,
author = {Karl Bringmann and
Andr{\'{e}} Nusser},
title = {Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff
Distance Under Translation},
journal = {CoRR},
volume = {abs/2101.07696},
year = {2021},
url = {https://arxiv.org/abs/2101.07696},
eprinttype = {arXiv},
eprint = {2101.07696},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07696.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-03968,
author = {Karl Bringmann and
Vasileios Nakos},
title = {Fast n-fold Boolean Convolution via Additive Combinatorics},
journal = {CoRR},
volume = {abs/2105.03968},
year = {2021},
url = {https://arxiv.org/abs/2105.03968},
eprinttype = {arXiv},
eprint = {2105.03968},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-03968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05062,
author = {Karl Bringmann and
Jasper Slusallek},
title = {Current Algorithms for Detecting Subgraphs of Bounded Treewidth are
Probably Optimal},
journal = {CoRR},
volume = {abs/2105.05062},
year = {2021},
url = {https://arxiv.org/abs/2105.05062},
eprinttype = {arXiv},
eprint = {2105.05062},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05984,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
title = {Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative
Convolution},
journal = {CoRR},
volume = {abs/2105.05984},
year = {2021},
url = {https://arxiv.org/abs/2105.05984},
eprinttype = {arXiv},
eprint = {2105.05984},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-08195,
author = {Karl Bringmann and
Vincent Cohen{-}Addad and
Debarati Das},
title = {A Linear-Time n\({}^{\mbox{0.4}}\)-Approximation for Longest Common
Subsequence},
journal = {CoRR},
volume = {abs/2106.08195},
year = {2021},
url = {https://arxiv.org/abs/2106.08195},
eprinttype = {arXiv},
eprint = {2106.08195},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-08195.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-2107-07347,
author = {Karl Bringmann and
Michael Kapralov and
Mikhail Makarov and
Vasileios Nakos and
Amir Yagudin and
Amir Zandieh},
title = {Sparse Fourier Transform by traversing Cooley-Tukey {FFT} computation
graphs},
journal = {CoRR},
volume = {abs/2107.07347},
year = {2021},
url = {https://arxiv.org/abs/2107.07347},
eprinttype = {arXiv},
eprint = {2107.07347},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07625,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
title = {Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution},
journal = {CoRR},
volume = {abs/2107.07625},
year = {2021},
url = {https://arxiv.org/abs/2107.07625},
eprinttype = {arXiv},
eprint = {2107.07625},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07792,
author = {Karl Bringmann and
Anne Driemel and
Andr{\'{e}} Nusser and
Ioannis Psarros},
title = {Tight Bounds for Approximate Near Neighbor Searching for Time Series
under the Fr{\'{e}}chet Distance},
journal = {CoRR},
volume = {abs/2107.07792},
year = {2021},
url = {https://arxiv.org/abs/2107.07792},
eprinttype = {arXiv},
eprint = {2107.07792},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-07792.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-13206,
author = {Karl Bringmann and
Vasileios Nakos},
title = {Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset
Sum},
journal = {CoRR},
volume = {abs/2107.13206},
year = {2021},
url = {https://arxiv.org/abs/2107.13206},
eprinttype = {arXiv},
eprint = {2107.13206},
timestamp = {Fri, 30 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-13206.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-10283,
author = {Karl Bringmann},
title = {Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational
Geometry},
journal = {CoRR},
volume = {abs/2110.10283},
year = {2021},
url = {https://arxiv.org/abs/2110.10283},
eprinttype = {arXiv},
eprint = {2110.10283},
timestamp = {Thu, 28 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-10283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannHM20,
author = {Karl Bringmann and
Thore Husfeldt and
M{\aa}ns Magnusson},
title = {Multivariate Analysis of Orthogonal Range Searching and Graph Distances},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2292--2315},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00680-z},
doi = {10.1007/S00453-020-00680-Z},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannHM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BringmannC20,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
title = {Polyline simplification has cubic complexity},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {94--130},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a5},
doi = {10.20382/JOCG.V11I2A5},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BringmannC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannGMW20,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless
{APSP} Can)},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {48:1--48:22},
year = {2020},
url = {https://doi.org/10.1145/3381878},
doi = {10.1145/3381878},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BringmannGMW20.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 = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/esa/BringmannKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudBHS20,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Scheduling Lower Bounds via {AND} Subset Sum},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.4},
doi = {10.4230/LIPICS.ICALP.2020.4},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudBHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannFHSW20,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {19:1--19:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.19},
doi = {10.4230/LIPICS.ICALP.2020.19},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannFHSW20.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}
}
@inproceedings{DBLP:conf/stoc/BringmannN20,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Top-k-convolution and the quest for near-linear output-sensitive subset
sum},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {982--995},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384308},
doi = {10.1145/3357713.3384308},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-07104,
author = {Karl Bringmann and
Nick Fischer and
Danny Hermelin and
Dvir Shabtay and
Philip Wellnitz},
title = {Faster Minimization of Tardy Processing Time on a Single Machine},
journal = {CoRR},
volume = {abs/2003.07104},
year = {2020},
url = {https://arxiv.org/abs/2003.07104},
eprinttype = {arXiv},
eprint = {2003.07104},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-07104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-07113,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {Scheduling Lower Bounds via {AND} Subset Sum},
journal = {CoRR},
volume = {abs/2003.07113},
year = {2020},
url = {https://arxiv.org/abs/2003.07113},
eprinttype = {arXiv},
eprint = {2003.07113},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-07113.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-2008-10577,
author = {Kyriakos Axiotis and
Arturs Backurs and
Karl Bringmann and
Ce Jin and
Vasileios Nakos and
Christos Tzamos and
Hongxun Wu},
title = {Fast and Simple Modular Subset Sum},
journal = {CoRR},
volume = {abs/2008.10577},
year = {2020},
url = {https://arxiv.org/abs/2008.10577},
eprinttype = {arXiv},
eprint = {2008.10577},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-10577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-09096,
author = {Karl Bringmann and
Philip Wellnitz},
title = {On Near-Linear-Time Algorithms for Dense Subset Sum},
journal = {CoRR},
volume = {abs/2010.09096},
year = {2020},
url = {https://arxiv.org/abs/2010.09096},
eprinttype = {arXiv},
eprint = {2010.09096},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-09096.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/siamcomp/BringmannGSW19,
author = {Karl Bringmann and
Fabrizio Grandoni and
Barna Saha and
Virginia Vassilevska Williams},
title = {Truly Subcubic Algorithms for Language Edit Distance and {RNA} Folding
via Fast Bounded-Difference Min-Plus Product},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {2},
pages = {481--512},
year = {2019},
url = {https://doi.org/10.1137/17M112720X},
doi = {10.1137/17M112720X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BringmannGSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BringmannKL19,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler},
title = {Geometric inhomogeneous random graphs},
journal = {Theor. Comput. Sci.},
volume = {760},
pages = {35--54},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.08.014},
doi = {10.1016/J.TCS.2018.08.014},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BringmannKL19.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 = {Thu, 02 Feb 2023 13:27:04 +0100},
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 = {Mon, 02 Jan 2023 09:02:13 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannC19,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
editor = {Gill Barequet and
Yusu Wang},
title = {Polyline Simplification has Cubic Complexity},
booktitle = {35th International Symposium on Computational Geometry, SoCG 2019,
June 18-21, 2019, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {129},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2019.18},
doi = {10.4230/LIPICS.SOCG.2019.18},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BringmannKPL19,
author = {Karl Bringmann and
S{\'{a}}ndor Kisfaludi{-}Bak and
Michal Pilipczuk and
Erik Jan van Leeuwen},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {On Geometric Set Cover for Orthants},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {26:1--26:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.26},
doi = {10.4230/LIPICS.ESA.2019.26},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BringmannKPL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudBHS19,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
editor = {Timothy M. Chan},
title = {SETH-Based Lower Bounds for Subset Sum and Bicriteria Path},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {41--57},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.3},
doi = {10.1137/1.9781611975482.3},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudBHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BanBBKLW19,
author = {Frank Ban and
Vijay Bhattiprolu and
Karl Bringmann and
Pavel Kolev and
Euiwoong Lee and
David P. Woodruff},
editor = {Timothy M. Chan},
title = {A {PTAS} for {\(\mathscr{l}\)}p-Low Rank Approximation},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {747--766},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.47},
doi = {10.1137/1.9781611975482.47},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BanBBKLW19.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/stacs/Bringmann19,
author = {Karl Bringmann},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Fine-Grained Complexity Theory (Tutorial)},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {4:1--4:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.4},
doi = {10.4230/LIPICS.STACS.2019.4},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Bringmann19.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}
}
@article{DBLP:journals/corr/abs-1912-12529,
author = {Karl Bringmann},
title = {Approximating Subset Sum is equivalent to Min-Plus-Convolution},
journal = {CoRR},
volume = {abs/1912.12529},
year = {2019},
url = {http://arxiv.org/abs/1912.12529},
eprinttype = {arXiv},
eprint = {1912.12529},
timestamp = {Sat, 04 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-12529.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannFK18,
author = {Karl Bringmann and
Tobias Friedrich and
Anton Krohmer},
title = {De-anonymization of Heterogeneous Random Graphs in Quasilinear Time},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3397--3427},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0395-0},
doi = {10.1007/S00453-017-0395-0},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BringmannK18,
author = {Karl Bringmann and
Sebastian Krinninger},
title = {A note on hardness of diameter approximation},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {10--15},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.010},
doi = {10.1016/J.IPL.2017.12.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BringmannK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BringmannIZ18,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On Algebraic Branching Programs of Small Width},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {32:1--32:29},
year = {2018},
url = {https://doi.org/10.1145/3209663},
doi = {10.1145/3209663},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BringmannIZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BringmannC18,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {Sketching, Streaming, and Fine-Grained Complexity of (Weighted) {LCS}},
booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
Ahmedabad, India},
series = {LIPIcs},
volume = {122},
pages = {40:1--40:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.40},
doi = {10.4230/LIPICS.FSTTCS.2018.40},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BringmannC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudB18,
author = {Amir Abboud and
Karl Bringmann},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Tighter Connections Between Formula-SAT and Shaving Logs},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.8},
doi = {10.4230/LIPICS.ICALP.2018.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BringmannHM18,
author = {Karl Bringmann and
Thore Husfeldt and
M{\aa}ns Magnusson},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Multivariate Analysis of Orthogonal Range Searching and Graph Distances},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {4:1--4:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.4},
doi = {10.4230/LIPICS.IPEC.2018.4},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BringmannHM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannGMW18,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1190--1206},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.77},
doi = {10.1137/1.9781611975031.77},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannGMW18.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 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBDN18,
author = {Amir Abboud and
Karl Bringmann and
Holger Dell and
Jesper Nederlof},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {More consequences of falsifying {SETH} and the orthogonal vectors
conjecture},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {253--266},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188938},
doi = {10.1145/3188745.3188938},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbboudBDN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamsenABCMR18,
author = {Mikkel Abrahamsen and
Anna Adamaszek and
Karl Bringmann and
Vincent Cohen{-}Addad and
Mehran Mehr and
Eva Rotenberg and
Alan Roytman and
Mikkel Thorup},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Fast fencing},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {564--573},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188878},
doi = {10.1145/3188745.3188878},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamsenABCMR18.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-00804,
author = {Karl Bringmann and
Philip Wellnitz},
title = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
journal = {CoRR},
volume = {abs/1803.00804},
year = {2018},
url = {http://arxiv.org/abs/1803.00804},
eprinttype = {arXiv},
eprint = {1803.00804},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00806,
author = {Julian Baldus and
Karl Bringmann},
title = {A fast implementation of near neighbors queries for Fr{\'{e}}chet
distance {(GIS} Cup)},
journal = {CoRR},
volume = {abs/1803.00806},
year = {2018},
url = {http://arxiv.org/abs/1803.00806},
eprinttype = {arXiv},
eprint = {1803.00806},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00849,
author = {Karl Bringmann and
Sergio Cabello and
Michael T. M. Emmerich},
title = {Maximum Volume Subset Selection for Anchored Boxes},
journal = {CoRR},
volume = {abs/1803.00849},
year = {2018},
url = {http://arxiv.org/abs/1803.00849},
eprinttype = {arXiv},
eprint = {1803.00849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00849.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-1804-00101,
author = {Mikkel Abrahamsen and
Anna Adamaszek and
Karl Bringmann and
Vincent Cohen{-}Addad and
Mehran Mehr and
Eva Rotenberg and
Alan Roytman and
Mikkel Thorup},
title = {Fast Fencing},
journal = {CoRR},
volume = {abs/1804.00101},
year = {2018},
url = {http://arxiv.org/abs/1804.00101},
eprinttype = {arXiv},
eprint = {1804.00101},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-00101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08978,
author = {Amir Abboud and
Karl Bringmann},
title = {Tighter Connections Between Formula-SAT and Shaving Logs},
journal = {CoRR},
volume = {abs/1804.08978},
year = {2018},
url = {http://arxiv.org/abs/1804.08978},
eprinttype = {arXiv},
eprint = {1804.08978},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-07135,
author = {Karl Bringmann and
Thore Husfeldt and
M{\aa}ns Magnusson},
title = {Multivariate Analysis of Orthogonal Range Searching and Graph Distances
Parameterized by Treewidth},
journal = {CoRR},
volume = {abs/1805.07135},
year = {2018},
url = {http://arxiv.org/abs/1805.07135},
eprinttype = {arXiv},
eprint = {1805.07135},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-07135.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08554,
author = {Amir Abboud and
Karl Bringmann and
Holger Dell and
Jesper Nederlof},
title = {More Consequences of Falsifying {SETH} and the Orthogonal Vectors
Conjecture},
journal = {CoRR},
volume = {abs/1805.08554},
year = {2018},
url = {http://arxiv.org/abs/1805.08554},
eprinttype = {arXiv},
eprint = {1805.08554},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-08554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06101,
author = {Frank Ban and
Vijay Bhattiprolu and
Karl Bringmann and
Pavel Kolev and
Euiwoong Lee and
David P. Woodruff},
title = {A {PTAS} for {\unicode{120001}}\({}_{\mbox{p}}\)-Low Rank Approximation},
journal = {CoRR},
volume = {abs/1807.06101},
year = {2018},
url = {http://arxiv.org/abs/1807.06101},
eprinttype = {arXiv},
eprint = {1807.06101},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00621,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
title = {Polyline Simplification has Cubic Complexity},
journal = {CoRR},
volume = {abs/1810.00621},
year = {2018},
url = {http://arxiv.org/abs/1810.00621},
eprinttype = {arXiv},
eprint = {1810.00621},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-00621.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01238,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
title = {Sketching, Streaming, and Fine-Grained Complexity of (Weighted) {LCS}},
journal = {CoRR},
volume = {abs/1810.01238},
year = {2018},
url = {http://arxiv.org/abs/1810.01238},
eprinttype = {arXiv},
eprint = {1810.01238},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01238.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/algorithmica/0002B0G017,
author = {S. Anand and
Karl Bringmann and
Tobias Friedrich and
Naveen Garg and
Amit Kumar},
title = {Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {515--536},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0082-y},
doi = {10.1007/S00453-015-0082-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/0002B0G017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannP17,
author = {Karl Bringmann and
Konstantinos Panagiotou},
title = {Efficient Sampling Methods for Discrete Distributions},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {484--508},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0205-0},
doi = {10.1007/S00453-016-0205-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannP17.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/coco/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
editor = {Ryan O'Donnell},
title = {On Algebraic Branching Programs of Small Width},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {20:1--20:31},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.20},
doi = {10.4230/LIPICS.CCC.2017.20},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannCE17,
author = {Karl Bringmann and
Sergio Cabello and
Michael T. M. Emmerich},
editor = {Boris Aronov and
Matthew J. Katz},
title = {Maximum Volume Subset Selection for Anchored Boxes},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.22},
doi = {10.4230/LIPICS.SOCG.2017.22},
timestamp = {Wed, 16 Jun 2021 12:03:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannCE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BringmannW17,
author = {Karl Bringmann and
Philip Wellnitz},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.12},
doi = {10.4230/LIPICS.CPM.2017.12},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BringmannW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BringmannKL17,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Sampling Geometric Inhomogeneous Random Graphs in Linear Time},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {20:1--20:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.20},
doi = {10.4230/LIPICS.ESA.2017.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BringmannKL17.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/focs/BringmannGL17,
author = {Karl Bringmann and
Allan Gr{\o}nlund and
Kasper Green Larsen},
editor = {Chris Umans},
title = {A Dichotomy for Regular Expression Membership Testing},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {307--318},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.36},
doi = {10.1109/FOCS.2017.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/BaldusB17,
author = {Julian Baldus and
Karl Bringmann},
editor = {Erik G. Hoel and
Shawn D. Newsam and
Siva Ravada and
Roberto Tamassia and
Goce Trajcevski},
title = {A fast implementation of near neighbors queries for Fr{\'{e}}chet
distance {(GIS} Cup)},
booktitle = {Proceedings of the 25th {ACM} {SIGSPATIAL} International Conference
on Advances in Geographic Information Systems, {GIS} 2017, Redondo
Beach, CA, USA, November 7-10, 2017},
pages = {99:1--99:4},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3139958.3140062},
doi = {10.1145/3139958.3140062},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gis/BaldusB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannHK17,
author = {Karl Bringmann and
Thomas Dueholm Hansen and
Sebastian Krinninger},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time
Ratio in Directed Graphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {124:1--124:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.124},
doi = {10.4230/LIPICS.ICALP.2017.124},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BringmannHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BringmannKW17,
author = {Karl Bringmann and
Pavel Kolev and
David P. Woodruff},
editor = {Isabelle Guyon and
Ulrike von Luxburg and
Samy Bengio and
Hanna M. Wallach and
Rob Fergus and
S. V. N. Vishwanathan and
Roman Garnett},
title = {Approximation Algorithms for l\({}_{\mbox{0}}\)-Low Rank Approximation},
booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference
on Neural Information Processing Systems 2017, December 4-9, 2017,
Long Beach, CA, {USA}},
pages = {6648--6659},
year = {2017},
url = {https://proceedings.neurips.cc/paper/2017/hash/e94fe9ac8dc10dd8b9a239e6abee2848-Abstract.html},
timestamp = {Thu, 21 Jan 2021 13:58:27 +0100},
biburl = {https://dblp.org/rec/conf/nips/BringmannKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BringmannKLMM17,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler and
Yannic Maus and
Anisur Rahaman Molla},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Greedy Routing and the Algorithmic Small-World Phenomenon},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {371--380},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087829},
doi = {10.1145/3087801.3087829},
timestamp = {Tue, 06 Nov 2018 11:07:18 +0100},
biburl = {https://dblp.org/rec/conf/podc/BringmannKLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bringmann17,
author = {Karl Bringmann},
editor = {Philip N. Klein},
title = {A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1073--1084},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.69},
doi = {10.1137/1.9781611974782.69},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bringmann17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BringmannK17,
author = {Karl Bringmann and
Sebastian Krinninger},
editor = {Andr{\'{e}}a W. Richa},
title = {Brief Announcement: {A} Note on Hardness of Diameter Approximation},
booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017,
October 16-20, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {91},
pages = {44:1--44:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.DISC.2017.44},
doi = {10.4230/LIPICS.DISC.2017.44},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wdag/BringmannK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On algebraic branching programs of small width},
journal = {CoRR},
volume = {abs/1702.05328},
year = {2017},
url = {http://arxiv.org/abs/1702.05328},
eprinttype = {arXiv},
eprint = {1702.05328},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannGMW17,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
journal = {CoRR},
volume = {abs/1703.08940},
year = {2017},
url = {http://arxiv.org/abs/1703.08940},
eprinttype = {arXiv},
eprint = {1703.08940},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannGMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbboudBHS17,
author = {Amir Abboud and
Karl Bringmann and
Danny Hermelin and
Dvir Shabtay},
title = {SETH-Based Lower Bounds for Subset Sum and Bicriteria Path},
journal = {CoRR},
volume = {abs/1704.04546},
year = {2017},
url = {http://arxiv.org/abs/1704.04546},
eprinttype = {arXiv},
eprint = {1704.04546},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbboudBHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannHK17,
author = {Karl Bringmann and
Thomas Dueholm Hansen and
Sebastian Krinninger},
title = {Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time
Ratio in Directed Graphs},
journal = {CoRR},
volume = {abs/1704.08122},
year = {2017},
url = {http://arxiv.org/abs/1704.08122},
eprinttype = {arXiv},
eprint = {1704.08122},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannK17,
author = {Karl Bringmann and
Sebastian Krinninger},
title = {A Note on Hardness of Diameter Approximation},
journal = {CoRR},
volume = {abs/1705.02127},
year = {2017},
url = {http://arxiv.org/abs/1705.02127},
eprinttype = {arXiv},
eprint = {1705.02127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannGSW17,
author = {Karl Bringmann and
Fabrizio Grandoni and
Barna Saha and
Virginia Vassilevska Williams},
title = {Truly Sub-cubic Algorithms for Language Edit Distance and {RNA} Folding
via Fast Bounded-Difference Min-Plus Product},
journal = {CoRR},
volume = {abs/1707.05095},
year = {2017},
url = {http://arxiv.org/abs/1707.05095},
eprinttype = {arXiv},
eprint = {1707.05095},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannGSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-11253,
author = {Karl Bringmann and
Pavel Kolev and
David P. Woodruff},
title = {Approximation Algorithms for {\unicode{2113}}\({}_{\mbox{0}}\)-Low
Rank Approximation},
journal = {CoRR},
volume = {abs/1710.11253},
year = {2017},
url = {http://arxiv.org/abs/1710.11253},
eprinttype = {arXiv},
eprint = {1710.11253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-11253.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On algebraic branching programs of small width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-034}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/034},
eprinttype = {ECCC},
eprint = {TR17-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BringmannHML16,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized complexity dichotomy for Steiner Multicut},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {6},
pages = {1020--1043},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.03.003},
doi = {10.1016/J.JCSS.2016.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BringmannHML16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BringmannM16,
author = {Karl Bringmann and
Wolfgang Mulzer},
title = {Approximability of the discrete Fr{\'{e}}chet distance},
journal = {J. Comput. Geom.},
volume = {7},
number = {2},
pages = {46--76},
year = {2016},
url = {https://doi.org/10.20382/jocg.v7i2a4},
doi = {10.20382/JOCG.V7I2A4},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BringmannM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BringmannSSS16,
author = {Karl Bringmann and
Thomas Sauerwald and
Alexandre Stauffer and
He Sun},
title = {Balls into bins via local search: Cover time and maximum load},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {681--702},
year = {2016},
url = {https://doi.org/10.1002/rsa.20602},
doi = {10.1002/RSA.20602},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BringmannSSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bringmann0MN16,
author = {Karl Bringmann and
L{\'{a}}szl{\'{o}} Kozma and
Shay Moran and
N. S. Narayanaswamy},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Hitting Set for Hypergraphs of Low VC-dimension},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {23:1--23:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.23},
doi = {10.4230/LIPICS.ESA.2016.23},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Bringmann0MN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannGSW16,
author = {Karl Bringmann and
Fabrizio Grandoni and
Barna Saha and
Virginia Vassilevska Williams},
editor = {Irit Dinur},
title = {Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding
via Fast Bounded-Difference Min-Plus Product},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {375--384},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.48},
doi = {10.1109/FOCS.2016.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannGSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannKL16,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler},
title = {Average Distance in a General Class of Scale-Free Networks with Underlying
Geometry},
journal = {CoRR},
volume = {abs/1602.05712},
year = {2016},
url = {http://arxiv.org/abs/1602.05712},
eprinttype = {arXiv},
eprint = {1602.05712},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bringmann16,
author = {Karl Bringmann},
title = {A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum},
journal = {CoRR},
volume = {abs/1610.04712},
year = {2016},
url = {http://arxiv.org/abs/1610.04712},
eprinttype = {arXiv},
eprint = {1610.04712},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bringmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannGL16,
author = {Karl Bringmann and
Allan Gr{\o}nlund and
Kasper Green Larsen},
title = {A Dichotomy for Regular Expression Membership Testing},
journal = {CoRR},
volume = {abs/1611.00918},
year = {2016},
url = {http://arxiv.org/abs/1611.00918},
eprinttype = {arXiv},
eprint = {1611.00918},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannGL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannKLMM16,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler and
Yannic Maus and
Anisur Rahaman Molla},
title = {Greedy Routing and the Algorithmic Small-World Phenomenom},
journal = {CoRR},
volume = {abs/1612.05539},
year = {2016},
url = {http://arxiv.org/abs/1612.05539},
eprinttype = {arXiv},
eprint = {1612.05539},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannKLMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Bringmann15,
author = {Karl Bringmann},
title = {Sampling from discrete distributions and computing Fr{\'{e}}chet
distances},
school = {Saarland University},
year = {2015},
url = {http://scidok.sulb.uni-saarland.de/volltexte/2015/5988/},
urn = {urn:nbn:de:bsz:291-scidok-59883},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Bringmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BringmannEMR15,
author = {Karl Bringmann and
Christian Engels and
Bodo Manthey and
B. V. Raghavendra Rao},
title = {Random Shortest Paths: Non-Euclidean Instances for Metric Optimization
Problems},
journal = {Algorithmica},
volume = {73},
number = {1},
pages = {42--62},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9901-9},
doi = {10.1007/S00453-014-9901-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BringmannEMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AlvarezBRS15,
author = {Victor Alvarez and
Karl Bringmann and
Saurabh Ray and
Raimund Seidel},
title = {Counting triangulations and other crossing-free structures approximately},
journal = {Comput. Geom.},
volume = {48},
number = {5},
pages = {386--397},
year = {2015},
url = {https://doi.org/10.1016/j.comgeo.2014.12.006},
doi = {10.1016/J.COMGEO.2014.12.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AlvarezBRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AlvarezBCR15,
author = {Victor Alvarez and
Karl Bringmann and
Radu Curticapean and
Saurabh Ray},
title = {Counting Triangulations and Other Crossing-Free Structures via Onion
Layers},
journal = {Discret. Comput. Geom.},
volume = {53},
number = {4},
pages = {675--690},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9672-3},
doi = {10.1007/S00454-015-9672-3},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AlvarezBCR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Bringmann15,
author = {Karl Bringmann},
title = {Sampling from Discrete Distributions and Computing Frechet Distances},
journal = {Bull. {EATCS}},
volume = {116},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/334},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Bringmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/0007BFN15,
author = {Markus Wagner and
Karl Bringmann and
Tobias Friedrich and
Frank Neumann},
title = {Efficient optimization of many objectives by approximation-guided
evolution},
journal = {Eur. J. Oper. Res.},
volume = {243},
number = {2},
pages = {465--479},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2014.11.032},
doi = {10.1016/J.EJOR.2014.11.032},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/0007BFN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/BringmannDNS15,
author = {Karl Bringmann and
Benjamin Doerr and
Adrian Neumann and
Jakub Sliacan},
title = {Online Checkpointing with Improved Worst-Case Guarantees},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {3},
pages = {478--490},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2014.0639},
doi = {10.1287/IJOC.2014.0639},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/BringmannDNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/BringmannFK15,
author = {Karl Bringmann and
Tobias Friedrich and
Patrick Klitzke},
title = {Efficient computation of two-dimensional solution sets maximizing
the epsilon-indicator},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2015, Sendai, Japan,
May 25-28, 2015},
pages = {970--977},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/CEC.2015.7256995},
doi = {10.1109/CEC.2015.7256995},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/cec/BringmannFK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BringmannM15,
author = {Karl Bringmann and
Wolfgang Mulzer},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Approximability of the Discrete Fr{\'{e}}chet Distance},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {739--753},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.739},
doi = {10.4230/LIPICS.SOCG.2015.739},
timestamp = {Wed, 16 Jun 2021 12:03:14 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BringmannM15.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/BringmannFHRS15,
author = {Karl Bringmann and
Tobias Friedrich and
Martin Hoefer and
Ralf Rothenberger and
Thomas Sauerwald},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Ultra-Fast Load Balancing on Scale-Free Networks},
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 = {516--527},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_41},
doi = {10.1007/978-3-662-47666-6\_41},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BringmannFHRS15.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/stacs/BringmannHML15,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {157--170},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.157},
doi = {10.4230/LIPICS.STACS.2015.157},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BringmannHML15.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}
}
@article{DBLP:journals/corr/BringmannKL15,
author = {Karl Bringmann and
Ralph Keusch and
Johannes Lengler},
title = {Geometric Inhomogeneous Random Graphs},
journal = {CoRR},
volume = {abs/1511.00576},
year = {2015},
url = {http://arxiv.org/abs/1511.00576},
eprinttype = {arXiv},
eprint = {1511.00576},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bringmann0MN15,
author = {Karl Bringmann and
L{\'{a}}szl{\'{o}} Kozma and
Shay Moran and
N. S. Narayanaswamy},
title = {Hitting Set in hypergraphs of low VC-dimension},
journal = {CoRR},
volume = {abs/1512.00481},
year = {2015},
url = {http://arxiv.org/abs/1512.00481},
eprinttype = {arXiv},
eprint = {1512.00481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bringmann0MN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tec/BringmannF14,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Convergence of Hypervolume-Based Archiving Algorithms},
journal = {{IEEE} Trans. Evol. Comput.},
volume = {18},
number = {5},
pages = {643--657},
year = {2014},
url = {https://doi.org/10.1109/TEVC.2014.2341711},
doi = {10.1109/TEVC.2014.2341711},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tec/BringmannF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BringmannFK14,
author = {Karl Bringmann and
Tobias Friedrich and
Anton Krohmer},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {De-anonymization of Heterogeneous Random Graphs in Quasilinear Time},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {197--208},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_17},
doi = {10.1007/978-3-662-44777-2\_17},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BringmannFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bringmann14,
author = {Karl Bringmann},
title = {Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic
Algorithms Unless {SETH} Fails},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {661--670},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.76},
doi = {10.1109/FOCS.2014.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bringmann14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/BringmannFK14,
author = {Karl Bringmann and
Tobias Friedrich and
Patrick Klitzke},
editor = {Dirk V. Arnold},
title = {Two-dimensional subset selection for hypervolume and epsilon-indicator},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} '14, Vancouver,
BC, Canada, July 12-16, 2014},
pages = {589--596},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2576768.2598276},
doi = {10.1145/2576768.2598276},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/BringmannFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannKPPT14,
author = {Karl Bringmann and
Fabian Kuhn and
Konstantinos Panagiotou and
Ueli Peter and
Henning Thomas},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Internal {DLA:} Efficient Simulation of a Physical Growth Model -
(Extended Abstract)},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {247--258},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_21},
doi = {10.1007/978-3-662-43948-7\_21},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannKPPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/BringmannFK14,
author = {Karl Bringmann and
Tobias Friedrich and
Patrick Klitzke},
editor = {Thomas Bartz{-}Beielstein and
J{\"{u}}rgen Branke and
Bogdan Filipic and
Jim Smith},
title = {Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator},
booktitle = {Parallel Problem Solving from Nature - {PPSN} {XIII} - 13th International
Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8672},
pages = {518--527},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-10762-2\_51},
doi = {10.1007/978-3-319-10762-2\_51},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/BringmannFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BringmannSS014,
author = {Karl Bringmann and
Thomas Sauerwald and
Alexandre Stauffer and
He Sun},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Balls into bins via local search: cover time and maximum load},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {187--198},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.187},
doi = {10.4230/LIPICS.STACS.2014.187},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BringmannSS014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/gi/Bringmann14,
author = {Karl Bringmann},
editor = {Abraham Bernstein and
Wolfgang Effelsberg and
Felix C. Freiling and
Steffen H{\"{o}}lldobler and
Hans{-}Peter Lenhof and
Paul Molitor and
Gustaf Neumann and
R{\"{u}}diger Reischuk and
Nicole Schweikardt and
Myra Spiliopoulou and
Harald St{\"{o}}rrle and
Sabine S{\"{u}}sstrunk},
title = {Generierung diskreter Zufallsvariablen und Berechnung der Fr{\'{e}}chetdistanz},
booktitle = {Ausgezeichnete Informatikdissertationen 2014},
series = {{LNI}},
volume = {{D-15}},
pages = {51--60},
publisher = {{GI}},
year = {2014},
url = {https://dl.gi.de/handle/20.500.12116/33855},
timestamp = {Tue, 04 Jul 2023 17:44:00 +0200},
biburl = {https://dblp.org/rec/conf/gi/Bringmann14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlvarezBRS14,
author = {Victor Alvarez and
Karl Bringmann and
Saurabh Ray and
Raimund Seidel},
title = {Counting Triangulations and other Crossing-Free Structures Approximately},
journal = {CoRR},
volume = {abs/1404.0261},
year = {2014},
url = {http://arxiv.org/abs/1404.0261},
eprinttype = {arXiv},
eprint = {1404.0261},
timestamp = {Fri, 23 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlvarezBRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bringmann14,
author = {Karl Bringmann},
title = {Why walking the dog takes time: Frechet distance has no strongly subquadratic
algorithms unless {SETH} fails},
journal = {CoRR},
volume = {abs/1404.1448},
year = {2014},
url = {http://arxiv.org/abs/1404.1448},
eprinttype = {arXiv},
eprint = {1404.1448},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bringmann14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannHML14,
author = {Karl Bringmann and
Danny Hermelin and
Matthias Mnich and
Erik Jan van Leeuwen},
title = {Parameterized Complexity Dichotomy for Steiner Multicut},
journal = {CoRR},
volume = {abs/1404.7006},
year = {2014},
url = {http://arxiv.org/abs/1404.7006},
eprinttype = {arXiv},
eprint = {1404.7006},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannHML14.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}
}
@article{DBLP:journals/ai/BringmannF13,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Approximation quality of the hypervolume indicator},
journal = {Artif. Intell.},
volume = {195},
pages = {265--290},
year = {2013},
url = {https://doi.org/10.1016/j.artint.2012.09.005},
doi = {10.1016/J.ARTINT.2012.09.005},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BringmannF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/BringmannFIV13,
author = {Karl Bringmann and
Tobias Friedrich and
Christian Igel and
Thomas Vo{\ss}},
title = {Speeding up many-objective optimization by Monte Carlo approximations},
journal = {Artif. Intell.},
volume = {204},
pages = {22--29},
year = {2013},
url = {https://doi.org/10.1016/j.artint.2013.08.001},
doi = {10.1016/J.ARTINT.2013.08.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BringmannFIV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AlvarezBRS13,
author = {Victor Alvarez and
Karl Bringmann and
Saurabh Ray and
Raimund Seidel},
title = {Counting Triangulations Approximately},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_21.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AlvarezBRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/BringmannF13,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Christian Blum and
Enrique Alba},
title = {Parameterized average-case complexity of the hypervolume indicator},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} '13, Amsterdam,
The Netherlands, July 6-10, 2013},
pages = {575--582},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2463372.2463450},
doi = {10.1145/2463372.2463450},
timestamp = {Wed, 13 Jul 2022 16:15:15 +0200},
biburl = {https://dblp.org/rec/conf/gecco/BringmannF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0002BFGK13,
author = {S. Anand and
Karl Bringmann and
Tobias Friedrich and
Naveen Garg and
Amit Kumar},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {13--24},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_2},
doi = {10.1007/978-3-642-39206-1\_2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0002BFGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannDNS13,
author = {Karl Bringmann and
Benjamin Doerr and
Adrian Neumann and
Jakub Sliacan},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Online Checkpointing with Improved Worst-Case Guarantees},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {255--266},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_22},
doi = {10.1007/978-3-642-39206-1\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannDNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannF13,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Exact and Efficient Generation of Geometric Random Variates and Random
Graphs},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {267--278},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_23},
doi = {10.1007/978-3-642-39206-1\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bringmann13,
author = {Karl Bringmann},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Bringing Order to Special Cases of Klee's Measure Problem},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {207--218},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_20},
doi = {10.1007/978-3-642-40313-2\_20},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Bringmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BringmannEMR13,
author = {Karl Bringmann and
Christian Engels and
Bodo Manthey and
B. V. Raghavendra Rao},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Random Shortest Paths: Non-euclidean Instances for Metric Optimization
Problems},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {219--230},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_21},
doi = {10.1007/978-3-642-40313-2\_21},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BringmannEMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannL13,
author = {Karl Bringmann and
Kasper Green Larsen},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Succinct sampling from discrete distributions},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {775--782},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488707},
doi = {10.1145/2488608.2488707},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BringmannL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BringmannDNS13,
author = {Karl Bringmann and
Benjamin Doerr and
Adrian Neumann and
Jakub Sliacan},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {Online checkpointing with improved worst-case guarantees},
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 = {23--26},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/BringmannDNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-7154,
author = {Karl Bringmann},
title = {Bringing Order to Special Cases of Klee's Measure Problem},
journal = {CoRR},
volume = {abs/1301.7154},
year = {2013},
url = {http://arxiv.org/abs/1301.7154},
eprinttype = {arXiv},
eprint = {1301.7154},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-7154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-4216,
author = {Karl Bringmann and
Benjamin Doerr and
Adrian Neumann and
Jakub Sliacan},
title = {Online Checkpointing with Improved Worst-Case Guarantees},
journal = {CoRR},
volume = {abs/1302.4216},
year = {2013},
url = {http://arxiv.org/abs/1302.4216},
eprinttype = {arXiv},
eprint = {1302.4216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-4216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannEMR13,
author = {Karl Bringmann and
Christian Engels and
Bodo Manthey and
B. V. Raghavendra Rao},
title = {Random Shortest Paths: Non-Euclidean Instances for Metric Optimization
Problems},
journal = {CoRR},
volume = {abs/1306.3030},
year = {2013},
url = {http://arxiv.org/abs/1306.3030},
eprinttype = {arXiv},
eprint = {1306.3030},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannEMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannSS013,
author = {Karl Bringmann and
Thomas Sauerwald and
Alexandre Stauffer and
He Sun},
title = {Balls into bins via local search: cover time and maximum load},
journal = {CoRR},
volume = {abs/1310.0801},
year = {2013},
url = {http://arxiv.org/abs/1310.0801},
eprinttype = {arXiv},
eprint = {1310.0801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannSS013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlvarezBR13,
author = {Victor Alvarez and
Karl Bringmann and
Saurabh Ray},
title = {A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations},
journal = {CoRR},
volume = {abs/1312.3188},
year = {2013},
url = {http://arxiv.org/abs/1312.3188},
eprinttype = {arXiv},
eprint = {1312.3188},
timestamp = {Fri, 23 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlvarezBR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlvarezBCR13,
author = {Victor Alvarez and
Karl Bringmann and
Radu Curticapean and
Saurabh Ray},
title = {Counting Triangulations and other Crossing-free Structures via Onion
Layers},
journal = {CoRR},
volume = {abs/1312.4628},
year = {2013},
url = {http://arxiv.org/abs/1312.4628},
eprinttype = {arXiv},
eprint = {1312.4628},
timestamp = {Fri, 23 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlvarezBCR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Bringmann12,
author = {Karl Bringmann},
title = {An improved algorithm for Klee's measure problem on fat boxes},
journal = {Comput. Geom.},
volume = {45},
number = {5-6},
pages = {225--233},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2011.12.001},
doi = {10.1016/J.COMGEO.2011.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Bringmann12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BringmannF12,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Approximating the least hypervolume contributor: NP-hard in general,
but fast in practice},
journal = {Theor. Comput. Sci.},
volume = {425},
pages = {104--116},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2010.09.026},
doi = {10.1016/J.TCS.2010.09.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BringmannF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AlvarezBCR12,
author = {Victor Alvarez and
Karl Bringmann and
Radu Curticapean and
Saurabh Ray},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Counting crossing-free structures},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {61--68},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261259},
doi = {10.1145/2261250.2261259},
timestamp = {Mon, 14 Jun 2021 16:50:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AlvarezBCR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/BringmannF12,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Terence Soule and
Jason H. Moore},
title = {Convergence of hypervolume-based archiving algorithms ii: competitiveness},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} '12, Philadelphia,
PA, USA, July 7-11, 2012},
pages = {457--464},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2330163.2330229},
doi = {10.1145/2330163.2330229},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/BringmannF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BringmannP12,
author = {Karl Bringmann and
Konstantinos Panagiotou},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Efficient Sampling Methods for Discrete Distributions},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {133--144},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_12},
doi = {10.1007/978-3-642-31594-7\_12},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BringmannP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2293,
author = {Karl Bringmann and
Kurt Mehlhorn and
Adrian Neumann},
title = {Remarks on Category-Based Routing in Social Networks},
journal = {CoRR},
volume = {abs/1202.2293},
year = {2012},
url = {http://arxiv.org/abs/1202.2293},
eprinttype = {arXiv},
eprint = {1202.2293},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2293.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foga/FriedrichBVI11,
author = {Tobias Friedrich and
Karl Bringmann and
Thomas Vo{\ss} and
Christian Igel},
editor = {Hans{-}Georg Beyer and
William B. Langdon},
title = {The logarithmic hypervolume indicator},
booktitle = {Foundations of Genetic Algorithms, 11th International Workshop, {FOGA}
2011, Schwarzenberg, Austria, January 5-8, 2011, Proceedings},
pages = {81--92},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1967654.1967662},
doi = {10.1145/1967654.1967662},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/foga/FriedrichBVI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/BringmannF11,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Natalio Krasnogor and
Pier Luca Lanzi},
title = {Convergence of hypervolume-based archiving algorithms {I:} effectiveness},
booktitle = {13th Annual Genetic and Evolutionary Computation Conference, {GECCO}
2011, Proceedings, Dublin, Ireland, July 12-16, 2011},
pages = {745--752},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2001576.2001678},
doi = {10.1145/2001576.2001678},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/BringmannF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BringmannFNW11,
author = {Karl Bringmann and
Tobias Friedrich and
Frank Neumann and
Markus Wagner},
editor = {Toby Walsh},
title = {Approximation-Guided Evolutionary Multi-Objective Optimization},
booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
2011},
pages = {1198--1203},
publisher = {{IJCAI/AAAI}},
year = {2011},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-204},
doi = {10.5591/978-1-57735-516-8/IJCAI11-204},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BringmannFNW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BringmannF10,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Approximating the volume of unions and intersections of high-dimensional
geometric objects},
journal = {Comput. Geom.},
volume = {43},
number = {6-7},
pages = {601--610},
year = {2010},
url = {https://doi.org/10.1016/j.comgeo.2010.03.004},
doi = {10.1016/J.COMGEO.2010.03.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BringmannF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ec/BringmannF10,
author = {Karl Bringmann and
Tobias Friedrich},
title = {An Efficient Algorithm for Computing Hypervolume Contributions},
journal = {Evol. Comput.},
volume = {18},
number = {3},
pages = {383--402},
year = {2010},
url = {https://doi.org/10.1162/EVCO\_a\_00012},
doi = {10.1162/EVCO\_A\_00012},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ec/BringmannF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Bringmann10,
author = {Karl Bringmann},
editor = {David G. Kirkpatrick and
Joseph S. B. Mitchell},
title = {Klee's measure problem on fat boxes in time {PARTIAL} {DIFFERENTIAL}
(\emph{n}\({}^{\mbox{(\emph{d}+2)/3}}\))},
booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
Snowbird, Utah, USA, June 13-16, 2010},
pages = {222--229},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810959.1810999},
doi = {10.1145/1810959.1810999},
timestamp = {Mon, 14 Jun 2021 16:25:04 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Bringmann10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/BringmannF10,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Martin Pelikan and
J{\"{u}}rgen Branke},
title = {The maximum hypervolume set yields near-optimal approximation},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2010, Proceedings,
Portland, Oregon, USA, July 7-11, 2010},
pages = {511--518},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1830483.1830576},
doi = {10.1145/1830483.1830576},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/BringmannF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/VossFBI10,
author = {Thomas Vo{\ss} and
Tobias Friedrich and
Karl Bringmann and
Christian Igel},
editor = {Martin Pelikan and
J{\"{u}}rgen Branke},
title = {Scaling up indicator-based MOEAs by approximating the least hypervolume
contributor: a preliminary study},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2010, Proceedings,
Portland, Oregon, USA, July 7-11, 2010, Companion Material},
pages = {1975--1978},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1830761.1830838},
doi = {10.1145/1830761.1830838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/VossFBI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/BringmannF10,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Robert Schaefer and
Carlos Cotta and
Joanna Kolodziej and
G{\"{u}}nter Rudolph},
title = {Tight Bounds for the Approximation Ratio of the Hypervolume Indicator},
booktitle = {Parallel Problem Solving from Nature - {PPSN} XI, 11th International
Conference, Krak{\'{o}}w, Poland, September 11-15, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6238},
pages = {607--616},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15844-5\_61},
doi = {10.1007/978-3-642-15844-5\_61},
timestamp = {Wed, 25 Sep 2019 18:08:28 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/BringmannF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/emo/BringmannF09,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Matthias Ehrgott and
Carlos M. Fonseca and
Xavier Gandibleux and
Jin{-}Kao Hao and
Marc Sevaux},
title = {Approximating the Least Hypervolume Contributor: NP-Hard in General,
But Fast in Practice},
booktitle = {Evolutionary Multi-Criterion Optimization, 5th International Conference,
{EMO} 2009, Nantes, France, April 7-10, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5467},
pages = {6--20},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-01020-0\_6},
doi = {10.1007/978-3-642-01020-0\_6},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/emo/BringmannF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foga/BringmannF09,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Ivan I. Garibay and
Thomas Jansen and
R. Paul Wiegand and
Annie S. Wu},
title = {Don't be greedy when calculating hypervolume contributions},
booktitle = {Foundations of Genetic Algorithms, 10th {ACM} {SIGEVO} International
Workshop, {FOGA} 2009, Orlando, Forida, USA, January 9-11, 2009, Proceedings},
pages = {103--112},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1527125.1527139},
doi = {10.1145/1527125.1527139},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/foga/BringmannF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BringmannF08,
author = {Karl Bringmann and
Tobias Friedrich},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Approximating the Volume of Unions and Intersections of High-Dimensional
Geometric Objects},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {436--447},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_40},
doi = {10.1007/978-3-540-92182-0\_40},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BringmannF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-0835,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Approximating the volume of unions and intersections of high-dimensional
geometric objects},
journal = {CoRR},
volume = {abs/0809.0835},
year = {2008},
url = {http://arxiv.org/abs/0809.0835},
eprinttype = {arXiv},
eprint = {0809.0835},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-0835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-2636,
author = {Karl Bringmann and
Tobias Friedrich},
title = {Approximating the least hypervolume contributor: NP-hard in general,
but fast in practice},
journal = {CoRR},
volume = {abs/0812.2636},
year = {2008},
url = {http://arxiv.org/abs/0812.2636},
eprinttype = {arXiv},
eprint = {0812.2636},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-2636.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-04-07 22:29 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:
