Följ
Karl Bringmann
Karl Bringmann
Professor in Computer Science, Saarland University
Verifierad e-postadress på cs.uni-saarland.de - Startsida
Titel
Citeras av
Citeras av
År
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
2592014
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
2462015
Approximating the volume of unions and intersections of high-dimensional geometric objects
K Bringmann, T Friedrich
Computational Geometry 43 (6-7), 601-610, 2010
1902010
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
International Conference on Evolutionary Multi-Criterion Optimization, 6-20, 2009
1632009
Geometric inhomogeneous random graphs
K Bringmann, R Keusch, J Lengler
Theoretical Computer Science 760, 35-54, 2019
1012019
Approximation-guided evolutionary multi-objective optimization
K Bringmann, T Friedrich, F Neumann, M Wagner
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
1002011
An efficient algorithm for computing hypervolume contributions
K Bringmann, T Friedrich
Evolutionary Computation 18 (3), 383-402, 2010
992010
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
International Conference on Evolutionary Multi-Criterion Optimization, 6-20, 2009
972009
A near-linear pseudopolynomial time algorithm for subset sum
K Bringmann
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
792017
Approximation quality of the hypervolume indicator
K Bringmann, T Friedrich
Artificial Intelligence 195, 265-290, 2013
772013
Approximability of the discrete Fréchet distance
K Bringmann, W Mulzer
Journal of Computational Geometry 7 (2), 46–76-46–76, 2016
752016
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
752014
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
632022
Efficient sampling methods for discrete distributions
K Bringmann, K Panagiotou
International colloquium on automata, languages, and programming, 133-144, 2012
60*2012
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
592018
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
582019
Don't be greedy when calculating hypervolume contributions
K Bringmann, T Friedrich
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic …, 2009
532009
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
522017
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
482020
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
472019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20