Close Approximation of Minimum Rectangular Coverings. - Christos Levcopoulos; Joachim Gudmundsson (FSTTCS, 1996)

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). - Christos Levcopoulos; Joachim Gudmundsson (FCT, 1997)

Approximation Algorithms for Covering Polygons with Squares and Similar Problems. - Christos Levcopoulos; Joachim Gudmundsson (RANDOM, 1997)

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. - Joachim Gudmundsson; Christos Levcopoulos (COCOON, 1999)

Approximating Minimum Manhattan Networks. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (RANDOM-APPROX, 1999)

Close Approximations of Minimum Rectangular Coverings. - Joachim Gudmundsson; Christos Levcopoulos (J. Comb. Optim., 1999)

A Fast Approximation Algorithm for TSP with Neighborhoods. - Joachim Gudmundsson; Christos Levcopoulos (Nord. J. Comput., 1999)

On R-trees with Low Stabbing Number. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (ESA, 2000)

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (SWAT, 2000)

A Parallel Approximation Algorithm for Minimum Weight Triangulation. - Joachim Gudmundsson; Christos Levcopoulos (Nord. J. Comput., 2000)

Geometric Decompositions and Networks - Approximation Bounds and Algorithms. - Joachim Gudmundsson (2000)

Approximating a Minimum Manhattan Network. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (Nord. J. Comput., 2001)

Approximate Distance Oracles Revisited. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (ISAAC, 2002)

Approximate distance oracles for geometric graphs. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (SODA, 2002)

Higher order Delaunay triangulations. - Joachim Gudmundsson; Mikael Hammar; Marc J. van Kreveld (Comput. Geom., 2002)

Box-Trees and R-Trees with Near-Optimal Query Time. - Pankaj K. Agarwal; Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Herman J. Haverkort (Discret. Comput. Geom., 2002)

Lower bounds for approximate polygon decomposition and minimum gap. - Joachim Gudmundsson; Thore Husfeldt; Christos Levcopoulos (Inf. Process. Lett., 2002)

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (SIAM J. Comput., 2002)

Constructing Sparse t-Spanners with Small Separators. - Joachim Gudmundsson (FCT, 2003)

Chips on Wafers. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (WADS, 2003)

On R-trees with low query complexity. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (Comput. Geom., 2003)

Balanced Partition of Minimum Spanning Trees. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (Int. J. Comput. Geom. Appl., 2003)

A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. - Joachim Gudmundsson; Jan Vahrenhold (Cache-Oblivious and Cache-Aware Algorithms, 2004)

Efficient detection of motion patterns in spatio-temporal data sets. - Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (GIS, 2004)

I/O-Efficiently Pruning Dense Spanners. - Joachim Gudmundsson; Jan Vahrenhold (JCDCG, 2004)

Ordered theta graphs. - Prosenjit Bose; Joachim Gudmundsson; Pat Morin (Comput. Geom., 2004)

Facility location and the geometric minimum-diameter spanning tree. - Joachim Gudmundsson; Herman J. Haverkort; Sang-Min Park; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2004)

Box-trees for collision checking in industrial installations. - Herman J. Haverkort; Mark de Berg; Joachim Gudmundsson (Comput. Geom., 2004)

Finding the best shortcut in a geometric network. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (EuroCG, 2005)

Sparse Geometric Graphs with Small Dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Antoine Vigneron (ISAAC, 2005)

Fast Pruning of Geometric Spanners. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (STACS, 2005)

Constructing Plane Spanners of Bounded Degree and Low Weight. - Prosenjit Bose; Joachim Gudmundsson; Michiel H. M. Smid (Algorithmica, 2005)

Chips on wafers, or packing rectangles into grids. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2005)

Constrained higher order Delaunay triangulations. - Joachim Gudmundsson; Herman J. Haverkort; Marc J. van Kreveld (Comput. Geom., 2005)

TSP with neighborhoods of varying size. - Mark de Berg; Joachim Gudmundsson; Matthew J. Katz; Christos Levcopoulos; Mark H. Overmars; A. Frank van der Stappen (J. Algorithms, 2005)

Increasing the readability of graph drawings with centrality-based scaling. - Damian Merrick; Joachim Gudmundsson (APVIS, 2006)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; Esther Moet; René van Oostrum; Alexander Wolff 001 (COCOON, 2006)

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. - Joachim Gudmundsson; Rolf Klein; Giri Narasimhan; Michiel H. M. Smid; Alexander Wolff 001 (Geometric Networks and Metric Space Embeddings, 2006)

Schematisation of Tree Drawings. - Joachim Gudmundsson; Marc J. van Kreveld; Damian Merrick (GD, 2006)

Path Simplification for Metro Map Layout. - Damian Merrick; Joachim Gudmundsson (GD, 2006)

Computing longest duration flocks in trajectory data. - Joachim Gudmundsson; Marc J. van Kreveld (GIS, 2006)

Constructing Interference-Minimal Networks. - Marc Benkert; Joachim Gudmundsson; Herman J. Haverkort; Alexander Wolff 001 (SOFSEM, 2006)

Area-preserving approximations of polygonal paths. - Prosenjit Bose; Sergio Cabello; Otfried Cheong; Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (J. Discrete Algorithms, 2006)

Dimensionality reduction for long duration and complex spatio-temporal queries. - Ghazi Al-Naymat; Sanjay Chawla; Joachim Gudmundsson (SAC, 2007)

Reporting leadership patterns among trajectories. - Mattias Andersson 002; Joachim Gudmundsson; Patrick Laube; Thomas Wolle (SAC, 2007)

Experimental Study of Geometric t-Spanners: A Running Time Comparison. - Mohammad Farshi; Joachim Gudmundsson (WEA, 2007)

Approximate distance oracles for graphs with dense clusters. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2007)

Editorial. - Mark de Berg; Joachim Gudmundsson; René van Oostrum; Bettina Speckmann (Comput. Geom., 2007)

Minimum weight pseudo-triangulations. - Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2007)

Distance-preserving approximations of polygonal paths. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Comput. Geom., 2007)

Efficient Detection of Patterns in 2D Trajectories of Moving Points. - Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (GeoInformatica, 2007)

Preface. - Joachim Gudmundsson; C. Barry Jay (Int. J. Found. Comput. Sci., 2007)

Dilation and Detours in Geometric Networks. - Joachim Gudmundsson; Christian Knauer (Handbook of Approximation Algorithms and Metaheuristics, 2007)

An ILP for the metro-line crossing problem. - Matthew Asquith; Joachim Gudmundsson; Damian Merrick (CATS, 2008)

Detecting single file movement. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson (GIS, 2008)

Sparse geometric graphs with small dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Michiel H. M. Smid; Antoine Vigneron (Comput. Geom., 2008)

Constructing minimum-interference networks. - Marc Benkert; Joachim Gudmundsson; Herman J. Haverkort; Alexander Wolff 001 (Comput. Geom., 2008)

Reporting flock patterns. - Marc Benkert; Joachim Gudmundsson; Florian Hübner; Thomas Wolle (Comput. Geom., 2008)

Aperture-Angle and Hausdorff-Approximation of Convex Figures. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson (Discret. Comput. Geom., 2008)

Reporting Leaders and Followers among Trajectories of Moving Point Objects. - Mattias Andersson 002; Joachim Gudmundsson; Patrick Laube; Thomas Wolle (GeoInformatica, 2008)

Improving the Stretch Factor of a Geometric Network by Edge Augmentation. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (SIAM J. Comput., 2008)

Approximate distance oracles for geometric spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (ACM Trans. Algorithms, 2008)

Applications of Geometric Spanner Networks. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2008)

Geometric Spanners. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2008)

Planar Geometric Spanners. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2008)

Movement Patterns in Spatio-temporal Data. - Joachim Gudmundsson; Patrick Laube; Thomas Wolle (Encyclopedia of GIS, 2008)

Detecting Hotspots in Geographic Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (AGILE Conf., 2009)

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. - Gautam Das 001; Joachim Gudmundsson; Rolf Klein; Christian Knauer; Michiel H. M. Smid (Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 2009)

Measuring the Similarity of Geometric Graphs. - Otfried Cheong; Joachim Gudmundsson; Hyo-Sil Kim; Daria Schymura; Fabian Stehn (SEA, 2009)

Compressing spatio-temporal trajectories. - Joachim Gudmundsson; Jyrki Katajainen; Damian Merrick; Cahya Ong; Thomas Wolle (Comput. Geom., 2009)

Region-restricted clustering for geographic data mining. - Joachim Gudmundsson; Marc J. van Kreveld; Giri Narasimhan (Comput. Geom., 2009)

On the Expected Maximum Degree of Gabriel and Yao Graphs - Luc Devroye; Joachim Gudmundsson; Pat Morin (CoRR, 2009)

Region-Fault Tolerant Geometric Spanners. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson (Discret. Comput. Geom., 2009)

Restricted Mesh Simplification Using Edge Contractions. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Int. J. Comput. Geom. Appl., 2009)

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. - Marc Benkert; Joachim Gudmundsson; Christian Knauer; René van Oostrum; Alexander Wolff 001 (Int. J. Comput. Geom. Appl., 2009)

Preface. - Joachim Gudmundsson; James Harland (Int. J. Found. Comput. Sci., 2009)

On Spanners of Geometric Graphs. - Joachim Gudmundsson; Michiel H. M. Smid (Int. J. Found. Comput. Sci., 2009)

Experimental study of geometric t-spanners. - Mohammad Farshi; Joachim Gudmundsson (ACM J. Exp. Algorithmics, 2009)

Detecting Areas Visited Regularly. - Bojan Djordjevic; Joachim Gudmundsson (COCOON, 2010)

Planar visibility: testing and counting. - Joachim Gudmundsson; Pat Morin (SCG, 2010)

10491 Results of the break-out group: Similarity measures. - Joachim Gudmundsson; Harvey J. Miller; Rodrigo I. Silveira; Mathias Versichele; Stefan van der Spek (Representation, Analysis and Visualization of Moving Objects, 2010)

10491 Results of the break-out group: Gulls Data. - Emiel van Loon; Jörg-Rüdiger Sack; Kevin Buchin; Maike Buchin; Mark de Berg; Marc J. van Kreveld; Joachim Gudmundsson; David M. Mountain (Representation, Analysis and Visualization of Moving Objects, 2010)

Editorial, SWAT 2008 Special Issue. - Joachim Gudmundsson (Algorithmica, 2010)

A simple and efficient kinetic spanner. - Mohammad Ali Abam; Mark de Berg; Joachim Gudmundsson (Comput. Geom., 2010)

Constrained free space diagrams: a tool for trajectory analysis. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson (Int. J. Geogr. Inf. Sci., 2010)

Finding Popular Places. - Marc Benkert; Bojan Djordjevic; Joachim Gudmundsson; Thomas Wolle (Int. J. Comput. Geom. Appl., 2010)

Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. - Fabian Gieseke; Joachim Gudmundsson; Jan Vahrenhold (J. Discrete Algorithms, 2010)

Finding the Most Relevant Fragments in Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (J. Graph Algorithms Appl., 2010)

Shortest Path in Transportation Network and Weighted Subdivisions. - Radwa El Shawi; Joachim Gudmundsson (Graph Data Management, 2011)

Quickest Paths in Anisotropic Media. - Radwa El Shawi; Joachim Gudmundsson (COCOA, 2011)

Geometric Spanners for Weighted Point Sets. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson; Michiel H. M. Smid (Algorithmica, 2011)

Detecting Regular Visit Patterns. - Bojan Djordjevic; Joachim Gudmundsson; Anh Pham; Thomas Wolle (Algorithmica, 2011)

Algorithms for Marketing-Mix Optimization. - Joachim Gudmundsson; Pat Morin; Michiel H. M. Smid (Algorithmica, 2011)

Notes on Large Angle Crossing Graphs. - Vida Dujmovic; Joachim Gudmundsson; Pat Morin; Thomas Wolle (Chic. J. Theor. Comput. Sci., 2011)

Farthest-polygon Voronoi diagrams. - Otfried Cheong; Hazel Everett; Marc Glisse; Joachim Gudmundsson; Samuel Hornus; Sylvain Lazard; Mira Lee; Hyeon-Suk Na (Comput. Geom., 2011)

Detecting Commuting Patterns by Clustering Subtrajectories. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008 (Int. J. Comput. Geom. Appl., 2011)

Computational Movement Analysis. - Joachim Gudmundsson; Patrick Laube; Thomas Wolle (Springer Handbook of Geographic Information, 2012)

Of motifs and goals: mining trajectory data. - Joachim Gudmundsson; Andreas Thom 001; Jan Vahrenhold (SIGSPATIAL/GIS, 2012)

On graphs supporting greedy forwarding for directional wireless networks. - Weisheng Si; Bernhard Scholz; Joachim Gudmundsson; Guoqiang Mao; Roksana Boreli; Albert Y. Zomaya (ICC, 2012)

Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512). - Joachim Gudmundsson; Patrick Laube; E. Emiel van Loon (Dagstuhl Reports, 2012)

Approximate one-to-one point pattern matching. - Marc Benkert; Joachim Gudmundsson; Damian Merrick; Thomas Wolle (J. Discrete Algorithms, 2012)

Fréchet Queries in Geometric Trees. - Joachim Gudmundsson; Michiel H. M. Smid (ESA, 2013)

Algorithms for hotspot computation on trajectory data. - Joachim Gudmundsson; Marc J. van Kreveld; Frank Staals (SIGSPATIAL/GIS, 2013)

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (ISAAC, 2013)

Fast Fréchet queries. - Mark de Berg; Atlas F. Cook IV; Joachim Gudmundsson (Comput. Geom., 2013)

Fast query structures in anisotropic media. - Radwa El Shawi; Joachim Gudmundsson (Theor. Comput. Sci., 2013)

Computational Aspects of Multi-Winner Approval Voting. - Haris Aziz 001; Serge Gaspers; Joachim Gudmundsson; Simon Mackenzie; Nicholas Mattei; Toby Walsh (MPREF@AAAI, 2014)

A Generalization of the Convex Kakeya Problem. - Hee-Kap Ahn; Sang Won Bae 001; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron (Algorithmica, 2014)

Editorial: COCOON 2012 Special Issue. - Joachim Gudmundsson; Julián Mestre; Taso Viglas (Algorithmica, 2014)

Quickest path queries on transportation network. - Radwa El Shawi; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2014)

A fast algorithm for data collection along a fixed track. - Otfried Cheong; Radwa El Shawi; Joachim Gudmundsson (Theor. Comput. Sci., 2014)

On the number of upward planar orientations of maximal planar graphs. - Fabrizio Frati; Joachim Gudmundsson; Emo Welzl (Theor. Comput. Sci., 2014)

Football analysis using spatio-temporal tools. - Joachim Gudmundsson; Thomas Wolle (Comput. Environ. Urban Syst., 2014)

Analyzing delays in trajectories. - Maximilian Konzack; Thomas J. McKetterick; Georgina Wilcox; Maike Buchin; Luca Giuggioli; Joachim Gudmundsson; Michel A. Westenberg; Kevin Buchin (PacificVis, 2015)

Fast Algorithms for Diameter-Optimally Augmenting Paths. - Ulrike Große; Joachim Gudmundsson; Christian Knauer; Michiel H. M. Smid; Fabian Stehn (ICALP (1), 2015)

Welfare Maximization in Fractional Hedonic Games. - Haris Aziz 001; Serge Gaspers; Joachim Gudmundsson; Julián Mestre; Hanjo Täubig (IJCAI, 2015)

Automated Classification of Passing in Football. - Michael Horton 001; Joachim Gudmundsson; Sanjay Chawla; Joël Estephan (PAKDD (2), 2015)

Augmenting Graphs to Minimize the Diameter. - Fabrizio Frati; Serge Gaspers; Joachim Gudmundsson; Luke Mathieson (Algorithmica, 2015)

Fast algorithms for approximate Fréchet matching queries in geometric trees. - Joachim Gudmundsson; Michiel H. M. Smid (Comput. Geom., 2015)

Increasing-Chord Graphs On Point Sets. - Hooman Reisi Dehkordi; Fabrizio Frati; Joachim Gudmundsson (J. Graph Algorithms Appl., 2015)

A GPU Approach to Subtrajectory Clustering Using the Fréchet Distance. - Joachim Gudmundsson; Nacho Valladares (IEEE Trans. Parallel Distributed Syst., 2015)

Spatio-Temporal Analysis of Team Sports - A Survey. - Joachim Gudmundsson; Michael Horton 001 (CoRR, 2016)

Editorial, SEA 2014 Special Issue. - Joachim Gudmundsson; Jyrki Katajainen (ACM J. Exp. Algorithmics, 2016)

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (J. Graph Theory, 2016)

Applications of Geometric Spanner Networks. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2016)

Geometric Spanners. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2016)

Planar Geometric Spanners. - Joachim Gudmundsson; Giri Narasimhan; Michiel H. M. Smid (Encyclopedia of Algorithms, 2016)

Barrier Coverage with Uniform Radii in 2D. - Andrew Cherry; Joachim Gudmundsson; Julián Mestre (ALGOSENSORS, 2017)

A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. - Mark de Berg; Joachim Gudmundsson; Ali D. Mehrabi (SIGSPATIAL/GIS, 2017)

A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns. - Younjin Chung; Joachim Gudmundsson; Masahiro Takatsuka (ICONIP (5), 2017)

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. - Serge Gaspers; Joachim Gudmundsson; Julián Mestre; Stefan Rümmele (ISAAC, 2017)

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. - Joachim Gudmundsson; Rasmus Pagh (ISAAC, 2017)

A Visual Measure of Changes to Weighted Self-Organizing Map Patterns. - Younjin Chung; Joachim Gudmundsson; Masahiro Takatsuka (CoRR, 2017)

Spatio-Temporal Analysis of Team Sports. - Joachim Gudmundsson; Michael Horton 001 (ACM Comput. Surv., 2017)

Compact Flow Diagrams for State Sequences. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Michael Horton 001; Stef Sijben (ACM J. Exp. Algorithmics, 2017)

Classification of Passes in Football Matches Using Spatiotemporal Data. - Sanjay Chawla; Joël Estephan; Joachim Gudmundsson; Michael Horton 001 (ACM Trans. Spatial Algorithms Syst., 2017)

Movement Patterns in Spatio-Temporal Data. - Joachim Gudmundsson; Patrick Laube; Thomas Wolle (Encyclopedia of GIS, 2017)

Dilation and Detours in Geometric Networks. - Joachim Gudmundsson; Christian Knauer (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Theoretical analysis of beaconless geocast protocols in 1D. - Joachim Gudmundsson; Irina Kostitsyna; Maarten Löffler; Tobias Müller 001; Vera Sacristán; Rodrigo I. Silveira (ANALCO, 2018)

When is Red-Blue Nonblocker Fixed-Parameter Tractable? - Serge Gaspers; Joachim Gudmundsson; Michael Horton 001; Stefan Rümmele (LATIN, 2018)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Boris Aronov; Prosenjit Bose; Erik D. Demaine; Joachim Gudmundsson; John Iacono; Stefan Langerman; Michiel H. M. Smid (Algorithmica, 2018)

Finding Pairwise Intersections Inside a Query Range. - Mark de Berg; Joachim Gudmundsson; Ali D. Mehrabi (Algorithmica, 2018)

Approximating (k, 𝓁)-center clustering for curves. - Kevin Buchin; Anne Driemel; Joachim Gudmundsson; Michael Horton 001; Irina Kostitsyna; Maarten Löffler (CoRR, 2018)

Faster Algorithms for Computing Plurality Points. - Mark de Berg; Joachim Gudmundsson; Mehran Mehr (ACM Trans. Algorithms, 2018)

Computing the Yolk in Spatial Voting Games without Computing Median Lines. - Joachim Gudmundsson; Sampson Wong (AAAI, 2019)

Networking Self-Organising Maps and Similarity Weight Associations. - Younjin Chung; Joachim Gudmundsson (ICONIP (5), 2019)

Approximating (k, ℓ)-center clustering for curves. - Kevin Buchin; Anne Driemel; Joachim Gudmundsson; Michael Horton 001; Irina Kostitsyna; Maarten Löffler; Martijn Struijs (SODA, 2019)

Turbocharging Treewidth Heuristics. - Serge Gaspers; Joachim Gudmundsson; Mitchell Jones; Julián Mestre; Stefan Rümmele (Algorithmica, 2019)

Shortcuts for the circle. - Sang Won Bae 001; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2019)

Fast Fréchet Distance Between Curves with Long Edges. - Joachim Gudmundsson; Majid Mirzanezhad; Ali Mohades; Carola Wenk (Int. J. Comput. Geom. Appl., 2019)

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. - Ulrike Große; Christian Knauer; Fabian Stehn; Joachim Gudmundsson; Michiel H. M. Smid (Int. J. Found. Comput. Sci., 2019)

Improved Map Construction using Subtrajectory Clustering. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Jorren Hendriks; Erfan Hosseini Sereshgi; Vera Sacristán; Rodrigo I. Silveira; Jorrick Sleijster; Frank Staals; Carola Wenk (LocalRec@SIGSPATIAL, 2020)

Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. - Joachim Gudmundsson; Michiel H. M. Smid (Comput. Geom., 2020)

On beta-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton 001 (CoRR, 2020)

Augmenting Graphs to Minimize the Radius. - Joachim Gudmundsson; Yuan Sha; Fan Yao (ISAAC, 2021)

Translation Invariant Fréchet Distance Queries. - Joachim Gudmundsson; André van Renssen; Zeinab Saeidi; Sampson Wong (Algorithmica, 2021)

Bounded-degree light approximate shortest-path trees in doubling metrics. - Joachim Gudmundsson; Julián Mestre; Seeun William Umboh (Discret. Appl. Math., 2021)

On β-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton 001 (ACM Trans. Algorithms, 2021)

A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories. - Joachim Gudmundsson; Michael Horton 001; John Pfeifer; Martin P. Seybold (ACM Trans. Spatial Algorithms Syst., 2021)

Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. - Joachim Gudmundsson; Martin P. Seybold; John Pfeifer (DASFAA (1), 2022)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. - Joachim Gudmundsson; Martin P. Seybold (SODA, 2022)

Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. - Joachim Gudmundsson; Sampson Wong (SODA, 2022)

Local Routing in Sparse and Lightweight Geometric Graphs. - Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen (Algorithmica, 2022)

Approximating the lambda-low-density value. - Joachim Gudmundsson; Zijin Huang; Sampson Wong (CoRR, 2022)

Local routing in a tree metric 1-spanner. - Milutin Brankovic; Joachim Gudmundsson; André van Renssen (J. Comb. Optim., 2022)

Improving the Dilation of a Metric Graph by Adding Edges. - Joachim Gudmundsson; Sampson Wong (ACM Trans. Algorithms, 2022)

Covering a set of line segments with a few squares. - Joachim Gudmundsson; Mees van de Kerkhof; André van Renssen; Frank Staals; Lionov Wiratma; Sampson Wong (Theor. Comput. Sci., 2022)

Approximating the λ-low-density Value. - Joachim Gudmundsson; Zijin Huang; Sampson Wong (COCOON (1), 2023)

Oriented Spanners. - Kevin Buchin; Joachim Gudmundsson; Antonia Kalb; Aleksandr Popov 001; Carolin Rehs; André van Renssen; Sampson Wong (ESA, 2023)

Computing a Subtrajectory Cluster from c-Packed Trajectories. - Joachim Gudmundsson; Zijin Huang; André van Renssen; Sampson Wong (ISAAC, 2023)

Shortest Beer Path Queries in Digraphs with Bounded Treewidth. - Joachim Gudmundsson; Yuan Sha (ISAAC, 2023)

The Mutual Visibility Problem for Fat Robots. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (WADS, 2023)

Approximating the Discrete Center Line Segment in Linear Time. - Joachim Gudmundsson; Yuan Sha (WADS, 2023)

Partitioning Axis-Parallel Lines in 3D. - Boris Aronov; Abdul Basit 001; Mark de Berg; Joachim Gudmundsson (Comput. Geom. Topol., 2023)

Approximating the packedness of polygonal curves. - Joachim Gudmundsson; Yuan Sha; Sampson Wong (Comput. Geom., 2023)

Shortest Paths of Mutually Visible Robots. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (CoRR, 2023)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. - Joachim Gudmundsson; John Pfeifer; Martin P. Seybold (ACM Trans. Spatial Algorithms Syst., 2023)

Augmenting graphs to minimize the radius. - Joachim Gudmundsson; Yuan Sha (Comput. Geom., 2023)

Algorithms for radius-optimally augmenting trees in a metric space. - Joachim Gudmundsson; Yuan Sha (Comput. Geom., 2023)

Map-Matching Queries Under Fréchet Distance on Low-Density Spanners. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Aleksandr Popov 001; Sampson Wong (SoCG, 2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. - Joachim Gudmundsson; Martin P. Seybold; Sampson Wong (SoCG, 2024)

Bicriteria Approximation for Minimum Dilation Graph Augmentation. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Sampson Wong (ESA, 2024)

Approximating the Fréchet Distance When Only One Curve Is c-Packed. - Joachim Gudmundsson; Tiancheng Mai; Sampson Wong (ISAAC, 2024)

Dynamic L-Budget Clustering of Curves. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Lukas Plätz; Lea Thiel; Sampson Wong (SWAT, 2024)

Approximating the Fréchet distance when only one curve is c-packed. - Joachim Gudmundsson; Tiancheng Mai; Sampson Wong (CoRR, 2024)

A well-separated pair decomposition for low density graphs. - Joachim Gudmundsson; Sampson Wong (CoRR, 2024)

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. - Joachim Gudmundsson; Martin P. Seybold; Sampson Wong (ACM Trans. Algorithms, 2024)

L-Budget Clustering (SWAT 24). - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Lukas Plätz; Lea Thiel; Sampson Wong (DROPS Artifacts, 2024)

A WSPD, Separator and Small Tree Cover for c-Packed Graphs. - Lindsey Deryckere; Joachim Gudmundsson; André van Renssen; Yuan Sha; Sampson Wong (WADS, 2025)

Spanner for the 0/1/∞ Weighted Region Problem. - Joachim Gudmundsson; Zijin Huang; André van Renssen; Sampson Wong (WADS, 2025)

Pattern formation for fat robots with lights. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (Comput. Geom., 2025)

Pattern formation for fat robots with memory. - Rusul J. Alsaedi; Joachim Gudmundsson; André van Renssen (Comput. Geom., 2025)

Roadster: Improved algorithms for subtrajectory clustering and map construction. - Kevin Buchin; Maike Buchin; Joachim Gudmundsson; Jorren Hendriks; Erfan Hosseini Sereshgi; Rodrigo I. Silveira; Jorrick Sleijster; Frank Staals; Carola Wenk (Comput. Geosci., 2025)

Player-Team Heterogeneous Interaction Graph Transformer for Soccer Outcome Prediction. - Lintao Wang; Shiwen Xu; Michael Horton 001; Joachim Gudmundsson; Zhiyong Wang 001 (CoRR, 2025)