Maike Buchin

From MaRDI portal
Revision as of 10:51, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:312138

Available identifiers

zbMath Open buchin.maikeMaRDI QIDQ312138

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61474182024-01-15Paper
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves2023-10-23Paper
Approximating length-restricted means under dynamic time warping2023-07-25Paper
Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance2023-05-08Paper
Distances between immersed graphs: metric properties2023-03-29Paper
Shape decomposition algorithms for laser capture microdissection2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58756162023-02-03Paper
Distance Measures for Embedded Graphs2023-02-03Paper
Fréchet distance between two point sets2022-01-03Paper
Distance measures for embedded graphs2021-09-16Paper
Middle curves based on discrete Fréchet distance2020-10-23Paper
Four Soviets Walk the Dog—with an Application to Alt's Conjecture2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q46338762019-05-06Paper
Locally correct Fréchet matchings2018-11-16Paper
Compact Flow Diagrams for State Sequences2018-08-06Paper
Model-based segmentation and classification of trajectories2018-07-25Paper
Computing the Fréchet distance with shortcuts is NP-hard2018-04-23Paper
Four Soviets walk the dog: improved bounds for computing the Fréchet distance2017-10-10Paper
Trajectory grouping structure2017-03-30Paper
Computing the Fréchet distance with a retractable leash2016-09-14Paper
A Middle Curve Based on Discrete Fréchet Distance2016-05-03Paper
Model-Based Classification of Trajectories2016-01-11Paper
Reprint of: Memory-constrained algorithms for simple polygons2014-01-22Paper
Computing the Fréchet Distance with a Retractable Leash2013-09-17Paper
Trajectory Grouping Structure2013-08-12Paper
Memory-constrained algorithms for simple polygons2013-07-31Paper
Median trajectories2013-06-25Paper
Locally correct Fréchet matchings2012-09-25Paper
Drawing (complete) binary tanglegrams2012-04-26Paper
Finding long and similar parts of trajectories2011-12-28Paper
DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES2011-08-23Paper
VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE2010-09-30Paper
Fréchet Distance of Surfaces: Some Simple Hard Cases2010-09-06Paper
Median Trajectories2010-09-06Paper
Can we compute the similarity between surfaces?2010-02-23Paper
Connect the Dot: Computing Feed-Links with Minimum Dilation2009-10-20Paper
Polychromatic colorings of plane graphs2009-08-27Paper
Drawing (Complete) Binary Tanglegrams2009-03-03Paper
Polychromatic colorings of plane graphs2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015252009-02-10Paper
Detecting Commuting Patterns by Clustering Subtrajectories2009-01-29Paper
Computing the Fréchet distance between simple polygons2008-07-29Paper
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance2008-07-10Paper

Research outcomes over time

This page was built for person: Maike Buchin