Karl Bringmann

Citée par

	Toutes	Depuis 2020
Citations	4477	2693
indice h	36	29
indice i10	97	78

700

350

175

525

2009201020112012201320142015201620172018201920202021202220232024202518 42 60 56 104 127 207 195 232 308 402 387 482 448 524 700 140

Accès public

Tout afficher

48 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyAdresse e-mail validée de hpi.de
Marvin KünnemannKarlsruhe Institute of TechnologyAdresse e-mail validée de kit.edu
Nick FischerPostdoc, Weizmann Institute of ScienceAdresse e-mail validée de weizmann.ac.il
Amir AbboudWeizmann Institute of ScienceAdresse e-mail validée de weizmann.ac.il
Johannes LenglerETH ZürichAdresse e-mail validée de inf.ethz.ch
André NusserUniversity of CopenhagenAdresse e-mail validée de mpi-inf.mpg.de
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityAdresse e-mail validée de cs.au.dk
Arturs BackursMicrosoft ResearchAdresse e-mail validée de microsoft.com
Pavel KolevPostdoc, University of TübingenAdresse e-mail validée de uni-tuebingen.de
Eva RotenbergAssociate Professor, DTU Compute, DenmarkAdresse e-mail validée de dtu.dk
Bhaskar Ray ChaudhuryAssistant Professor at University of Illinois at Urbana ChampaignAdresse e-mail validée de illinois.edu
Sándor Kisfaludi-BakAalto UniversityAdresse e-mail validée de aalto.fi
Erik Jan van LeeuwenUtrecht University, The NetherlandsAdresse e-mail validée de uu.nl
Tomasz KociumakaINSAITAdresse e-mail validée de insait.ai
Vasileios NakosRelational AI
Danny HermelinBen-Gurion University of the Negev

Suivre

Karl Bringmann

Professor in Computer Science, Saarland University

Adresse e-mail validée de cs.uni-saarland.de - Page d'accueil

Algorithms and Complexity


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	312	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	308	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	211	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	182	2012
Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019	164	2019
A near-linear pseudopolynomial time algorithm for subset sum K Bringmann Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	133	2017
Approximation-guided evolutionary multi-objective optimization K Bringmann, T Friedrich, F Neumann, M Wagner IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011	112	2011
An efficient algorithm for computing hypervolume contributions K Bringmann, T Friedrich Evolutionary Computation 18 (3), 383-402, 2010	110	2010
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	106	2022
Approximability of the discrete Fréchet distance K Bringmann, W Mulzer Journal of Computational Geometry 7 (2), 46–76-46–76, 2016	100	2016
Approximation quality of the hypervolume indicator K Bringmann, T Friedrich Artificial Intelligence 195, 265-290, 2013	97	2013
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	94	2019
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	87	2014
Efficient sampling methods for discrete distributions K Bringmann, K Panagiotou Algorithmica 79, 484-508, 2017	84*	2017
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	83	2020
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	83	2018
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	67	2017
Average distance in a general class of scale-free networks with underlying geometry K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1602.05712, 2016	59	2016
Don't be greedy when calculating hypervolume contributions K Bringmann, T Friedrich Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic …, 2009	58	2009
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	57	2019

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs