Spremljaj
Karl Bringmann
Karl Bringmann
Professor in Computer Science, Saarland University
Preverjeni e-poštni naslov na cs.uni-saarland.de - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
3072014
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
3052015
Approximating the volume of unions and intersections of high-dimensional geometric objects
K Bringmann, T Friedrich
Computational Geometry 43 (6-7), 601-610, 2010
2092010
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
K Bringmann, T Friedrich
Theoretical Computer Science 425, 104-116, 2012
1782012
Geometric inhomogeneous random graphs
K Bringmann, R Keusch, J Lengler
Theoretical Computer Science 760, 35-54, 2019
1602019
A near-linear pseudopolynomial time algorithm for subset sum
K Bringmann
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
1282017
Approximation-guided evolutionary multi-objective optimization
K Bringmann, T Friedrich, F Neumann, M Wagner
IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011
1122011
An efficient algorithm for computing hypervolume contributions
K Bringmann, T Friedrich
Evolutionary Computation 18 (3), 383-402, 2010
1092010
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
1032022
Approximability of the discrete Fréchet distance
K Bringmann, W Mulzer
Journal of Computational Geometry 7 (2), 46–76-46–76, 2016
992016
Approximation quality of the hypervolume indicator
K Bringmann, T Friedrich
Artificial Intelligence 195, 265-290, 2013
972013
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
932019
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
852014
Efficient sampling methods for discrete distributions
K Bringmann, K Panagiotou
Algorithmica 79, 484-508, 2017
83*2017
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
822018
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
812020
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
662017
Don't be greedy when calculating hypervolume contributions
K Bringmann, T Friedrich
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic …, 2009
582009
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
572019
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
572016
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20