Joachim Gudmundsson

Comput. Geom., 2025

Pattern formation for fat robots with lights.

[BibT_eX]

[DOI]

Comput. Geom., 2025

Spanner for the 0/1/∞ Weighted Region Problem.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

A WSPD, Separator and Small Tree Cover for c-Packed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

2024

L-Budget Clustering (SWAT 24).

[BibT_eX]

[DOI]

Dataset, November, 2024

A well-separated pair decomposition for low density graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating the Fréchet distance when only one curve is <i>c</i>-packed.

[BibT_eX]

[DOI]

Tiancheng Mai

CoRR, 2024

Dynamic L-Budget Clustering of Curves.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Approximating the Fréchet Distance When Only One Curve Is c-Packed.

[BibT_eX]

[DOI]

Tiancheng Mai

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Bicriteria Approximation for Minimum Dilation Graph Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Map-Matching Queries Under Fréchet Distance on Low-Density Spanners.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Augmenting graphs to minimize the radius.

[BibT_eX]

[DOI]

Comput. Geom., August, 2023

Shortest Paths of Mutually Visible Robots.

[BibT_eX]

[DOI]

CoRR, 2023

Partitioning Axis-Parallel Lines in 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Approximating the Discrete Center Line Segment in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

The Mutual Visibility Problem for Fat Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Map matching queries on realistic input graphs under the Fréchet distance.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Shortest Beer Path Queries in Digraphs with Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing a Subtrajectory Cluster from c-Packed Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Oriented Spanners.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Approximating the λ-low-density Value.

[BibT_eX]

[DOI]

Zijin Huang

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Approximating the lambda-low-density value.

[BibT_eX]

[DOI]

Zijin Huang

CoRR, 2022

Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language.

[BibT_eX]

[DOI]

John Pfeifer

Proceedings of the Database Systems for Advanced Applications, 2022

2021

A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2021

Bounded-degree light approximate shortest-path trees in doubling metrics.

[BibT_eX]

[DOI]

Julián Mestre

Seeun William Umboh

Discret. Appl. Math., 2021

Translation Invariant Fréchet Distance Queries.

[BibT_eX]

[DOI]

Algorithmica, 2021

Algorithms for Radius-Optimally Augmenting Trees in a Metric Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Improving the dilation of a metric graph by adding edges.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Augmenting Graphs to Minimize the Radius.

[BibT_eX]

[DOI]

Fan Yao

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance.

[BibT_eX]

[DOI]

John Pfeifer

Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

Covering a Set of Line Segments with a Few Squares.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

On beta-Plurality Points in Spatial Voting Games.

[BibT_eX]

[DOI]

CoRR, 2020

Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Approximating the Packedness of Polygonal Curves.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Improved Map Construction using Subtrajectory Clustering.

[BibT_eX]

[DOI]

Erfan Hosseini Sereshgi

Proceedings of the LocalRec'20: Proceedings of the 4th ACM SIGSPATIAL Workshop on Location-Based Recommendations, 2020

On β-Plurality Points in Spatial Voting Games.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Local Routing in a Tree Metric 1-Spanner.

[BibT_eX]

[DOI]

Milutin Brankovic

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Approximating (k, ℓ)-center clustering for curves.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Local Routing in Sparse and Lightweight Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Networking Self-Organising Maps and Similarity Weight Associations.

[BibT_eX]

[DOI]

Younjin Chung

Proceedings of the Neural Information Processing - 26th International Conference, 2019

Computing the Yolk in Spatial Voting Games without Computing Median Lines.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Approximating (k, 𝓁)-center clustering for curves.

[BibT_eX]

[DOI]

CoRR, 2018

When is Red-Blue Nonblocker Fixed-Parameter Tractable?

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Fast fréchet distance between curves with long edges.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Theoretical analysis of beaconless geocast protocols in 1D.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

Dilation and Detours in Geometric Networks.

[BibT_eX]

Christian Knauer

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Movement Patterns in Spatio-Temporal Data.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of GIS., 2017

Classification of Passes in Football Matches Using Spatiotemporal Data.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2017

Spatio-Temporal Analysis of Team Sports.

[BibT_eX]

[DOI]

Michael Horton

ACM Comput. Surv., 2017

A Visual Measure of Changes to Weighted Self-Organizing Map Patterns.

[BibT_eX]

[DOI]

Younjin Chung

Masahiro Takatsuka

CoRR, 2017

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons.

[BibT_eX]

[DOI]

Rasmus Pagh

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Shortcuts for the Circle.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns.

[BibT_eX]

[DOI]

Younjin Chung

Masahiro Takatsuka

Proceedings of the Neural Information Processing - 24th International Conference, 2017

A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data.

[BibT_eX]

[DOI]

Ali D. Mehrabi

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Barrier Coverage with Uniform Radii in 2D.

[BibT_eX]

[DOI]

Andrew Cherry

Julián Mestre

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Planar Geometric Spanners.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Geometric Spanners.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Applications of Geometric Spanner Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Editorial, SEA 2014 Special Issue.

[BibT_eX]

[DOI]

Jyrki Katajainen

ACM J. Exp. Algorithmics, 2016

Spatio-Temporal Analysis of Team Sports - A Survey.

[BibT_eX]

[DOI]

Michael Horton

CoRR, 2016

Compact Flow Diagrams for State Sequences.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Turbocharging Treewidth Heuristics.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Faster Algorithms for Computing Plurality Points.

[BibT_eX]

[DOI]

Mehran Mehr

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Fast algorithms for approximate Fréchet matching queries in geometric trees.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Finding Pairwise Intersections Inside a Query Range.

[BibT_eX]

[DOI]

Ali D. Mehrabi

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Automated Classification of Passing in Football.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

Welfare Maximization in Fractional Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Fast Algorithms for Diameter-Optimally Augmenting Paths.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Analyzing delays in trajectories.

[BibT_eX]

[DOI]

Maximilian Konzack

Thomas J. McKetterick

Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

2014

Editorial: COCOON 2012 Special Issue.

[BibT_eX]

[DOI]

Julián Mestre

Taso Viglas

Algorithmica, 2014

Increasing-Chord Graphs On Point Sets.

[BibT_eX]

[DOI]

Hooman Reisi Dehkordi

Fabrizio Frati

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Computational Aspects of Multi-Winner Approval Voting.

[BibT_eX]

[DOI]

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013

Fast query structures in anisotropic media.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Augmenting Graphs to Minimize the Diameter.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Algorithms for hotspot computation on trajectory data.

[BibT_eX]

[DOI]

Frank Staals

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

Fréchet Queries in Geometric Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

A Fast Algorithm for Data Collection along a Fixed Track.

[BibT_eX]

[DOI]

Otfried Cheong

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Approximate one-to-one point pattern matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512).

[BibT_eX]

[DOI]

E. Emiel van Loon

Dagstuhl Reports, 2012

A Generalization of the Convex Kakeya Problem.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On the Number of Upward Planar Orientations of Maximal Planar Graphs.

[BibT_eX]

[DOI]

Fabrizio Frati

Emo Welzl

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On graphs supporting greedy forwarding for directional wireless networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2012

Football analysis using spatio-temporal tools.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

A GPU approach to subtrajectory clustering using the Fréchet distance.

[BibT_eX]

[DOI]

Nacho Valladares

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Of motifs and goals: mining trajectory data.

[BibT_eX]

[DOI]

Andreas Thom

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Quickest Path Queries on Transportation Network.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

Computational Movement Analysis.

[BibT_eX]

[DOI]

Proceedings of the Die Dynamik sozialer und sprachlicher Netzwerke, 2012

2011

Algorithms for Marketing-Mix Optimization.

[BibT_eX]

[DOI]

Algorithmica, 2011

Fast Fréchet Queries.

[BibT_eX]

[DOI]

Atlas F. Cook IV

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Quickest Paths in Anisotropic Media.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

Shortest Path in Transportation Network and Weighted Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Graph Data Management: Techniques and Applications., 2011

2010

Finding the Most Relevant Fragments in Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies.

[BibT_eX]

[DOI]

Fabian Gieseke

J. Discrete Algorithms, 2010

Constrained free space diagrams: a tool for trajectory analysis.

[BibT_eX]

[DOI]

Kevin Buchin

Maike Buchin

Int. J. Geogr. Inf. Sci., 2010

Editorial, SWAT 2008 Special Issue.

[BibT_eX]

[DOI]

Algorithmica, 2010

10491 Results of the break-out group: Gulls Data.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

10491 Results of the break-out group: Similarity measures.

[BibT_eX]

[DOI]

Proceedings of the Representation, Analysis and Visualization of Moving Objects, 05.12., 2010

Planar visibility: testing and counting.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Detecting Areas Visited Regularly.

[BibT_eX]

[DOI]

Bojan Djordjevic

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Notes on Large Angle Crossing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2010, 2010

2009

Preface.

[BibT_eX]

[DOI]

James Harland

Int. J. Found. Comput. Sci., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

On the Expected Maximum Degree of Gabriel and Yao Graphs

[BibT_eX]

[DOI]

Luc Devroye

CoRR, 2009

Measuring the Similarity of Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Geometric Spanners for Weighted Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

Detecting Hotspots in Geographic Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in GIScience, 2009

2008

Movement Patterns in Spatio-temporal Data.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of GIS., 2008

Planar Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Applications of Geometric Spanner Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate distance oracles for geometric spanners.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Improving the Stretch Factor of a Geometric Network by Edge Augmentation.

[BibT_eX]

[DOI]

Panos Giannopoulos

SIAM J. Comput., 2008

Reporting Leaders and Followers among Trajectories of Moving Point Objects.

[BibT_eX]

[DOI]

GeoInformatica, 2008

Constructing minimum-interference networks.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Sparse geometric graphs with small dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Detecting Commuting Patterns by Clustering Subtrajectories.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Detecting single file movement.

[BibT_eX]

[DOI]

Kevin Buchin

Maike Buchin

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Detecting Regular Visit Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

A simple and efficient kinetic spanner.

[BibT_eX]

[DOI]

Mohammad Ali Abam

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

An ILP for the metro-line crossing problem.

[BibT_eX]

[DOI]

Matthew Asquith

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

Dilation and Detours in Geometric Networks.

[BibT_eX]

[DOI]

Christian Knauer

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Preface.

[BibT_eX]

[DOI]

C. Barry Jay

Int. J. Found. Comput. Sci., 2007

Efficient Detection of Patterns in 2D Trajectories of Moving Points.

[BibT_eX]

[DOI]

Bettina Speckmann

GeoInformatica, 2007

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Experimental Study of Geometric t-Spanners: A Running Time Comparison.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Region-fault tolerant geometric spanners.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Reporting leadership patterns among trajectories.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

Dimensionality reduction for long duration and complex spatio-temporal queries.

[BibT_eX]

[DOI]

Ghazi Al-Naymat

Sanjay Chawla

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

Compressing Spatio-temporal Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Finding Popular Places.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Farthest-Polygon Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Aperture-angle and Hausdorff-approximation of convex figures.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Area-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

On Spanners of Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Constructing Interference-Minimal Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Computing longest duration flocks in trajectory data.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

Path Simplification for Metro Map Layout.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Schematisation of Tree Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Region-Restricted Clustering for Geographic Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Reporting Flock Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Restricted Mesh Simplification Using Edge Contractions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Increasing the readability of graph drawings with centrality-based scaling.

[BibT_eX]

[DOI]

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005

Constrained higher order Delaunay triangulations.

[BibT_eX]

[DOI]

Herman J. Haverkort

Comput. Geom., 2005

Chips on wafers, or packing rectangles into grids.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Fast Pruning of Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Sparse Geometric Graphs with Small Dilation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Experimental Study of Geometric <i>t</i>-Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

Finding the best shortcut in a geometric network.

[BibT_eX]

[DOI]

Panos Giannopoulos

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

I/O-Efficiently Pruning Dense Spanners.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Approximate Distance Oracles for Graphs with Dense Clusters.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Efficient detection of motion patterns in spatio-temporal data sets.

[BibT_eX]

[DOI]

Bettina Speckmann

Proceedings of the 12th ACM International Workshop on Geographic Information Systems, 2004

Minimum Weight Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

A Simple Algorithm for I/O-efficiently Pruning Dense Spanners.

[BibT_eX]

[DOI]

Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

2003

On R-trees with low query complexity.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Chips on Wafers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Distance-Preserving Approximations of Polygonal Paths.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Constructing Sparse t-Spanners with Small Separators.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Lower bounds for approximate polygon decomposition and minimum gap.

[BibT_eX]

[DOI]

Thore Husfeldt

Inf. Process. Lett., 2002

Approximate distance oracles for geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Balanced Partition of Minimum Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2002, 2002

Constructing Plane Spanners of Bounded Degree and Low Weight.

[BibT_eX]

[DOI]

Prosenjit Bose

Proceedings of the Algorithms, 2002

TSP with Neighborhoods of Varying Size.

[BibT_eX]

[DOI]

A. Frank van der Stappen

Proceedings of the Algorithms, 2002

Box-trees for collision checking in industrial installations.

[BibT_eX]

[DOI]

Herman J. Haverkort

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Ordered theta graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Facility Location and the Geometric Minimum-Diameter Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Approximating a Minimum Manhattan Network.

[BibT_eX]

[DOI]

Nord. J. Comput., 2001

Box-trees and R-trees with near-optimal query time.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Geometric Decompositions and Networks - Approximation Bounds and Algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2000

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Higher Order Delaunay Triangulations.

[BibT_eX]

[DOI]

Mikael Hammar

Proceedings of the Algorithms, 2000

On R-trees with Low Stabbing Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

A Fast Approximation Algorithm for TSP with Neighborhoods.

[BibT_eX]

Nord. J. Comput., 1999

Close Approximations of Minimum Rectangular Coverings.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Approximating Minimum Manhattan Networks.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

A Parallel Approximation Algorithm for Minimum Weight Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Approximation Algorithms for Covering Polygons with Squares and Similar Problems.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Close Approximation of Minimum Rectangular Coverings.

[BibT_eX]

[DOI]