Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability.

K. Bringmann, M. Künnemann, and A. Nusser. CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dipl.-Ing. Karl Kübler

Approach for manufacturer independent automated machine tool control software testK. Kübler, A. Neyrinck, J. Schlechtendahl, A. Lechler, and A. Verl. Progress in production engineering; selected, peer reviewed papers from the 2015 WGP Congress, September 7 - 8, 2015, Hamburg, Germany, 794, page 347-354. Pfaffikon, Trans Tech Publ., (2015)

Dr. rer. nat. Philipp Karl University of Stuttgart

Kristian Karlovic

Prof. iR Dr. Karl Bredereck University of Stuttgart

Univ. -Prof. a. D. Dr. -Ing. Karl Stephan University of Stuttgart

Other publications of authors with the same name

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.K. Bringmann, C. Engels, B. Manthey, and B. Rao. Algorithmica, 73 (1): 42-62 (2015)A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum.K. Bringmann. CoRR, (2016)A fast implementation of near neighbors queries for Fréchet distance (GIS Cup).J. Baldus, and K. Bringmann. CoRR, (2018)De-anonymization of Heterogeneous Random Graphs in Quasilinear Time.K. Bringmann, T. Friedrich, and A. Krohmer. Algorithmica, 80 (11): 3397-3427 (2018)Speeding up many-objective optimization by Monte Carlo approximations.K. Bringmann, T. Friedrich, C. Igel, and T. Voß. Artif. Intell., (2013)Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product.K. Bringmann, F. Grandoni, B. Saha, and V. Williams. FOCS, page 375-384. IEEE, (2016)Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator.K. Bringmann, T. Friedrich, and P. Klitzke. PPSN, volume 8672 of Lecture Notes in Computer Science, page 518-527. Springer, (2014)Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems.K. Bringmann, C. Engels, B. Manthey, and B. Rao. MFCS, volume 8087 of Lecture Notes in Computer Science, page 219-230. Springer, (2013)Approximability of the discrete Fréchet distance.K. Bringmann, and W. Mulzer. JoCG, 7 (2): 46-76 (2016)De-anonymization of Heterogeneous Random Graphs in Quasilinear Time.K. Bringmann, T. Friedrich, and A. Krohmer. ESA, volume 8737 of Lecture Notes in Computer Science, page 197-208. Springer, (2014)