Maike Buchin

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 7788498 (Why is no real title available?)2024-01-15Paper
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
ACM Transactions on Algorithms
2023-10-23Paper
Approximating length-restricted means under dynamic time warping
Approximation and Online Algorithms
2023-07-25Paper
Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
Algorithms and Discrete Applied Mathematics
2023-05-08Paper
Distances between immersed graphs: metric properties
La Matematica
2023-03-29Paper
Shape decomposition algorithms for laser capture microdissection2023-02-07Paper
Distance Measures for Embedded Graphs
(available as arXiv preprint)
2023-02-03Paper
scientific article; zbMATH DE number 7650283 (Why is no real title available?)2023-02-03Paper
Fréchet distance between two point sets
Computational Geometry
2022-01-03Paper
Distance measures for embedded graphs
Computational Geometry
2021-09-16Paper
Distance measures for embedded graphs
Computational Geometry
2021-09-16Paper
Middle curves based on discrete Fréchet distance
Computational Geometry
2020-10-23Paper
Four Soviets walk the dog -- with an application to Alt's conjecture
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
scientific article; zbMATH DE number 7051233 (Why is no real title available?)2019-05-06Paper
Locally correct Fréchet matchings
Computational Geometry
2018-11-16Paper
Compact flow diagrams for state sequences
ACM Journal of Experimental Algorithmics
2018-08-06Paper
Model-based segmentation and classification of trajectories
Algorithmica
2018-07-25Paper
Computing the Fréchet distance with shortcuts is NP-hard
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
Four Soviets walk the dog: improved bounds for computing the Fréchet distance
Discrete & Computational Geometry
2017-10-10Paper
Trajectory grouping structure2017-03-30Paper
Computing the Fréchet distance with a retractable leash
Discrete & Computational Geometry
2016-09-14Paper
A middle curve based on discrete Fréchet distance
LATIN 2016: Theoretical Informatics
2016-05-03Paper
Model-based classification of trajectories
Algorithms and Computation
2016-01-11Paper
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry
2014-01-22Paper
Computing the Fréchet distance with a retractable leash
Lecture Notes in Computer Science
2013-09-17Paper
Trajectory grouping structure
Lecture Notes in Computer Science
2013-08-12Paper
Memory-constrained algorithms for simple polygons
Computational Geometry
2013-07-31Paper
Memory-constrained algorithms for simple polygons
Computational Geometry
2013-07-31Paper
Median trajectories
Algorithmica
2013-06-25Paper
Locally correct Fréchet matchings
Lecture Notes in Computer Science
2012-09-25Paper
Drawing (complete) binary tanglegrams
Algorithmica
2012-04-26Paper
Finding long and similar parts of trajectories
Computational Geometry
2011-12-28Paper
Detecting commuting patterns by clustering subtrajectories
International Journal of Computational Geometry & Applications
2011-08-23Paper
Voronoi diagram of polygonal chains under the discrete Fréchet distance
International Journal of Computational Geometry & Applications
2010-09-30Paper
Fréchet distance of surfaces: some simple hard cases
Algorithms – ESA 2010
2010-09-06Paper
Median trajectories
Algorithms – ESA 2010
2010-09-06Paper
Can we compute the similarity between surfaces?
Discrete & Computational Geometry
2010-02-23Paper
Connect the Dot: Computing Feed-Links with Minimum Dilation
Lecture Notes in Computer Science
2009-10-20Paper
Polychromatic colorings of plane graphs
Discrete & Computational Geometry
2009-08-27Paper
Drawing (Complete) Binary Tanglegrams
Graph Drawing
2009-03-03Paper
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
2009-02-12Paper
scientific article; zbMATH DE number 5506195 (Why is no real title available?)2009-02-10Paper
Detecting Commuting Patterns by Clustering Subtrajectories
Algorithms and Computation
2009-01-29Paper
Computing the Fréchet distance between simple polygons
Computational Geometry
2008-07-29Paper
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Lecture Notes in Computer Science
2008-07-10Paper


Research outcomes over time


This page was built for person: Maike Buchin