Joachim Gudmundsson

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 112

Top Venues

Publications

Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
Spanner for the 0/1/∞ weighted region problem. CoRR (2024)
Joachim Gudmundsson, Martin P. Seybold, Sampson Wong
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. SoCG (2024)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong
Dynamic L-Budget Clustering of Curves. SWAT (2024)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong
Map-Matching Queries Under Fréchet Distance on Low-Density Spanners. SoCG (2024)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong
Bicriteria approximation for minimum dilation graph augmentation. CoRR (2024)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong
Map-Matching Queries under Fréchet Distance on Low-Density Spanners. CoRR (2024)
Joachim Gudmundsson, Michael Mai, Sampson Wong
-packed. CoRR (2024)
Joachim Gudmundsson, Martin P. Seybold, Sampson Wong
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. ACM Trans. Algorithms 20 (2) (2024)
Joachim Gudmundsson, Zijin Huang, Sampson Wong
Approximating the λ-low-density Value. COCOON (1) (2023)
Joachim Gudmundsson, Martin P. Seybold, Sampson Wong
Map matching queries on realistic input graphs under the Fréchet distance. SODA (2023)
Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2 (1) (2023)
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Pattern Formation for Fat Robots with Lights. CoRR (2023)
Joachim Gudmundsson, Yuan Sha
Augmenting graphs to minimize the radius. Comput. Geom. 113 (2023)
Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC (2023)
Joachim Gudmundsson, John Pfeifer, Martin P. Seybold
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. ACM Trans. Spatial Algorithms Syst. 9 (2) (2023)
Joachim Gudmundsson, Yuan Sha
Algorithms for radius-optimally augmenting trees in a metric space. Comput. Geom. 114 (2023)
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Pattern Formation for Fat Robots with Memory. CoRR (2023)
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Shortest Paths of Mutually Visible Robots. CoRR (2023)
Joachim Gudmundsson, Yuan Sha
Approximating the Discrete Center Line Segment in Linear Time. WADS (2023)
Joachim Gudmundsson, Yuan Sha
Shortest Beer Path Queries in Digraphs with Bounded Treewidth. ISAAC (2023)
Joachim Gudmundsson, Yuan Sha, Sampson Wong
Approximating the packedness of polygonal curves. Comput. Geom. 108 (2023)
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
The Mutual Visibility Problem for Fat Robots. WADS (2023)
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
Oriented Spanners. ESA (2023)
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong
Oriented Spanners. CoRR (2023)
Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong
Computing a Subtrajectory Cluster from c-packed Trajectories. CoRR (2023)
Joachim Gudmundsson, Martin P. Seybold, John Pfeifer
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. DASFAA (1) (2022)
Joachim Gudmundsson, Sampson Wong
Improving the Dilation of a Metric Graph by Adding Edges. ACM Trans. Algorithms 18 (3) (2022)
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
The Mutual Visibility Problem for Fat Robots. CoRR (2022)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84 (5) (2022)
Joachim Gudmundsson, Sampson Wong
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. SODA (2022)
Joachim Gudmundsson, Martin P. Seybold, John Pfeifer
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. CoRR (2022)
Joachim Gudmundsson, John Pfeifer, Martin P. Seybold
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. CoRR (2022)
Joachim Gudmundsson, Martin P. Seybold, Sampson Wong
Map matching queries on realistic input graphs under the Fréchet distance. CoRR (2022)
Milutin Brankovic, Joachim Gudmundsson, André van Renssen
Local routing in a tree metric 1-spanner. J. Comb. Optim. 44 (4) (2022)
Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
Partitioning axis-parallel lines in 3D. CoRR (2022)
Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
Covering a set of line segments with a few squares. Theor. Comput. Sci. 923 (2022)
Joachim Gudmundsson, Martin P. Seybold
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. SODA (2022)
Joachim Gudmundsson, Zijin Huang, Sampson Wong
Approximating the lambda-low-density value. CoRR (2022)
Joachim Gudmundsson, Martin P. Seybold, John Pfeifer
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. SIGSPATIAL/GIS (2021)
Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold
A Practical Index Structure Supporting Fréchet Proximity Queries among Trajectories. ACM Trans. Spatial Algorithms Syst. 7 (3) (2021)
Joachim Gudmundsson, Yuan Sha
Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. WADS (2021)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17 (3) (2021)
Joachim Gudmundsson, Julián Mestre, Seeun William Umboh
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305 (2021)
Joachim Gudmundsson, Sampson Wong
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. CoRR (2021)
Joachim Gudmundsson, Martin P. Seybold, Sampson Wong
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. CoRR (2021)
Joachim Gudmundsson, Yuan Sha, Fan Yao
Augmenting Graphs to Minimize the Radius. ISAAC (2021)
Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
Covering a set of line segments with a few squares. CoRR (2021)
Joachim Gudmundsson, Martin P. Seybold
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. CoRR (2021)
Joachim Gudmundsson, Sampson Wong
Improving the dilation of a metric graph by adding edges. SODA (2021)
Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
Covering a Set of Line Segments with a Few Squares. CIAC (2021)
Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong
Translation Invariant Fréchet Distance Queries. CoRR (2021)
Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong
Translation Invariant Fréchet Distance Queries. Algorithmica 83 (11) (2021)
Joachim Gudmundsson, Yuan Sha, Sampson Wong
Approximating the packedness of polygonal curves. CoRR (2020)
Milutin Brankovic, Joachim Gudmundsson, André van Renssen
Local Routing in a Tree Metric 1-Spanner. CoRR (2020)
Milutin Brankovic, Joachim Gudmundsson, André van Renssen
Local Routing in a Tree Metric 1-Spanner. COCOON (2020)
Joachim Gudmundsson, Michiel H. M. Smid
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. 88 (2020)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On β-Plurality Points in Spatial Voting Games. SoCG (2020)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On beta-Plurality Points in Spatial Voting Games. CoRR (2020)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Jorren Hendriks, Erfan Hosseini Sereshgi, Vera Sacristán, Rodrigo I. Silveira, Jorrick Sleijster, Frank Staals, Carola Wenk
Improved Map Construction using Subtrajectory Clustering. LocalRec@SIGSPATIAL (2020)
Joachim Gudmundsson, Sampson Wong
Improving the dilation of a metric graph by adding edges. CoRR (2020)
Joachim Gudmundsson, Yuan Sha, Sampson Wong
Approximating the Packedness of Polygonal Curves. ISAAC (2020)
Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold
A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories. CoRR (2020)
Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs
Approximating (k, ℓ)-center clustering for curves. SODA (2019)
Younjin Chung, Joachim Gudmundsson
Networking Self-Organising Maps and Similarity Weight Associations. ICONIP (5) (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC (2019)
Joachim Gudmundsson, Sampson Wong
Computing the Yolk in Spatial Voting Games without Computing Median Lines. CoRR (2019)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the circle. Comput. Geom. 79 (2019)
Joachim Gudmundsson, Sampson Wong
Computing the Yolk in Spatial Voting Games without Computing Median Lines. AAAI (2019)
Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30 (2) (2019)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. Algorithmica 81 (2) (2019)
Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk
Fast Fréchet Distance Between Curves with Long Edges. Int. J. Comput. Geom. Appl. 29 (2) (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR (2019)
Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler, Tobias Müller, Vera Sacristán, Rodrigo I. Silveira
Theoretical analysis of beaconless geocast protocols in 1D. ANALCO (2018)
Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk
Fast fréchet distance between curves with long edges. IWISC (2018)
Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80 (11) (2018)
Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN (2018)
Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler
Approximating (k, 𝓁)-center clustering for curves. CoRR (2018)
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
Finding Pairwise Intersections Inside a Query Range. Algorithmica 80 (11) (2018)
Mark de Berg, Joachim Gudmundsson, Mehran Mehr
Faster Algorithms for Computing Plurality Points. ACM Trans. Algorithms 14 (3) (2018)
Joachim Gudmundsson, Rasmus Pagh
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. ISAAC (2017)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the Circle. ISAAC (2017)
Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk
Fast Fréchet Distance Between Curves With Long Edges. CoRR (2017)
Younjin Chung, Joachim Gudmundsson, Masahiro Takatsuka
A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns. ICONIP (5) (2017)
Joachim Gudmundsson, Rasmus Pagh
Range-efficient consistent sampling and locality-sensitive hashing for polygons. CoRR (2017)
Andrew Cherry, Joachim Gudmundsson, Julián Mestre
Barrier Coverage with Uniform Radii in 2D. ALGOSENSORS (2017)
Sanjay Chawla, Joël Estephan, Joachim Gudmundsson, Michael Horton
Classification of Passes in Football Matches Using Spatiotemporal Data. ACM Trans. Spatial Algorithms Syst. 3 (2) (2017)
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. SIGSPATIAL/GIS (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR (2017)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben
Compact Flow Diagrams for State Sequences. ACM J. Exp. Algorithmics 22 (2017)
Younjin Chung, Joachim Gudmundsson, Masahiro Takatsuka
A Visual Measure of Changes to Weighted Self-Organizing Map Patterns. CoRR (2017)
Joachim Gudmundsson, Michael Horton
Spatio-Temporal Analysis of Team Sports. ACM Comput. Surv. 50 (2) (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC (2017)
Mark de Berg, Joachim Gudmundsson, Mehran Mehr
Faster Algorithms for Computing Plurality Points. SoCG (2016)
Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. J. Graph Theory 82 (1) (2016)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the Circle. CoRR (2016)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben
Compact Flow Diagrams for State Sequences. SEA (2016)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. IPEC (2016)
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben
Compact Flow Diagrams for State Sequences. CoRR (2016)
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR (2016)
Joachim Gudmundsson, Michael Horton
Spatio-Temporal Analysis of Team Sports - A Survey. CoRR (2016)

Joachim Gudmundsson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joachim Gudmundsson