From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The k-Fréchet Distance: How to Walk Your Dog While Teleporting.

H. Akitaya, M. Buchin, L. Ryvkin, и J. Urhausen. ISAAC, том 149 из LIPIcs, стр. 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Maike Buchin

Hans-Werner Maike

Boyd Buchin

Kevin Buchin

Björn Buchin

Другие публикации лиц с тем же именем

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter TractabilityK. Buchin, M. Buchin, J. Byrka, M. Nöllenburg, Y. Okamoto, R. Silveira, и A. Wolff. Arxiv report, (июня 2008)Available at http://arxiv.org/abs/0806.0920.Improved Map Construction using Subtrajectory Clustering.K. Buchin, M. Buchin, J. Gudmundsson, J. Hendriks, E. Sereshgi, V. Sacristán, R. Silveira, J. Sleijster, F. Staals, и C. Wenk. LocalRec@SIGSPATIAL, стр. 5:1-5:4. ACM, (2020)Distance Measures for Embedded Graphs.H. Akitaya, M. Buchin, B. Kilgus, S. Sijben, и C. Wenk. ISAAC, том 149 из LIPIcs, стр. 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)10491 Results of the break-out group: Gulls Data.E. van Loon, J. Sack, K. Buchin, M. Buchin, M. de Berg, M. van Kreveld, J. Gudmundsson, и D. Mountain. Representation, Analysis and Visualization of Moving Objects, том 10491 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Approximating Length-Restricted Means Under Dynamic Time Warping.M. Buchin, A. Driemel, K. van Greevenbroek, I. Psarros, и D. Rohde. WAOA, том 13538 из Lecture Notes in Computer Science, стр. 225-253. Springer, (2022)Anonymous Routing Using Minimum Capacity Clustering (Short Paper).M. Buchin, и L. Plätz. GIScience, том 277 из LIPIcs, стр. 18:1-18:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Realizability of Free Spaces of Curves.H. Akitaya, M. Buchin, M. Mirzanezhad, L. Ryvkin, и C. Wenk. ISAAC, том 283 из LIPIcs, стр. 3:1-3:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic L-Budget Clustering of Curves.K. Buchin, M. Buchin, J. Gudmundsson, L. Plätz, L. Thiel, и S. Wong. SWAT, том 294 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The k-Fréchet distance.H. Akitaya, M. Buchin, L. Ryvkin, и J. Urhausen. CoRR, (2019)Locally Correct Fréchet Matchings.K. Buchin, M. Buchin, W. Meulemans, и B. Speckmann. ESA, том 7501 из Lecture Notes in Computer Science, стр. 229-240. Springer, (2012)

BibSonomy

Disambiguation