| 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 | 308 | 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 | 305 | 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 | 209 | 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 | 179 | 2012 |
| Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019 | 160 | 2019 |
| A near-linear pseudopolynomial time algorithm for subset sum K Bringmann Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 128 | 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 | 109 | 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 | 103 | 2022 |
| Approximability of the discrete Fréchet distance K Bringmann, W Mulzer Journal of Computational Geometry 7 (2), 46–76-46–76, 2016 | 99 | 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 | 93 | 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 | 85 | 2014 |
| 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 | 82 | 2018 |
| 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 | 81 | 2020 |
| 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 | 66 | 2017 |
| 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 |
| 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 | 57 | 2016 |
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyOverená e-mailová adresa na: hpi.de
