2025
Roadster: Improved algorithms for subtrajectory clustering and map construction.
Comput. Geosci., 2025
Pattern formation for fat robots with lights.
Comput. Geom., 2025
2024
L-Budget Clustering (SWAT 24).
Dataset, November, 2024
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.
ACM Trans. Algorithms, April, 2024
A well-separated pair decomposition for low density graphs.
CoRR, 2024
Approximating the Fréchet distance when only one curve is <i>c</i>-packed.
CoRR, 2024
Spanner for the 0/1/∞ weighted region problem.
CoRR, 2024
Dynamic L-Budget Clustering of Curves.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Approximating the Fréchet Distance When Only One Curve Is c-Packed.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Bicriteria Approximation for Minimum Dilation Graph Augmentation.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size.
Proceedings of the 40th International Symposium on Computational Geometry, 2024
Map-Matching Queries Under Fréchet Distance on Low-Density Spanners.
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Algorithms for radius-optimally augmenting trees in a metric space.
Comput. Geom., October, 2023
Augmenting graphs to minimize the radius.
Comput. Geom., August, 2023
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance.
ACM Trans. Spatial Algorithms Syst., June, 2023
Shortest Paths of Mutually Visible Robots.
CoRR, 2023
Pattern Formation for Fat Robots with Memory.
CoRR, 2023
Approximating the packedness of polygonal curves.
Comput. Geom., 2023
Partitioning Axis-Parallel Lines in 3D.
Comput. Geom. Topol., 2023
Approximating the Discrete Center Line Segment in Linear Time.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
The Mutual Visibility Problem for Fat Robots.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Shortest Beer Path Queries in Digraphs with Bounded Treewidth.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Computing a Subtrajectory Cluster from c-Packed Trajectories.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Approximating the λ-low-density Value.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
Covering a set of line segments with a few squares.
Theor. Comput. Sci., 2022
Improving the Dilation of a Metric Graph by Adding Edges.
ACM Trans. Algorithms, 2022
Local routing in a tree metric 1-spanner.
J. Comb. Optim., 2022
Approximating the lambda-low-density value.
CoRR, 2022
Local Routing in Sparse and Lightweight Geometric Graphs.
Algorithmica, 2022
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language.
Proceedings of the Database Systems for Advanced Applications, 2022
2021
A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories.
ACM Trans. Spatial Algorithms Syst., 2021
On β-Plurality Points in Spatial Voting Games.
ACM Trans. Algorithms, 2021
Bounded-degree light approximate shortest-path trees in doubling metrics.
Discret. Appl. Math., 2021
Translation Invariant Fréchet Distance Queries.
Algorithmica, 2021
Augmenting Graphs to Minimize the Radius.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
2020
On beta-Plurality Points in Spatial Voting Games.
CoRR, 2020
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword.
Comput. Geom., 2020
Improved Map Construction using Subtrajectory Clustering.
Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020
2019
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.
Int. J. Found. Comput. Sci., 2019
Fast Fréchet Distance Between Curves with Long Edges.
Int. J. Comput. Geom. Appl., 2019
Shortcuts for the circle.
Comput. Geom., 2019
Turbocharging Treewidth Heuristics.
Algorithmica, 2019
Approximating (k, ℓ)-center clustering for curves.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Networking Self-Organising Maps and Similarity Weight Associations.
Proceedings of the Neural Information Processing - 26th International Conference, 2019
Computing the Yolk in Spatial Voting Games without Computing Median Lines.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
Faster Algorithms for Computing Plurality Points.
ACM Trans. Algorithms, 2018
Approximating (k, 𝓁)-center clustering for curves.
CoRR, 2018
Finding Pairwise Intersections Inside a Query Range.
Algorithmica, 2018
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Algorithmica, 2018
When is Red-Blue Nonblocker Fixed-Parameter Tractable?
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Theoretical analysis of beaconless geocast protocols in 1D.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018
Dilation and Detours in Geometric Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Movement Patterns in Spatio-Temporal Data.
Proceedings of the Encyclopedia of GIS., 2017
Classification of Passes in Football Matches Using Spatiotemporal Data.
ACM Trans. Spatial Algorithms Syst., 2017
Compact Flow Diagrams for State Sequences.
ACM J. Exp. Algorithmics, 2017
Spatio-Temporal Analysis of Team Sports.
ACM Comput. Surv., 2017
A Visual Measure of Changes to Weighted Self-Organizing Map Patterns.
CoRR, 2017
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns.
Proceedings of the Neural Information Processing - 24th International Conference, 2017
A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017
Barrier Coverage with Uniform Radii in 2D.
Proceedings of the Algorithms for Sensor Systems, 2017
2016
Planar Geometric Spanners.
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
Applications of Geometric Spanner Networks.
Encyclopedia of Algorithms, 2016
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.
J. Graph Theory, 2016
Editorial, SEA 2014 Special Issue.
ACM J. Exp. Algorithmics, 2016
Spatio-Temporal Analysis of Team Sports - A Survey.
CoRR, 2016
2015
A GPU Approach to Subtrajectory Clustering Using the Fréchet Distance.
IEEE Trans. Parallel Distributed Syst., 2015
Increasing-Chord Graphs On Point Sets.
J. Graph Algorithms Appl., 2015
Fast algorithms for approximate Fréchet matching queries in geometric trees.
Comput. Geom., 2015
Augmenting Graphs to Minimize the Diameter.
Algorithmica, 2015
Automated Classification of Passing in Football.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015
Welfare Maximization in Fractional Hedonic Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Fast Algorithms for Diameter-Optimally Augmenting Paths.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Analyzing delays in trajectories.
Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015
2014
Football analysis using spatio-temporal tools.
Comput. Environ. Urban Syst., 2014
On the number of upward planar orientations of maximal planar graphs.
Theor. Comput. Sci., 2014
A fast algorithm for data collection along a fixed track.
Theor. Comput. Sci., 2014
Quickest path queries on transportation network.
Comput. Geom., 2014
Editorial: COCOON 2012 Special Issue.
Algorithmica, 2014
A Generalization of the Convex Kakeya Problem.
Algorithmica, 2014
Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014
2013
Fast query structures in anisotropic media.
Theor. Comput. Sci., 2013
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Algorithms for hotspot computation on trajectory data.
Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013
Fréchet Queries in Geometric Trees.
Proceedings of the Algorithms - ESA 2013, 2013
2012
Approximate one-to-one point pattern matching.
J. Discrete Algorithms, 2012
Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512).
Dagstuhl Reports, 2012
On graphs supporting greedy forwarding for directional wireless networks.
Proceedings of IEEE International Conference on Communications, 2012
Of motifs and goals: mining trajectory data.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012
Computational Movement Analysis.
Proceedings of the Die Dynamik sozialer und sprachlicher Netzwerke, 2012
2011
Detecting Commuting Patterns by Clustering Subtrajectories.
Int. J. Comput. Geom. Appl., 2011
Farthest-polygon Voronoi diagrams.
Comput. Geom., 2011
Notes on Large Angle Crossing Graphs.
Chic. J. Theor. Comput. Sci., 2011
Algorithms for Marketing-Mix Optimization.
Algorithmica, 2011
Detecting Regular Visit Patterns.
Algorithmica, 2011
Geometric Spanners for Weighted Point Sets.
Algorithmica, 2011
Quickest Paths in Anisotropic Media.
Proceedings of the Combinatorial Optimization and Applications, 2011
Shortest Path in Transportation Network and Weighted Subdivisions.
Proceedings of the Graph Data Management: Techniques and Applications., 2011
2010
Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies.
J. Discrete Algorithms, 2010
Int. J. Comput. Geom. Appl., 2010
Constrained free space diagrams: a tool for trajectory analysis.
Int. J. Geogr. Inf. Sci., 2010
A simple and efficient kinetic spanner.
Comput. Geom., 2010
Editorial, SWAT 2008 Special Issue.
Algorithmica, 2010
10491 Results of the break-out group: Gulls Data.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010
10491 Results of the break-out group: Similarity measures.
Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010
Planar visibility: testing and counting.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Detecting Areas Visited Regularly.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
Experimental study of geometric <i>t</i>-spanners.
ACM J. Exp. Algorithmics, 2009
On Spanners of Geometric Graphs.
Int. J. Found. Comput. Sci., 2009
Int. J. Found. Comput. Sci., 2009
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Int. J. Comput. Geom. Appl., 2009
Restricted Mesh Simplification Using Edge Contractions.
Int. J. Comput. Geom. Appl., 2009
Region-Fault Tolerant Geometric Spanners.
Discret. Comput. Geom., 2009
On the Expected Maximum Degree of Gabriel and Yao Graphs
CoRR, 2009
Region-restricted clustering for geographic data mining.
Comput. Geom., 2009
Compressing spatio-temporal trajectories.
Comput. Geom., 2009
Measuring the Similarity of Geometric Graphs.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009
09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.
Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009
Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009
2008
Movement Patterns in Spatio-temporal Data.
Proceedings of the Encyclopedia of GIS., 2008
Planar Geometric Spanners.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Applications of Geometric Spanner Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Approximate distance oracles for geometric spanners.
ACM Trans. Algorithms, 2008
Improving the Stretch Factor of a Geometric Network by Edge Augmentation.
SIAM J. Comput., 2008
Reporting Leaders and Followers among Trajectories of Moving Point Objects.
GeoInformatica, 2008
Aperture-Angle and Hausdorff-Approximation of Convex Figures.
Discret. Comput. Geom., 2008
Reporting flock patterns.
Comput. Geom., 2008
Constructing minimum-interference networks.
Comput. Geom., 2008
Sparse geometric graphs with small dilation.
Comput. Geom., 2008
Detecting single file movement.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008
An ILP for the metro-line crossing problem.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008
2007
Dilation and Detours in Geometric Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Int. J. Found. Comput. Sci., 2007
Efficient Detection of Patterns in 2D Trajectories of Moving Points.
GeoInformatica, 2007
Distance-preserving approximations of polygonal paths.
Comput. Geom., 2007
Minimum weight pseudo-triangulations.
Comput. Geom., 2007
Approximate distance oracles for graphs with dense clusters.
Comput. Geom., 2007
Experimental Study of Geometric t-Spanners: A Running Time Comparison.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007
Reporting leadership patterns among trajectories.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007
Dimensionality reduction for long duration and complex spatio-temporal queries.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007
2006
Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006
Constructing Interference-Minimal Networks.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006
Computing longest duration flocks in trajectory data.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006
Path Simplification for Metro Map Layout.
Proceedings of the Graph Drawing, 14th International Symposium, 2006
Schematisation of Tree Drawings.
Proceedings of the Graph Drawing, 14th International Symposium, 2006
06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
Increasing the readability of graph drawings with centrality-based scaling.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006
2005
TSP with neighborhoods of varying size.
J. Algorithms, 2005
Constrained higher order Delaunay triangulations.
Comput. Geom., 2005
Chips on wafers, or packing rectangles into grids.
Comput. Geom., 2005
Constructing Plane Spanners of Bounded Degree and Low Weight.
Algorithmica, 2005
Fast Pruning of Geometric Spanners.
Proceedings of the STACS 2005, 2005
Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Finding the best shortcut in a geometric network.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
2004
Box-trees for collision checking in industrial installations.
Comput. Geom., 2004
Facility location and the geometric minimum-diameter spanning tree.
Comput. Geom., 2004
I/O-Efficiently Pruning Dense Spanners.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004
Efficient detection of motion patterns in spatio-temporal data sets.
Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners.
Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004
2003
Balanced Partition of Minimum Spanning Trees.
Int. J. Comput. Geom. Appl., 2003
On R-trees with low query complexity.
Comput. Geom., 2003
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Constructing Sparse t-Spanners with Small Separators.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
2002
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.
SIAM J. Comput., 2002
Lower bounds for approximate polygon decomposition and minimum gap.
Inf. Process. Lett., 2002
Box-Trees and R-Trees with Near-Optimal Query Time.
Discret. Comput. Geom., 2002
Higher order Delaunay triangulations.
Comput. Geom., 2002
Approximate distance oracles for geometric graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Approximate Distance Oracles Revisited.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
Approximating a Minimum Manhattan Network.
Nord. J. Comput., 2001
2000
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
Nord. J. Comput., 2000
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.
Proceedings of the Algorithm Theory, 2000
On R-trees with Low Stabbing Number.
Proceedings of the Algorithms, 2000
1999
A Fast Approximation Algorithm for TSP with Neighborhoods.
Nord. J. Comput., 1999
Close Approximations of Minimum Rectangular Coverings.
J. Comb. Optim., 1999
Approximating Minimum Manhattan Networks.
Proceedings of the Randomization, 1999
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
1997
Approximation Algorithms for Covering Polygons with Squares and Similar Problems.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
1996
Close Approximation of Minimum Rectangular Coverings.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996