Karl Bringmann

Cited by

	All	Since 2018
Citations	3257	2213
h-index	32	26
i10-index	67	52

500

250

125

375

20092010201120122013201420152016201720182019202020212022202319 42 56 58 104 128 181 198 230 303 388 385 495 491 148

Public access

View all

35 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Marvin KünnemannPostdoc at Max Planck Institute for Informatics, Saarbrücken, GermanyVerified email at mpi-inf.mpg.de
Amir AbboudWeizmann Institute of ScienceVerified email at weizmann.ac.il
André NusserMax Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
Arturs BackursMicrosoft ResearchVerified email at microsoft.com
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityVerified email at cs.au.dk
Pavel KolevPh.D. Student, Max-Planck-Institut für InformatikVerified email at mpi-inf.mpg.de
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Radu CurticapeanIT University of Copenhagen, Basic Algorithms Research CopenhagenVerified email at itu.dk
Yannic MausTU GrazVerified email at ist.tugraz.at
Anisur Rahaman MollaIndian Statistical Institute, KolkataVerified email at isical.ac.in
Thore HusfeldtIT University of Copenhagen and Lund UniversityVerified email at itu.dk
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Barna SahaUniversity of California San DiegoVerified email at ucsd.edu
Virginia Vassilevska WilliamsMITVerified email at mit.edu
Bhaskar Ray ChaudhuryUniversity of Illinois at Urbana ChampaignVerified email at illinois.edu
Oren WeimannUniversity of HaifaVerified email at cs.haifa.ac.il
Paweł GawrychowskiUniversity of WrocławVerified email at cs.uni.wroc.pl
shay mozesReichman University (formerly IDC Herzliya)Verified email at runi.ac.il
Jesper NederlofUtrecht UniversityVerified email at uu.nl

Karl Bringmann

Professor in Computer Science, Saarland University

Verified email at cs.uni-saarland.de - Homepage

Algorithms and Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails K Bringmann 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 661-670, 2014	265	2014
Quadratic conditional lower bounds for string problems and dynamic time warping K Bringmann, M Künnemann 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 79-97, 2015	249	2015
Approximating the volume of unions and intersections of high-dimensional geometric objects K Bringmann, T Friedrich Computational Geometry 43 (6-7), 601-610, 2010	195	2010
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice K Bringmann, T Friedrich Theoretical Computer Science 425, 104-116, 2012	168	2012
Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019	111	2019
An efficient algorithm for computing hypervolume contributions K Bringmann, T Friedrich Evolutionary Computation 18 (3), 383-402, 2010	100	2010
Approximation-guided evolutionary multi-objective optimization K Bringmann, T Friedrich, F Neumann, M Wagner IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011	99	2011
A near-linear pseudopolynomial time algorithm for subset sum K Bringmann Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	82	2017
Approximability of the discrete Fréchet distance K Bringmann, W Mulzer Journal of Computational Geometry 7 (2), 46–76-46–76, 2016	80	2016
Approximation quality of the hypervolume indicator K Bringmann, T Friedrich Artificial Intelligence 195, 265-290, 2013	80	2013
Two-dimensional subset selection for hypervolume and epsilon-indicator K Bringmann, T Friedrich, P Klitzke Proceedings of the 2014 Annual Conference on Genetic and Evolutionary …, 2014	74	2014
SETH-based lower bounds for subset sum and bicriteria path A Abboud, K Bringmann, D Hermelin, D Shabtay ACM Transactions on Algorithms (TALG) 18 (1), 1-22, 2022	69	2022
Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product K Bringmann, F Grandoni, B Saha, VV Williams SIAM Journal on Computing 48 (2), 481-512, 2019	67	2019
Multivariate fine-grained complexity of longest common subsequence K Bringman, M Künnemann Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	60	2018
Efficient sampling methods for discrete distributions K Bringmann, K Panagiotou Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012	60*	2012
Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) K Bringmann, P Gawrychowski, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020	57	2020
Don't be greedy when calculating hypervolume contributions K Bringmann, T Friedrich Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic …, 2009	55	2009
A dichotomy for regular expression membership testing K Bringmann, A Grønlund, KG Larsen 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	53	2017
Sampling geometric inhomogeneous random graphs in linear time K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1511.00576, 2015	47	2015
A PTAS for ℓ_p-Low Rank Approximation F Ban, V Bhattiprolu, K Bringmann, P Kolev, E Lee, DP Woodruff Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	45	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors