default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim Gudmundsson
Person information
- affiliation: University of Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j91]Joachim Gudmundsson
, Martin P. Seybold, Sampson Wong:
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. ACM Trans. Algorithms 20(2): 14 (2024)- [c121]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong:
Map-Matching Queries Under Fréchet Distance on Low-Density Spanners. SoCG 2024: 27:1-27:15 - [c120]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. SoCG 2024: 62:1-62:14 - [c119]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong:
Bicriteria Approximation for Minimum Dilation Graph Augmentation. ESA 2024: 36:1-36:15 - [c118]Joachim Gudmundsson, Tiancheng Mai, Sampson Wong:
Approximating the Fréchet Distance When Only One Curve Is c-Packed. ISAAC 2024: 37:1-37:14 - [c117]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong:
Dynamic L-Budget Clustering of Curves. SWAT 2024: 18:1-18:17 - [i60]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Spanner for the 0/1/∞ weighted region problem. CoRR abs/2407.01951 (2024) - [i59]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong:
Bicriteria approximation for minimum dilation graph augmentation. CoRR abs/2407.04614 (2024) - [i58]Joachim Gudmundsson, Tiancheng Mai, Sampson Wong:
Approximating the Fréchet distance when only one curve is c-packed. CoRR abs/2407.05114 (2024) - [i57]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Aleksandr Popov, Sampson Wong:
Map-Matching Queries under Fréchet Distance on Low-Density Spanners. CoRR abs/2407.19304 (2024) - 2023
- [j90]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - [j89]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the packedness of polygonal curves. Comput. Geom. 108: 101920 (2023) - [j88]Joachim Gudmundsson, Yuan Sha:
Augmenting graphs to minimize the radius. Comput. Geom. 113: 101996 (2023) - [j87]Joachim Gudmundsson, Yuan Sha:
Algorithms for radius-optimally augmenting trees in a metric space. Comput. Geom. 114: 102018 (2023) - [j86]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): 14:1-14:24 (2023) - [c116]Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the λ-low-density Value. COCOON (1) 2023: 71-82 - [c115]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. ESA 2023: 26:1-26:16 - [c114]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-Packed Trajectories. ISAAC 2023: 34:1-34:15 - [c113]Joachim Gudmundsson, Yuan Sha:
Shortest Beer Path Queries in Digraphs with Bounded Treewidth. ISAAC 2023: 35:1-35:17 - [c112]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. SODA 2023: 1464-1492 - [c111]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
The Mutual Visibility Problem for Fat Robots. WADS 2023: 15-28 - [c110]Joachim Gudmundsson, Yuan Sha:
Approximating the Discrete Center Line Segment in Linear Time. WADS 2023: 660-674 - [e9]Erin W. Chambers, Joachim Gudmundsson:
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. LIPIcs 258, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-273-0 [contents] - [i56]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Pattern Formation for Fat Robots with Lights. CoRR abs/2306.14440 (2023) - [i55]Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. CoRR abs/2306.17097 (2023) - [i54]Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-packed Trajectories. CoRR abs/2307.10610 (2023) - [i53]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Pattern Formation for Fat Robots with Memory. CoRR abs/2309.14649 (2023) - [i52]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
Shortest Paths of Mutually Visible Robots. CoRR abs/2309.16901 (2023) - 2022
- [j85]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84(5): 1316-1340 (2022) - [j84]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local routing in a tree metric 1-spanner. J. Comb. Optim. 44(4): 2642-2660 (2022) - [j83]Joachim Gudmundsson, Sampson Wong:
Improving the Dilation of a Metric Graph by Adding Edges. ACM Trans. Algorithms 18(3): 20:1-20:20 (2022) - [j82]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: 74-98 (2022) - [c109]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. DASFAA (1) 2022: 241-249 - [c108]Joachim Gudmundsson, Sampson Wong:
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. SODA 2022: 173-189 - [c107]Joachim Gudmundsson, Martin P. Seybold:
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. SODA 2022: 610-626 - [i51]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language. CoRR abs/2202.01390 (2022) - [i50]Joachim Gudmundsson, John Pfeifer, Martin P. Seybold:
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. CoRR abs/2203.10364 (2022) - [i49]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning axis-parallel lines in 3D. CoRR abs/2204.01772 (2022) - [i48]Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen:
The Mutual Visibility Problem for Fat Robots. CoRR abs/2206.14423 (2022) - [i47]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Map matching queries on realistic input graphs under the Fréchet distance. CoRR abs/2211.02951 (2022) - [i46]Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the lambda-low-density value. CoRR abs/2211.07039 (2022) - 2021
- [j81]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. Algorithmica 83(11): 3514-3533 (2021) - [j80]Joachim Gudmundsson, Julián Mestre, Seeun William Umboh:
Bounded-degree light approximate shortest-path trees in doubling metrics. Discret. Appl. Math. 305: 199-204 (2021) - [j79]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17(3): 24:1-24:21 (2021) - [j78]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): 15:1-15:33 (2021) - [c106]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: 286-299 - [c105]Joachim Gudmundsson, Martin P. Seybold, John Pfeifer:
On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance. SIGSPATIAL/GIS 2021: 596-605 - [c104]Joachim Gudmundsson, Yuan Sha, Fan Yao:
Augmenting Graphs to Minimize the Radius. ISAAC 2021: 45:1-45:20 - [c103]Joachim Gudmundsson, Sampson Wong:
Improving the dilation of a metric graph by adding edges. SODA 2021: 675-683 - [c102]Joachim Gudmundsson, Yuan Sha:
Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. WADS 2021: 457-470 - [i45]Joachim Gudmundsson, Martin P. Seybold:
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures. CoRR abs/2101.04914 (2021) - [i44]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 abs/2101.09913 (2021) - [i43]Joachim Gudmundsson, André van Renssen, Zeinab Saeidi, Sampson Wong:
Translation Invariant Fréchet Distance Queries. CoRR abs/2102.05844 (2021) - [i42]Joachim Gudmundsson, Sampson Wong:
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance. CoRR abs/2110.15554 (2021) - [i41]Joachim Gudmundsson, Martin P. Seybold, Sampson Wong:
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size. CoRR abs/2112.12350 (2021) - 2020
- [j77]Joachim Gudmundsson, Michiel H. M. Smid:
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. 88: 101608 (2020) - [c101]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local Routing in a Tree Metric 1-Spanner. COCOON 2020: 174-185 - [c100]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. SoCG 2020: 7:1-7:15 - [c99]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: 5:1-5:4 - [c98]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the Packedness of Polygonal Curves. ISAAC 2020: 9:1-9:15 - [i40]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On beta-Plurality Points in Spatial Voting Games. CoRR abs/2003.07513 (2020) - [i39]Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold:
A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories. CoRR abs/2005.13773 (2020) - [i38]Joachim Gudmundsson, Sampson Wong:
Improving the dilation of a metric graph by adding edges. CoRR abs/2007.12350 (2020) - [i37]Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the packedness of polygonal curves. CoRR abs/2009.07789 (2020) - [i36]Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local Routing in a Tree Metric 1-Spanner. CoRR abs/2012.00959 (2020)
2010 – 2019
- 2019
- [j76]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475 (2019) - [j75]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the circle. Comput. Geom. 79: 37-54 (2019) - [j74]Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk:
Fast Fréchet Distance Between Curves with Long Edges. Int. J. Comput. Geom. Appl. 29(2): 161-187 (2019) - [j73]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): 293-313 (2019) - [c97]Joachim Gudmundsson, Sampson Wong:
Computing the Yolk in Spatial Voting Games without Computing Median Lines. AAAI 2019: 2012-2019 - [c96]Younjin Chung, Joachim Gudmundsson:
Networking Self-Organising Maps and Similarity Weight Associations. ICONIP (5) 2019: 779-788 - [c95]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC 2019: 30:1-30:13 - [c94]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs:
Approximating (k, ℓ)-center clustering for curves. SODA 2019: 2922-2938 - [i35]Joachim Gudmundsson, Sampson Wong:
Computing the Yolk in Spatial Voting Games without Computing Median Lines. CoRR abs/1902.04735 (2019) - [i34]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR abs/1909.10215 (2019) - 2018
- [j72]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. Algorithmica 80(11): 3253-3269 (2018) - [j71]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): 3316-3334 (2018) - [j70]Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. ACM Trans. Algorithms 14(3): 36:1-36:23 (2018) - [c93]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: 62-76 - [c92]Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk:
Fast fréchet distance between curves with long edges. IWISC 2018: 52-58 - [c91]Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele:
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN 2018: 515-528 - [p3]Joachim Gudmundsson, Christian Knauer:
Dilation and Detours in Geometric Networks. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i33]Kevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler:
Approximating (k, 𝓁)-center clustering for curves. CoRR abs/1805.01547 (2018) - 2017
- [j69]Joachim Gudmundsson, Michael Horton:
Spatio-Temporal Analysis of Team Sports. ACM Comput. Surv. 50(2): 22:1-22:34 (2017) - [j68]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben:
Compact Flow Diagrams for State Sequences. ACM J. Exp. Algorithmics 22 (2017) - [j67]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): 6:1-6:30 (2017) - [c90]Andrew Cherry, Joachim Gudmundsson, Julián Mestre:
Barrier Coverage with Uniform Radii in 2D. ALGOSENSORS 2017: 57-69 - [c89]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. SIGSPATIAL/GIS 2017: 48:1-48:4 - [c88]Younjin Chung, Joachim Gudmundsson, Masahiro Takatsuka:
A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns. ICONIP (5) 2017: 237-246 - [c87]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. ISAAC 2017: 9:1-9:13 - [c86]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: 37:1-37:13 - [c85]Joachim Gudmundsson, Rasmus Pagh:
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. ISAAC 2017: 42:1-42:13 - [e8]Joachim Gudmundsson, Michiel H. M. Smid:
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada. 2017 [contents] - [r9]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Movement Patterns in Spatio-Temporal Data. Encyclopedia of GIS 2017: 1362-1370 - [i32]Joachim Gudmundsson, Rasmus Pagh:
Range-efficient consistent sampling and locality-sensitive hashing for polygons. CoRR abs/1701.05290 (2017) - [i31]Younjin Chung, Joachim Gudmundsson, Masahiro Takatsuka:
A Visual Measure of Changes to Weighted Self-Organizing Map Patterns. CoRR abs/1703.08917 (2017) - [i30]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR abs/1709.10285 (2017) - [i29]Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades, Carola Wenk:
Fast Fréchet Distance Between Curves With Long Edges. CoRR abs/1710.10521 (2017) - 2016
- [j66]Joachim Gudmundsson, Jyrki Katajainen:
Editorial, SEA 2014 Special Issue. ACM J. Exp. Algorithmics 21(1): 1.1:1 (2016) - [j65]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): 45-64 (2016) - [c84]Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. SoCG 2016: 32:1-32:15 - [c83]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13 - [c82]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben:
Compact Flow Diagrams for State Sequences. SEA 2016: 89-104 - [r8]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2016: 86-90 - [r7]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2016: 846-852 - [r6]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2016: 1570-1574 - [i28]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben:
Compact Flow Diagrams for State Sequences. CoRR abs/1602.05622 (2016) - [i27]Joachim Gudmundsson, Michael Horton:
Spatio-Temporal Analysis of Team Sports - A Survey. CoRR abs/1602.06994 (2016) - [i26]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR abs/1607.05547 (2016) - [i25]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. CoRR abs/1612.02412 (2016) - 2015
- [j64]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4): 995-1010 (2015) - [j63]Joachim Gudmundsson, Michiel H. M. Smid:
Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. 48(6): 479-494 (2015) - [j62]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. J. Graph Algorithms Appl. 19(2): 761-778 (2015) - [j61]Joachim Gudmundsson, Nacho Valladares:
A GPU Approach to Subtrajectory Clustering Using the Fréchet Distance. IEEE Trans. Parallel Distributed Syst. 26(4): 924-937 (2015) - [c81]Maximilian Konzack, Thomas J. McKetterick, Georgina Wilcox, Maike Buchin, Luca Giuggioli, Joachim Gudmundsson, Michel A. Westenberg, Kevin Buchin:
Analyzing delays in trajectories. PacificVis 2015: 93-97 - [c80]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. AAMAS 2015: 107-115 - [c79]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths. ICALP (1) 2015: 678-688 - [c78]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig:
Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: 461-467 - [c77]Michael Horton, Joachim Gudmundsson, Sanjay Chawla, Joël Estephan:
Automated Classification of Passing in Football. PAKDD (2) 2015: 319-330 - [c76]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. WADS 2015: 236-248 - [i24]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. CoRR abs/1502.06079 (2015) - 2014
- [j60]Joachim Gudmundsson, Julián Mestre, Taso Viglas:
Editorial: COCOON 2012 Special Issue. Algorithmica 70(1): 1 (2014) - [j59]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. Algorithmica 70(2): 152-170 (2014) - [j58]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest path queries on transportation network. Comput. Geom. 47(7): 695-709 (2014) - [j57]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544: 32-59 (2014) - [j56]Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson:
A fast algorithm for data collection along a fixed track. Theor. Comput. Sci. 554: 254-262 (2014) - [j55]Joachim Gudmundsson, Thomas Wolle:
Football analysis using spatio-temporal tools. Comput. Environ. Urban Syst. 47: 16-27 (2014) - [c75]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. MPREF@AAAI 2014 - [c74]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. GD 2014: 464-475 - [e7]Joachim Gudmundsson, Jyrki Katajainen:
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings. Lecture Notes in Computer Science 8504, Springer 2014, ISBN 978-3-319-07958-5 [contents] - [i23]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. CoRR abs/1407.3247 (2014) - [i22]Michael Horton, Joachim Gudmundsson, Sanjay Chawla, Joël Estephan:
Classification of Passes in Football Matches using Spatiotemporal Data. CoRR abs/1407.5093 (2014) - [i21]Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson:
Increasing-Chord Graphs On Point Sets. CoRR abs/1408.2592 (2014) - 2013
- [j54]Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson:
Fast Fréchet queries. Comput. Geom. 46(6): 747-755 (2013) - [j53]Radwa El Shawi, Joachim Gudmundsson:
Fast query structures in anisotropic media. Theor. Comput. Sci. 497: 112-122 (2013) - [c73]Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson:
A Fast Algorithm for Data Collection along a Fixed Track. COCOON 2013: 77-88 - [c72]Joachim Gudmundsson, Michiel H. M. Smid:
Fréchet Queries in Geometric Trees. ESA 2013: 565-576 - [c71]Joachim Gudmundsson, Marc J. van Kreveld, Frank Staals:
Algorithms for hotspot computation on trajectory data. SIGSPATIAL/GIS 2013: 134-143 - [c70]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. ISAAC 2013: 185-195 - [c69]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. ISAAC 2013: 383-393 - [i20]Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR abs/1309.4713 (2013) - [i19]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting graphs to minimize the diameter. CoRR abs/1309.5172 (2013) - 2012
- [j52]Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle:
Approximate one-to-one point pattern matching. J. Discrete Algorithms 15: 1-15 (2012) - [c68]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest Path Queries on Transportation Network. CATS 2012: 37-46 - [c67]Joachim Gudmundsson, Andreas Thom, Jan Vahrenhold:
Of motifs and goals: mining trajectory data. SIGSPATIAL/GIS 2012: 129-138 - [c66]Joachim Gudmundsson, Nacho Valladares:
A GPU approach to subtrajectory clustering using the Fréchet distance. SIGSPATIAL/GIS 2012: 259-268 - [c65]Joachim Gudmundsson, Thomas Wolle:
Football analysis using spatio-temporal tools. SIGSPATIAL/GIS 2012: 566-569 - [c64]Weisheng Si, Bernhard Scholz, Joachim Gudmundsson, Guoqiang Mao, Roksana Boreli, Albert Y. Zomaya:
On graphs supporting greedy forwarding for directional wireless networks. ICC 2012: 751-756 - [c63]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422 - [c62]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. LATIN 2012: 1-12 - [p2]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Computational Movement Analysis. Springer Handbook of Geographic Information 2012: 423-438 - [e6]Joachim Gudmundsson, Julián Mestre, Taso Viglas:
Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Lecture Notes in Computer Science 7434, Springer 2012, ISBN 978-3-642-32240-2 [contents] - [i18]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. CoRR abs/1209.2171 (2012) - [i17]Joachim Gudmundsson, Patrick Laube, E. Emiel van Loon:
Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512). Dagstuhl Reports 2(12): 89-106 (2012) - 2011
- [j51]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. Algorithmica 60(4): 829-852 (2011) - [j50]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. Algorithmica 60(4): 1004-1016 (2011) - [j49]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011) - [j48]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j47]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - [j46]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. Int. J. Comput. Geom. Appl. 21(3): 253-282 (2011) - [c61]Radwa El Shawi, Joachim Gudmundsson:
Quickest Paths in Anisotropic Media. COCOA 2011: 247-261 - [c60]Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson:
Fast Fréchet Queries. ISAAC 2011: 240-249 - [p1]Radwa El Shawi, Joachim Gudmundsson:
Shortest Path in Transportation Network and Weighted Subdivisions. Graph Data Management 2011: 463-474 - 2010
- [j45]Joachim Gudmundsson:
Editorial, SWAT 2008 Special Issue. Algorithmica 57(3): 435 (2010) - [j44]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
A simple and efficient kinetic spanner. Comput. Geom. 43(3): 251-256 (2010) - [j43]Kevin Buchin, Maike Buchin, Joachim Gudmundsson:
Constrained free space diagrams: a tool for trajectory analysis. Int. J. Geogr. Inf. Sci. 24(7): 1101-1125 (2010) - [j42]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. Int. J. Comput. Geom. Appl. 20(1): 19-42 (2010) - [j41]Fabian Gieseke, Joachim Gudmundsson, Jan Vahrenhold:
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. J. Discrete Algorithms 8(3): 259-272 (2010) - [j40]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [c59]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. CATS 2010: 19-24 - [c58]Bojan Djordjevic, Joachim Gudmundsson:
Detecting Areas Visited Regularly. COCOON 2010: 244-253 - [c57]Joachim Gudmundsson, Pat Morin:
Planar visibility: testing and counting. SCG 2010: 77-86 - [i16]Joachim Gudmundsson, Harvey J. Miller, Rodrigo I. Silveira, Mathias Versichele, Stefan van der Spek:
10491 Results of the break-out group: Similarity measures. Representation, Analysis and Visualization of Moving Objects 2010 - [i15]Emiel van Loon, Jörg-Rüdiger Sack, Kevin Buchin, Maike Buchin, Mark de Berg, Marc J. van Kreveld, Joachim Gudmundsson, David M. Mountain:
10491 Results of the break-out group: Gulls Data. Representation, Analysis and Visualization of Moving Objects 2010 - [i14]Joachim Gudmundsson, Pat Morin:
Planar Visibility: Testing and Counting. CoRR abs/1001.2734 (2010) - [i13]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010) - [i12]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest Path Queries on Transportation Network. CoRR abs/1012.0634 (2010)
2000 – 2009
- 2009
- [j39]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan:
Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009) - [j38]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing spatio-temporal trajectories. Comput. Geom. 42(9): 825-841 (2009) - [j37]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-Fault Tolerant Geometric Spanners. Discret. Comput. Geom. 41(4): 556-582 (2009) - [j36]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geom. Appl. 19(3): 247-265 (2009) - [j35]Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geom. Appl. 19(3): 267-288 (2009) - [j34]Joachim Gudmundsson, James Harland:
Preface. Int. J. Found. Comput. Sci. 20(1): 1-2 (2009) - [j33]Joachim Gudmundsson, Michiel H. M. Smid:
On Spanners of Geometric Graphs. Int. J. Found. Comput. Sci. 20(1): 135-149 (2009) - [j32]Mohammad Farshi, Joachim Gudmundsson:
Experimental study of geometric t-spanners. ACM J. Exp. Algorithmics 14 (2009) - [c56]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c55]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 - [c54]Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn:
Measuring the Similarity of Geometric Graphs. SEA 2009: 101-112 - [e5]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11. - 06.11.2009. Dagstuhl Seminar Proceedings 09451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i11]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. Geometric Networks, Metric Space Embeddings and Spatial Data Mining 2009 - [i10]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. CoRR abs/0903.0308 (2009) - [i9]Luc Devroye, Joachim Gudmundsson, Pat Morin:
On the Expected Maximum Degree of Gabriel and Yao Graphs. CoRR abs/0905.3584 (2009) - [i8]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009) - 2008
- [j31]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) - [j30]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j29]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting flock patterns. Comput. Geom. 41(3): 111-125 (2008) - [j28]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discret. Comput. Geom. 40(3): 414-429 (2008) - [j27]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting Leaders and Followers among Trajectories of Moving Point Objects. GeoInformatica 12(4): 497-528 (2008) - [j26]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38(1): 226-240 (2008) - [j25]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1): 10:1-10:34 (2008) - [c53]Matthew Asquith, Joachim Gudmundsson, Damian Merrick:
An ILP for the metro-line crossing problem. CATS 2008: 49-56 - [c52]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
A simple and efficient kinetic spanner. SCG 2008: 306-310 - [c51]Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle:
Detecting Regular Visit Patterns. ESA 2008: 344-355 - [c50]Kevin Buchin, Maike Buchin, Joachim Gudmundsson:
Detecting single file movement. GIS 2008: 33 - [c49]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655 - [e4]Joachim Gudmundsson:
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings. Lecture Notes in Computer Science 5124, Springer 2008, ISBN 978-3-540-69900-2 [contents] - [r5]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2008 - [r4]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2008 - [r3]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2008 - [r2]Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Movement Patterns in Spatio-temporal Data. Encyclopedia of GIS 2008: 726-732 - 2007
- [j24]Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann:
Editorial. Comput. Geom. 36(1): 1 (2007) - [j23]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-preserving approximations of polygonal paths. Comput. Geom. 36(3): 183-196 (2007) - [j22]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007) - [j21]Joachim Gudmundsson, Christos Levcopoulos:
Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007) - [j20]Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Efficient Detection of Patterns in 2D Trajectories of Moving Points. GeoInformatica 11(2): 195-215 (2007) - [j19]Joachim Gudmundsson, C. Barry Jay:
Preface. Int. J. Found. Comput. Sci. 18(2): 195-196 (2007) - [c48]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-angle and Hausdorff-approximation of convex figures. SCG 2007: 37-45 - [c47]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418 - [c46]Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing Spatio-temporal Trajectories. ISAAC 2007: 763-775 - [c45]Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle:
Finding Popular Places. ISAAC 2007: 776-787 - [c44]Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle:
Reporting leadership patterns among trajectories. SAC 2007: 3-7 - [c43]Ghazi Al-Naymat, Sanjay Chawla, Joachim Gudmundsson:
Dimensionality reduction for long duration and complex spatio-temporal queries. SAC 2007: 393-397 - [c42]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-fault tolerant geometric spanners. SODA 2007: 1-10 - [c41]Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners: A Running Time Comparison. WEA 2007: 270-284 - [e3]Joachim Gudmundsson, C. Barry Jay:
Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings. CRPIT 65, Australian Computer Society 2007, ISBN 1-920-68246-5 [contents] - [e2]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [r1]Joachim Gudmundsson, Christian Knauer:
Dilation and Detours in Geometric Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i7]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - [i6]Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson:
Aperture-Angle and Hausdorff-Approximation of Convex Figures. CoRR abs/cs/0702090 (2007) - 2006
- [j18]Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) - [c40]Damian Merrick, Joachim Gudmundsson:
Increasing the readability of graph drawings with centrality-based scaling. APVIS 2006: 67-76 - [c39]Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff:
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175 - [c38]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204 - [c37]Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan:
Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410 - [c36]Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
Reporting Flock Patterns. ESA 2006: 660-671 - [c35]Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick:
Schematisation of Tree Drawings. GD 2006: 66-76 - [c34]Damian Merrick, Joachim Gudmundsson:
Path Simplification for Metro Map Layout. GD 2006: 258-269 - [c33]Joachim Gudmundsson, Marc J. van Kreveld:
Computing longest duration flocks in trajectory data. GIS 2006: 35-42 - [c32]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. LATIN 2006: 80-92 - [c31]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 - [c30]Joachim Gudmundsson, Michiel H. M. Smid:
On Spanners of Geometric Graphs. SWAT 2006: 388-399 - [e1]Joachim Gudmundsson, C. Barry Jay:
Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. CRPIT 51, Australian Computer Society 2006, ISBN 1-920682-33-3 [contents] - [i5]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006 - 2005
- [j17]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005) - [j16]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005) - [j15]Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld:
Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005) - [j14]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [c29]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. SCG 2005: 327-335 - [c28]Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners. ESA 2005: 556-567 - [c27]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - [c26]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Fast Pruning of Geometric Spanners. STACS 2005: 508-520 - [i4]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. EuroCG 2005: 29-32 - [i3]Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
Constructing interference-minimal networks. EuroCG 2005: 203-206 - [i2]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. CoRR abs/cs/0512091 (2005) - 2004
- [j13]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004) - [j12]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004) - [j11]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004) - [c25]Joachim Gudmundsson, Christos Levcopoulos:
Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310 - [c24]Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004: 250-257 - [c23]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64 - [c22]Joachim Gudmundsson, Jan Vahrenhold:
I/O-Efficiently Pruning Dense Spanners. JCDCG 2004: 106-116 - [i1]Joachim Gudmundsson, Jan Vahrenhold:
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [j10]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) - [j9]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. 13(4): 303-316 (2003) - [c21]Joachim Gudmundsson:
Constructing Sparse t-Spanners with Small Separators. FCT 2003: 86-97 - [c20]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003: 217-228 - [c19]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on Wafers. WADS 2003: 412-423 - 2002
- [j8]Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld:
Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002) - [j7]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28(3): 291-312 (2002) - [j6]Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos:
Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002) - [j5]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002) - [c18]Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff:
Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160 - [c17]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. CCCG 2002: 17-21 - [c16]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. SCG 2002: 53-62 - [c15]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - [c14]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246 - [c13]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35 - [c12]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate Distance Oracles Revisited. ISAAC 2002: 357-368 - [c11]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric graphs. SODA 2002: 828-837 - 2001
- [j4]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001) - [c10]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. SCG 2001: 124-133 - 2000
- [j3]Joachim Gudmundsson, Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000) - [c9]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - [c8]Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld:
Higher Order Delaunay Triangulations. ESA 2000: 232-243 - [c7]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
1990 – 1999
- 1999
- [j2]Joachim Gudmundsson, Christos Levcopoulos:
Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999) - [j1]Joachim Gudmundsson, Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999) - [c6]Joachim Gudmundsson, Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482 - [c5]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38 - 1998
- [c4]Joachim Gudmundsson, Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244 - 1997
- [c3]Christos Levcopoulos, Joachim Gudmundsson:
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316 - [c2]Christos Levcopoulos, Joachim Gudmundsson:
Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41 - 1996
- [c1]Christos Levcopoulos, Joachim Gudmundsson:
Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
