Maike Buchin | Academic Influence

Maike Buchin's AcademicInfluence.com Rankings

Maike Buchin

Computer Science

#10502

World Rank

#11033

Historical Rank

Machine Learning

#5762

World Rank

#5844

Historical Rank

Artificial Intelligence

#6215

World Rank

#6318

Historical Rank

Database

#9622

World Rank

#10160

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Maike Buchin's Degrees

PhD Computer Science Technical University of Munich
Masters Computer Science Technical University of Munich
Bachelors Computer Science Technical University of Munich

Similar Degrees You Can Earn

Why Is Maike Buchin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Maike Buchin is a German computer scientist specializing in computational geometry, and in particular on the analysis of similarities and clustering of geometric trajectory data. She is a professor at Ruhr University Bochum, and head of the chair in theoretical computer science there.

(See a Problem?)

Maike Buchin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Detecting Commuting Patterns by Clustering Subtrajectories (2008) (178)
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria (2011) (111)
Exact algorithms for partial curve matching via the Fréchet distance (2009) (96)
Finding long and similar parts of trajectories (2009) (83)
Analysis of movement data (2016) (78)
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria (2010) (73)
Median Trajectories (2010) (68)
Four Soviets Walk the Dog - with an Application to Alt's Conjecture (2012) (62)
Constrained free space diagrams: a tool for trajectory analysis (2010) (59)
Computing the Fréchet distance between simple polygons (2008) (58)
Can We Compute the Similarity between Surfaces? (2007) (57)
Similarity of trajectories taking into account geographic context (2014) (52)
Context-Aware Similarity of Trajectories (2012) (50)
Trajectory grouping structure (2013) (47)
Computing the Fréchet distance between simple polygons in polynomial time (2006) (47)
Detecting single file movement (2008) (46)
On the Computability of the Frechet Distance Between Triangulated Surfaces (2007) (45)
How Difficult is it to Walk the Dog ? (2007) (39)
Real-Time Expressive Rendering of City Models (2003) (37)
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance (2012) (37)
Memory-constrained algorithms for simple polygons (2011) (36)
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability (2008) (36)
Computing the Fréchet distance with shortcuts is NP-hard (2013) (35)
A framework for trajectory segmentation by stable criteria (2014) (33)
Visual analytics of delays and interaction in movement data (2017) (31)
Polychromatic Colorings of Plane Graphs (2008) (31)
Segmenting Trajectories by Movement States (2013) (28)
Fréchet Distance of Surfaces: Some Simple Hard Cases (2010) (28)
Moving beyond the point: An agenda for research in movement analysis with real data (2014) (28)
Clustering Trajectories for Map Construction (2017) (28)
Drawing (Complete) Binary Tanglegrams (2008) (24)
Reprint of: Memory-constrained algorithms for simple polygons (2014) (23)
Computing the Fréchet Distance with a Retractable Leash (2013) (23)
Trajectory Box Plot: a new pattern to summarize movements (2016) (23)
Locally Correct Frechet Matchings (2012) (22)
Semi-computability of the Fréchet distance between surfaces (2005) (18)
Model-Based Segmentation and Classification of Trajectories (2018) (15)
On Rolling Cube Puzzles (2007) (15)
Connect the dot: Computing feed-links for network extension (2011) (14)
Group Diagrams for Representing Trajectories (2018) (14)
Rolling Block Mazes are PSPACE-complete (2012) (13)
Fine-Grained Analysis of Problems on Curves (2016) (13)
Trajectory Grouping Structures (2013) (12)
Processing aggregated data: the location of clusters in health data (2012) (10)
Topology Control (2007) (9)
Computing similarity of coarse and irregular trajectories using space-time prisms (2013) (8)
Approximating $(k,\ell)$-Median Clustering for Polygonal Curves (2020) (8)
Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard (2005) (8)
The k-Fréchet distance of polygonal curves (2018) (7)
Improved Map Construction using Subtrajectory Clustering (2020) (7)
Distance Measures for Embedded Graphs (2018) (7)
A Middle Curve Based on Discrete Fréchet Distance (2016) (7)
Approximating (k,ℓ)-Median Clustering for Polygonal Curves (2020) (5)
Discrete Fréchet Distance for Uncertain Points (2016) (5)
Clusters in Aggregated Health Data (2008) (5)
Shape decomposition algorithms for laser capture microdissection (2021) (5)
Connect the Dot: Computing Feed-Links with Minimum Dilation (2009) (4)
Trajectory Grouping Structure: the Video (2014) (4)
Real-time per-pixel rendering with stroke textures (2003) (4)
The k-Fréchet distance (2019) (4)
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance (2007) (4)
A polynomial-time partitioning algorithm for weighted cactus graphs (2020) (3)
The k-Fréchet Distance: How to Walk Your Dog While Teleporting (2019) (3)
Compact Flow Diagrams for State Sequences (2016) (3)
Middle curves based on discrete Fréchet distance (2020) (3)
Analyzing delays in trajectories (2015) (3)
Feed-links for network extensions (2008) (3)
Inferring movement patterns from geometric similarity (2020) (3)
Coresets for (k, 𝓁)-Median Clustering under the Fréchet Distance (2021) (3)
Improved space bounds for Fréchet distance queries (2020) (3)
Efficient Fréchet distance queries for segments (2022) (2)
Approximating Length-Restricted Means under Dynamic Time Warping (2021) (2)
The k-Fréchet distance revisited and extended (2019) (2)
Computing the Fréchet distance of trees and graphs of bounded tree width (2020) (2)
Partitioning algorithms for weighted cactus graphs (2020) (2)
10491 Results of the break-out group: Gulls Data (2010) (2)
Distances Between Immersed Graphs: Metric Properties (2023) (1)
Drawing Binary Tanglegrams : Hardness , Approximation , Fixed-Parameter Tractability ? (2008) (1)
GRAPH SAMPLING FOR MAP COMPARISON (2021) (1)
Fréchet Distance Between Two Point Sets (2021) (1)
Shape decomposition algorithms for laser capture microdissection (2021) (1)
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062) (2022) (1)
Distance Measures for Embedded Graphs-Optimal Graph Mappings (2020) (1)
Decomposing Polygons into Fat Components (2021) (1)
The $k$-Fr\'echet distance (2019) (1)
On the complexity of the middle curve problem (2020) (1)
Interaction and Collective Movement Processing (Dagstuhl Seminar 14132) (2014) (1)
Model-Based Classification of Trajectories (2015) (1)
Drawing (Complete) Binary Tanglegrams (2010) (1)
Rolling Block Mazes are PSPACE-complete K evin B uchin (2012) (0)
Computing the Fréchet Distance with a Retractable Leash (2016) (0)
Algorithms for Context-Aware Trajectory Analysis (2011) (0)
Model-based segmentation and classification of trajectories (Extended abstract) (2014) (0)
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance (2017) (0)
10491 Results of the break-out group: Aggregation (2010) (0)
2012 Reviewers List (2013) (0)
Computing the cut distance of two curves∗ (2018) (0)
Finding a minimum stretch of a function (2009) (0)
Decomposition Algorithms for the Dissection of Tissue Samples (2021) (0)
The k-outlier Fr\'echet distance (2022) (0)
VAST Paper Reviewers (2019) (0)
Model-Based Segmentation and Classification of Trajectories (2017) (0)
Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance (2007) (0)
Median Trajectories (2012) (0)
Partitioning algorithms for weighted trees and cactus graphs (2020) (0)
Model-Based Segmentation and Classification of Gull Trajectories (2016) (0)
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
The k-outlier Fréchet distance (2022) (0)

This paper list is powered by the following services:

Other Resources About Maike Buchin

en.wikipedia.org

What Schools Are Affiliated With Maike Buchin?

Maike Buchin is affiliated with the following schools: