You are here: University of Sydney / Engineering & IT / About us / Our people / Dr Joachim Gudmundsson 

Dr Joachim Gudmundsson

ARC Future FellowComputational geometry, Data structures, Approximation algorithms

J12 - The School of Information Technologies
The University of Sydney

Telephone +61 2 9351 4494
Fax +61 423 070 859

Teaching and supervision

COMP5045 - Computational Geometry
Back to Top

Selected grants

2010

  • Algorithms and data structures to support automated analysis of trajectory data; Gudmundsson J, Gudmundsson J; Australian Research Council (ARC)/Future Fellowships (FT).
Back to Top

Selected publications

Download citations: PDF RTF Endnote

Book Chapters

  • Gudmundsson, J., Laube, P., Wolle, T. (2012). Computational Movement Analysis. In Wolfgang Kresse, David M. Danko (Eds.), Springer Handbook of Geographic Information, (pp. 725-741). Dordrecht, Netherlands: Springer.
  • El Shawi, R., Gudmundsson, J. (2012). Shortest Path in Transportation Network and Weighted Subdivisions. In Sherif Sakr, Eric Pardede (Eds.), Graph Data Management: Techniques and Applications, (pp. 463-474). Hershey, PA, United States: IGI Global Publishing.
  • Gudmundsson, J., Knauer, C. (2007). Dilation and Detours in Geometric Networks. In Teofilo F. Gonzalez (Eds.), Handbook of Approximation Algorithms and Metaheuristics. United States: Chapman & Hall/CRC.

Journals

  • de Berg, M., Cook IV, A., Gudmundsson, J. (2013). Fast Fréchet queries. Computational Geometry, 46(6), 747-755.
  • El Shawi, R., Gudmundsson, J. (2013). Fast query structures in anisotropic media. Theoretical Computer Science, in press.
  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2012). A Generalization of the Convex Kakeya Problem. Lecture Notes in Computer Science (LNCS), 7256, 1-12.
  • Benkert, M., Gudmundsson, J., Merrick, D., Wolle, T. (2012). Approximate one-to-one point pattern matching. Journal of Discrete Algorithms (Amsterdam), 15, 1-15.
  • Gudmundsson, J., Morin, P., Smid, M. (2011). Algorithms for Marketing-Mix Optimization. Algorithmica: an international journal in computer science, 60(4), 1004-1016.
  • Buchin, K., Buchin, M., Gudmundsson, J., Loffler, M., Luo, J. (2011). Detecting Commuting Patterns by Clustering Subtrajectories. International Journal of Computational Geometry and Applications, 21(3), 253-282.
  • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2011). Detecting Regular Visit Patterns. Algorithmica: an international journal in computer science, 60(4), 829-852.
  • Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H. (2011). Farthest-polygon Voronoi diagrams. Computational Geometry, 44(4), 234-247.
  • Abam, M., Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2011). Geometric Spanners for Weighted Point Sets. Algorithmica: an international journal in computer science, 61(1), 207-225.
  • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2011). Notes on Large Angle Crossing Graphs. Chicago Journal of Theoretical Computer Science, 4, 1-14.
  • El Shawi, R., Gudmundsson, J. (2011). Quickest Paths in Anisotropic Media. Lecture Notes in Computer Science (LNCS), 6831, 247-261.
  • Abam, M., de Berg, M., Gudmundsson, J. (2010). A simple and efficient kinetic spanner. Computational Geometry, 43(3), 251-256.
  • Buchin, K., Buchin, M., Gudmundsson, J. (2010). Constrained free space diagrams: a tool for trajectory analysis. International Journal of Geographical Information Science, 24(7), 1101-1125.
  • Gudmundsson, J. (2010). Editorial, SWAT 2008 Special Issue. Algorithmica: an international journal in computer science, 57(3), 435.
  • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2010). Finding Popular Places. International Journal of Computational Geometry and Applications, 20(1), 19-42.
  • Buchin, K., Cabello, S., Gudmundsson, J., Loffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B., Wolle, T. (2010). Finding the Most Relevant Fragments in Networks. Journal of Graph Algorithms and Applications, 14(2), 307-336.
  • Gieseke, F., Gudmundsson, J., Vahrenhold, J. (2010). Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. Journal of Discrete Algorithms (Amsterdam), 8(3), 259-272.
  • Benkert, M., Gudmundsson, J., Knauer, C., Van Oostrum, R., Wolff, A. (2009). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. International Journal of Computational Geometry and Applications, 19(3), 267-288.
  • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2009). Compressing spatio-temporal trajectories. Computational Geometry, 42(9), 825-841.
  • Farshi, M., Gudmundsson, J. (2009). Experimental Study of Geometric t-Spanners. ACM Journal of Experimental Algorithmics, 14, 1.3:1-1.3:39.
  • Gudmundsson, J., Smid, M. (2009). On Spanners of Geometric Graphs. International Journal of Foundations of Computer Science, 20(1), 135-149.
  • Debroye, L., Gudmundsson, J., Morin, P. (2009). On the Expected Maximum Degree of Gabriel and Yao Graphs. Advances in Applied Probability, 41(4), 1123-1140.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2009). Region-Fault Tolerant Geometric Spanners. Discrete and Computational Geometry, 41(4), 556-582.
  • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2009). Region-restricted clustering for geographic data mining. Computational Geometry, 42(3), 231-240.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2009). Restricted Mesh Simplification Using Edge Contractions. International Journal of Computational Geometry and Applications, 19(3), 247-265.
  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J. (2008). Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discrete and Computational Geometry, 40(3), 414-429.
  • Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M. (2008). Approximate Distance Oracles for Geometric Spanners. ACM Transactions on Algorithms, 4(1), 10:1-10:34.
  • Farshi, M., Giannopoulos, P., Gudmundsson, J. (2008). Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM Journal on Computing, 38(1), 226-240.
  • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2008). Reporting flock patterns. Computational Geometry, 41(3), 111-125.
  • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2008). Reporting Leaders and Followers among Trajectories of Moving Point Objects. Geoinformatica, 12(4), 497-528.
  • Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Smid, M., Vigneron, A. (2008). Sparse geometric graphs with small dilation. Computational Geometry, 40(3), 207-219.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2007). Approximate distance oracles for graphs with dense clusters. Computational Geometry, 37(3), 142-154.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2007). Distance-preserving approximations of polygonal paths. Computational Geometry, 36(3), 183-196.
  • de Berg, M., Gudmundsson, J., van Oostrum, R., Speckmann, B. (2007). Editorial: Special Issue on the 21st European Workshop on Computational Geometry EWCG 2005. Computational Geometry, 36(1), 1.
  • Gudmundsson, J., van Kreveld, M., Speckmann, B. (2007). Efficient Detection of Patterns in 2D Trajectories of Moving Points. Geoinformatica, 11(2), 195-215.
  • Gudmundsson, J., Levcopoulos, C. (2007). Minimum weight pseudo-triangulations. Computational Geometry, 38(3), 139-153.
  • Gudmundsson, J., Jay, B. (2007). Preface - Special Issue: Selected Papers from CATS 2006. International Journal of Foundations of Computer Science, 18(2), 195-196.
  • Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M., Speckmann, B. (2006). Area-preserving approximations of polygonal paths. Journal of Discrete Algorithms (Amsterdam), 4(4), 554-566.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2005). Chips on wafers, or packing rectangles into grids. Computational Geometry, 30(2), 95-111.
  • Gudmundsson, J., Haverkort, H., van Kreveld, M. (2005). Constrained higher order Delaunay triangulations. Computational Geometry, 30(3), 271-277.
  • Bose, P., Gudmundsson, J., Smid, M. (2005). Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica: an international journal in computer science, 42(3-4), 249-264.
  • de Berg, M., Gudmundsson, J., Katz, M., Levcopoulos, C., Overmars, M., van der Stappen, A. (2005). TSP with neighborhoods of varying size. Journal of Algorithms, 57(1), 22-36.

Edited Journals

  • Gudmundsson, J. (2010). Algorithmica Volume 57, Number 3. Algorithmica: an international journal in computer science, 57(3).
  • de Berg, M., Gudmundsson, J., van Oostrum, R., Speckmann, B. (2007). Computational Geometry Volume 36, Issue1. Computational Geometry, 36(1).
  • Gudmundsson, J., Jay, B. (2007). International Journal of Foundations of Computer Science Volume 18, Issue 2. International Journal of Foundations of Computer Science, 18(2).

Conferences

  • Gudmundsson, J., Valladares, N. (2012). A GPU approach to subtrajectory clustering using the Fréchet distance. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Wolle, T. (2012). Football analysis using spatio-temporal tools. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Thom, A., Vahrenhold, J. (2012). Of Motifs and Goals: Mining Trajectory Data. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Si, W., Scholz, B., Gudmundsson, J., Mao, G., Boreli, R., Zomaya, A. (2012). On Graphs Supporting Greedy Forwarding for Directional Wireless Networks. 2012 IEEE International Conference on Communications (ICC 2012), online: (IEEE) Institute of Electrical and Electronics Engineers.
  • Frati, F., Gudmundsson, J., Welzl, E. (2012). On the Number of Upward Planar Orientations of Maximal Planar Graphs. The 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Heidelberg: Springer.
  • El Shawi, R., Gudmundsson, J., Levcopoulos, C. (2012). Quickest Path Queries on Transportation Network. Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Sydney: Australian Computer Society.
  • de Berg, M., Cook IV, A., Gudmundsson, J. (2011). Fast Frechet Queries. 22nd International Symposium on Algorithms and Computation ISAAC 2011, Heidelberg, Germany: Springer.
  • Djordjevic, B., Gudmundsson, J. (2010). Detecting Areas Visited Regularly. 16th Annual International Computing and Combinatorics Conference COCOON 2010, Germany: Springer.
  • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2010). Notes on Large Angle Crossing Graphs. 16th Computing: The Australasian Theory Symposium CATS 2010, Australia: Australian Computer Society.
  • Gudmundsson, J., Morin, P. (2010). Planar Visibility: Testing and Counting. 26th Annual ACM Symposium on Computational Geometry SoCG 2010, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Wolle, T. (2010). Towards Automated Football Analysis: Algorithms and Data Structures. 10th Australasian Conference on Mathematics and Computers in Sport MCS 2010, Australia: ANZIAM.
  • Buchin, K., Cabello, S., Gudmundsson, J., Loffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B., Wolle, T. (2009). Efficient Algorithms for Detecting Point Patterns on Networks. Agile Alliance Conference Agile 2009, United States: Agile Alliance.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2009). Geometric Spanners for Weighted Point Sets. 17th Annual European Symposium on Algorithms ESA 2009, Germany: Springer.
  • Cheong, O., Gudmundsson, J., Kim, H., Schymura, D., Stehn, F. (2009). Measuring the Similarity of Geometric Graphs. 8th International Symposium on Experimental Algorithms SEA 2009, Germany: Springer.
  • Abam, M., de Berg, M., Gudmundsson, J. (2008). A Simple and Efficient Kinetic Spanner. 24th Annual ACM Symposium on Computational Geometry SoCG 2008, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J. (2008). Algorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory Proceedings - Lecture Notes in Computer Science Volume 5124. 11th Scandinavian Workshop on Algorithm Theory SWAT 2008, Germany: Springer.
  • Asquith, M., Gudmundsson, J., Merrick, D. (2008). An ILP for the metro-line crossing problem. 14th Computing: The Australasian Theory Symposium CATS 2008, Australia: Australian Computer Society.
  • Buchin, K., Buchin, M., Gudmundsson, J., Loffler, M., Luo, J. (2008). Detecting Commuting Patterns by Clustering Subtrajectories. 19th International Symposium on Algorithms and Computation ISAAC 2008, Germany: Springer.
  • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2008). Detecting Regular Visit Patterns. 16th Annual European Symposium on Algorithms ESA 2008, Germany: Springer.
  • Buchin, K., Buchin, M., Gudmundsson, J. (2008). Detecting Single File Movement. 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems ACM GIS 2008, United States: Association for Computing Machinery (ACM).
  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J. (2007). Aperture-Angle and Hausdorff-Approximation of Convex Figures. 23rd Annual ACM Symposium on Computational Geometry SoCG 2007, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2007). Compressing Spatio-temporal Trajectories. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer.
  • AL-Naymat, G., Chawla, S., Gudmundsson, J. (2007). Dimensionality Reduction for Long Duration and Complex Spatio-Temporal Queries. 2007 ACM SIGAPP Symposium on Applied Computing (SAC '07). Association for Computing Machinery (ACM).
  • Farshi, M., Gudmundsson, J. (2007). Experimental Study of Geometric t-Spanners: A Running Time Comparison. 6th International Workshop Experimental Algorithms WEA 2007, Germany: Springer.
  • Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H. (2007). Farthest-Polygon Voronoi Diagrams. 15th Annual European Symposium on Algorithms ESA 2007, Germany: Springer.
  • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2007). Finding Popular Places. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer.
  • Merrick, D., Gudmundsson, J. (2007). Path Simplification for Metro Map Layout. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2007). Region-Fault Tolerant Geometric Spanners. 18th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2007, United States: Society for Industrial and Applied Mathematics (SIAM).
  • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2007). Reporting Leadership Patterns Among Trajectories. 22nd Annual ACM Symposium on Applied Computing SAC 2007, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J., van Kreveld, M., Merrick, D. (2007). Schematisation of Tree Drawings. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer.
  • Gudmundsson, J., Klein, O., Knauer, C., Smid, M. (2007). Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance. 23rd European Workshop on Computational Geometry EWCG 2007, Austria: Verlag der Technischen Universitat Graz.
  • Gudmundsson, J., Jay, B. (2007). Theory of Computing 2007 - Thirteenth Computing: The Australasian Theory Symposium CATS 2007 - Conferences in Research and Practice in Information Technology Volume 65. 13th Computing: The Australasian Theory Symposium CATS 2007, Australia: Australian Computer Society.
  • Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A. (2006). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer.
  • Gudmundsson, J., van Kreveld, M. (2006). Computing Longest Duration Flocks in Trajectory Data. 14th International Symposium on Advances in Geographic Information Systems ACM-GIS 2006, United States: Association for Computing Machinery (ACM).
  • Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A. (2006). Constructing Interference-Minimal Networks. 32nd Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2006, Germany: Springer.
  • Aronov, B., Bose, P., Demaine, E., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M. (2006). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. 7th Latin American Symposium on Theoretical Informatics LATIN 2006, Germany: Springer.
  • Merrick, D., Gudmundsson, J. (2006). Increasing the Readability of Graph Drawings with Centrality-Based Scaling. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Farshi, M., Gudmundsson, J. (2006). On Algorithms for Computing the Diameter of a t-Spanner. 37th Annual Iranian Mathematics Conference AIM 2006, Iran: Azarbaijan University of Tarbiat Moallem.
  • Gudmundsson, J., Smid, M. (2006). On Spanners of Geometric Graphs. 10th Scandinavian Workshop on Algorithm Theory SWAT 2006, Germany: Springer.
  • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2006). Region-Restricted Clustering for Geographic Data Mining. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer.
  • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2006). Reporting Flock Patterns. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2006). Restricted Mesh Simplification Using Edge Contractions. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer.
  • Gudmundsson, J., Jay, B. (2006). Theory of Computing 2006 - Twelfth Computing: The Australasian Theory Symposium CATS 2006 - Conferences in Research and Practice in Information Technology Volume 51. 12th Computing: The Australasian Theory Symposium CATS 2006, Australia: Australian Computer Society.
  • Farshi, M., Gudmundsson, J. (2005). Experimental Study of Geometric t-Spanners. 13th Annual European Symposium on Algorithms ESA 2005, Germany: Springer.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2005). Fast Pruning of Geometric Spanners. 22nd Annual Symposium on Theoretical Aspects of Computer Science STACS 2005, Germany: Springer.
  • Farshi, M., Giannopoulos, P., Gudmundsson, J. (2005). Finding the Best Shortcut in a Geometric Network. 21st Annual ACM Symposium on Computational Geometry SoCG 2005, United States: Association for Computing Machinery (ACM).
  • Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Vigneron, A. (2005). Sparse Geometric Graphs with Small Dilation. 16th Annual International Symposium on Algorithms and Computation ISAAC 2005, Germany: Springer.

Reference Works

  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Applications of Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Plane Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Gudmundsson, J., Laube, P., Wolle, T. (2008). Real-Time Spatio-Temporal Databases. In Shashi Shekhar, Hui Xiong (Eds.), Encyclopedia of GIS. Germany: Springer.

2013

  • de Berg, M., Cook IV, A., Gudmundsson, J. (2013). Fast Fréchet queries. Computational Geometry, 46(6), 747-755.
  • El Shawi, R., Gudmundsson, J. (2013). Fast query structures in anisotropic media. Theoretical Computer Science, in press.

2012

  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2012). A Generalization of the Convex Kakeya Problem. Lecture Notes in Computer Science (LNCS), 7256, 1-12.
  • Gudmundsson, J., Valladares, N. (2012). A GPU approach to subtrajectory clustering using the Fréchet distance. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Benkert, M., Gudmundsson, J., Merrick, D., Wolle, T. (2012). Approximate one-to-one point pattern matching. Journal of Discrete Algorithms (Amsterdam), 15, 1-15.
  • Gudmundsson, J., Laube, P., Wolle, T. (2012). Computational Movement Analysis. In Wolfgang Kresse, David M. Danko (Eds.), Springer Handbook of Geographic Information, (pp. 725-741). Dordrecht, Netherlands: Springer.
  • Gudmundsson, J., Wolle, T. (2012). Football analysis using spatio-temporal tools. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Thom, A., Vahrenhold, J. (2012). Of Motifs and Goals: Mining Trajectory Data. 20th ACM SIGSPATIAL International Conference on Advances in Geopraphic Information Systems (ACM SIGSPATIAL GIS 2012), New York: Association for Computing Machinery (ACM).
  • Si, W., Scholz, B., Gudmundsson, J., Mao, G., Boreli, R., Zomaya, A. (2012). On Graphs Supporting Greedy Forwarding for Directional Wireless Networks. 2012 IEEE International Conference on Communications (ICC 2012), online: (IEEE) Institute of Electrical and Electronics Engineers.
  • Frati, F., Gudmundsson, J., Welzl, E. (2012). On the Number of Upward Planar Orientations of Maximal Planar Graphs. The 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Heidelberg: Springer.
  • El Shawi, R., Gudmundsson, J., Levcopoulos, C. (2012). Quickest Path Queries on Transportation Network. Eighteenth Computing: The Australasian Theory Symposium (CATS 2012), Sydney: Australian Computer Society.
  • El Shawi, R., Gudmundsson, J. (2012). Shortest Path in Transportation Network and Weighted Subdivisions. In Sherif Sakr, Eric Pardede (Eds.), Graph Data Management: Techniques and Applications, (pp. 463-474). Hershey, PA, United States: IGI Global Publishing.

2011

  • Gudmundsson, J., Morin, P., Smid, M. (2011). Algorithms for Marketing-Mix Optimization. Algorithmica: an international journal in computer science, 60(4), 1004-1016.
  • Buchin, K., Buchin, M., Gudmundsson, J., Loffler, M., Luo, J. (2011). Detecting Commuting Patterns by Clustering Subtrajectories. International Journal of Computational Geometry and Applications, 21(3), 253-282.
  • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2011). Detecting Regular Visit Patterns. Algorithmica: an international journal in computer science, 60(4), 829-852.
  • Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H. (2011). Farthest-polygon Voronoi diagrams. Computational Geometry, 44(4), 234-247.
  • de Berg, M., Cook IV, A., Gudmundsson, J. (2011). Fast Frechet Queries. 22nd International Symposium on Algorithms and Computation ISAAC 2011, Heidelberg, Germany: Springer.
  • Abam, M., Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2011). Geometric Spanners for Weighted Point Sets. Algorithmica: an international journal in computer science, 61(1), 207-225.
  • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2011). Notes on Large Angle Crossing Graphs. Chicago Journal of Theoretical Computer Science, 4, 1-14.
  • El Shawi, R., Gudmundsson, J. (2011). Quickest Paths in Anisotropic Media. Lecture Notes in Computer Science (LNCS), 6831, 247-261.

2010

  • Abam, M., de Berg, M., Gudmundsson, J. (2010). A simple and efficient kinetic spanner. Computational Geometry, 43(3), 251-256.
  • Gudmundsson, J. (2010). Algorithmica Volume 57, Number 3. Algorithmica: an international journal in computer science, 57(3).
  • Buchin, K., Buchin, M., Gudmundsson, J. (2010). Constrained free space diagrams: a tool for trajectory analysis. International Journal of Geographical Information Science, 24(7), 1101-1125.
  • Djordjevic, B., Gudmundsson, J. (2010). Detecting Areas Visited Regularly. 16th Annual International Computing and Combinatorics Conference COCOON 2010, Germany: Springer.
  • Gudmundsson, J. (2010). Editorial, SWAT 2008 Special Issue. Algorithmica: an international journal in computer science, 57(3), 435.
  • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2010). Finding Popular Places. International Journal of Computational Geometry and Applications, 20(1), 19-42.
  • Buchin, K., Cabello, S., Gudmundsson, J., Loffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B., Wolle, T. (2010). Finding the Most Relevant Fragments in Networks. Journal of Graph Algorithms and Applications, 14(2), 307-336.
  • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2010). Notes on Large Angle Crossing Graphs. 16th Computing: The Australasian Theory Symposium CATS 2010, Australia: Australian Computer Society.
  • Gudmundsson, J., Morin, P. (2010). Planar Visibility: Testing and Counting. 26th Annual ACM Symposium on Computational Geometry SoCG 2010, United States: Association for Computing Machinery (ACM).
  • Gieseke, F., Gudmundsson, J., Vahrenhold, J. (2010). Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies. Journal of Discrete Algorithms (Amsterdam), 8(3), 259-272.
  • Gudmundsson, J., Wolle, T. (2010). Towards Automated Football Analysis: Algorithms and Data Structures. 10th Australasian Conference on Mathematics and Computers in Sport MCS 2010, Australia: ANZIAM.

2009

  • Benkert, M., Gudmundsson, J., Knauer, C., Van Oostrum, R., Wolff, A. (2009). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. International Journal of Computational Geometry and Applications, 19(3), 267-288.
  • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2009). Compressing spatio-temporal trajectories. Computational Geometry, 42(9), 825-841.
  • Buchin, K., Cabello, S., Gudmundsson, J., Loffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B., Wolle, T. (2009). Efficient Algorithms for Detecting Point Patterns on Networks. Agile Alliance Conference Agile 2009, United States: Agile Alliance.
  • Farshi, M., Gudmundsson, J. (2009). Experimental Study of Geometric t-Spanners. ACM Journal of Experimental Algorithmics, 14, 1.3:1-1.3:39.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2009). Geometric Spanners for Weighted Point Sets. 17th Annual European Symposium on Algorithms ESA 2009, Germany: Springer.
  • Cheong, O., Gudmundsson, J., Kim, H., Schymura, D., Stehn, F. (2009). Measuring the Similarity of Geometric Graphs. 8th International Symposium on Experimental Algorithms SEA 2009, Germany: Springer.
  • Gudmundsson, J., Smid, M. (2009). On Spanners of Geometric Graphs. International Journal of Foundations of Computer Science, 20(1), 135-149.
  • Debroye, L., Gudmundsson, J., Morin, P. (2009). On the Expected Maximum Degree of Gabriel and Yao Graphs. Advances in Applied Probability, 41(4), 1123-1140.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2009). Region-Fault Tolerant Geometric Spanners. Discrete and Computational Geometry, 41(4), 556-582.
  • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2009). Region-restricted clustering for geographic data mining. Computational Geometry, 42(3), 231-240.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2009). Restricted Mesh Simplification Using Edge Contractions. International Journal of Computational Geometry and Applications, 19(3), 247-265.

2008

  • Abam, M., de Berg, M., Gudmundsson, J. (2008). A Simple and Efficient Kinetic Spanner. 24th Annual ACM Symposium on Computational Geometry SoCG 2008, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J. (2008). Algorithm Theory - SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory Proceedings - Lecture Notes in Computer Science Volume 5124. 11th Scandinavian Workshop on Algorithm Theory SWAT 2008, Germany: Springer.
  • Asquith, M., Gudmundsson, J., Merrick, D. (2008). An ILP for the metro-line crossing problem. 14th Computing: The Australasian Theory Symposium CATS 2008, Australia: Australian Computer Society.
  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J. (2008). Aperture-Angle and Hausdorff-Approximation of Convex Figures. Discrete and Computational Geometry, 40(3), 414-429.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Applications of Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M. (2008). Approximate Distance Oracles for Geometric Spanners. ACM Transactions on Algorithms, 4(1), 10:1-10:34.
  • Buchin, K., Buchin, M., Gudmundsson, J., Loffler, M., Luo, J. (2008). Detecting Commuting Patterns by Clustering Subtrajectories. 19th International Symposium on Algorithms and Computation ISAAC 2008, Germany: Springer.
  • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2008). Detecting Regular Visit Patterns. 16th Annual European Symposium on Algorithms ESA 2008, Germany: Springer.
  • Buchin, K., Buchin, M., Gudmundsson, J. (2008). Detecting Single File Movement. 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems ACM GIS 2008, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Farshi, M., Giannopoulos, P., Gudmundsson, J. (2008). Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM Journal on Computing, 38(1), 226-240.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2008). Plane Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. Germany: Springer.
  • Gudmundsson, J., Laube, P., Wolle, T. (2008). Real-Time Spatio-Temporal Databases. In Shashi Shekhar, Hui Xiong (Eds.), Encyclopedia of GIS. Germany: Springer.
  • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2008). Reporting flock patterns. Computational Geometry, 41(3), 111-125.
  • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2008). Reporting Leaders and Followers among Trajectories of Moving Point Objects. Geoinformatica, 12(4), 497-528.
  • Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Smid, M., Vigneron, A. (2008). Sparse geometric graphs with small dilation. Computational Geometry, 40(3), 207-219.

2007

  • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J. (2007). Aperture-Angle and Hausdorff-Approximation of Convex Figures. 23rd Annual ACM Symposium on Computational Geometry SoCG 2007, United States: Association for Computing Machinery (ACM).
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2007). Approximate distance oracles for graphs with dense clusters. Computational Geometry, 37(3), 142-154.
  • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2007). Compressing Spatio-temporal Trajectories. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer.
  • de Berg, M., Gudmundsson, J., van Oostrum, R., Speckmann, B. (2007). Computational Geometry Volume 36, Issue1. Computational Geometry, 36(1).
  • Gudmundsson, J., Knauer, C. (2007). Dilation and Detours in Geometric Networks. In Teofilo F. Gonzalez (Eds.), Handbook of Approximation Algorithms and Metaheuristics. United States: Chapman & Hall/CRC.
  • AL-Naymat, G., Chawla, S., Gudmundsson, J. (2007). Dimensionality Reduction for Long Duration and Complex Spatio-Temporal Queries. 2007 ACM SIGAPP Symposium on Applied Computing (SAC '07). Association for Computing Machinery (ACM).
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2007). Distance-preserving approximations of polygonal paths. Computational Geometry, 36(3), 183-196.
  • de Berg, M., Gudmundsson, J., van Oostrum, R., Speckmann, B. (2007). Editorial: Special Issue on the 21st European Workshop on Computational Geometry EWCG 2005. Computational Geometry, 36(1), 1.
  • Gudmundsson, J., van Kreveld, M., Speckmann, B. (2007). Efficient Detection of Patterns in 2D Trajectories of Moving Points. Geoinformatica, 11(2), 195-215.
  • Farshi, M., Gudmundsson, J. (2007). Experimental Study of Geometric t-Spanners: A Running Time Comparison. 6th International Workshop Experimental Algorithms WEA 2007, Germany: Springer.
  • Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H. (2007). Farthest-Polygon Voronoi Diagrams. 15th Annual European Symposium on Algorithms ESA 2007, Germany: Springer.
  • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2007). Finding Popular Places. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer.
  • Gudmundsson, J., Jay, B. (2007). International Journal of Foundations of Computer Science Volume 18, Issue 2. International Journal of Foundations of Computer Science, 18(2).
  • Gudmundsson, J., Levcopoulos, C. (2007). Minimum weight pseudo-triangulations. Computational Geometry, 38(3), 139-153.
  • Merrick, D., Gudmundsson, J. (2007). Path Simplification for Metro Map Layout. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer.
  • Gudmundsson, J., Jay, B. (2007). Preface - Special Issue: Selected Papers from CATS 2006. International Journal of Foundations of Computer Science, 18(2), 195-196.
  • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2007). Region-Fault Tolerant Geometric Spanners. 18th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2007, United States: Society for Industrial and Applied Mathematics (SIAM).
  • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2007). Reporting Leadership Patterns Among Trajectories. 22nd Annual ACM Symposium on Applied Computing SAC 2007, United States: Association for Computing Machinery (ACM).
  • Gudmundsson, J., van Kreveld, M., Merrick, D. (2007). Schematisation of Tree Drawings. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer.
  • Gudmundsson, J., Klein, O., Knauer, C., Smid, M. (2007). Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance. 23rd European Workshop on Computational Geometry EWCG 2007, Austria: Verlag der Technischen Universitat Graz.
  • Gudmundsson, J., Jay, B. (2007). Theory of Computing 2007 - Thirteenth Computing: The Australasian Theory Symposium CATS 2007 - Conferences in Research and Practice in Information Technology Volume 65. 13th Computing: The Australasian Theory Symposium CATS 2007, Australia: Australian Computer Society.

2006

  • Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A. (2006). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer.
  • Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M., Speckmann, B. (2006). Area-preserving approximations of polygonal paths. Journal of Discrete Algorithms (Amsterdam), 4(4), 554-566.
  • Gudmundsson, J., van Kreveld, M. (2006). Computing Longest Duration Flocks in Trajectory Data. 14th International Symposium on Advances in Geographic Information Systems ACM-GIS 2006, United States: Association for Computing Machinery (ACM).
  • Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A. (2006). Constructing Interference-Minimal Networks. 32nd Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2006, Germany: Springer.
  • Aronov, B., Bose, P., Demaine, E., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M. (2006). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. 7th Latin American Symposium on Theoretical Informatics LATIN 2006, Germany: Springer.
  • Merrick, D., Gudmundsson, J. (2006). Increasing the Readability of Graph Drawings with Centrality-Based Scaling. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Farshi, M., Gudmundsson, J. (2006). On Algorithms for Computing the Diameter of a t-Spanner. 37th Annual Iranian Mathematics Conference AIM 2006, Iran: Azarbaijan University of Tarbiat Moallem.
  • Gudmundsson, J., Smid, M. (2006). On Spanners of Geometric Graphs. 10th Scandinavian Workshop on Algorithm Theory SWAT 2006, Germany: Springer.
  • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2006). Region-Restricted Clustering for Geographic Data Mining. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer.
  • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2006). Reporting Flock Patterns. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer.
  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2006). Restricted Mesh Simplification Using Edge Contractions. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer.
  • Gudmundsson, J., Jay, B. (2006). Theory of Computing 2006 - Twelfth Computing: The Australasian Theory Symposium CATS 2006 - Conferences in Research and Practice in Information Technology Volume 51. 12th Computing: The Australasian Theory Symposium CATS 2006, Australia: Australian Computer Society.

2005

  • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2005). Chips on wafers, or packing rectangles into grids. Computational Geometry, 30(2), 95-111.
  • Gudmundsson, J., Haverkort, H., van Kreveld, M. (2005). Constrained higher order Delaunay triangulations. Computational Geometry, 30(3), 271-277.
  • Bose, P., Gudmundsson, J., Smid, M. (2005). Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica: an international journal in computer science, 42(3-4), 249-264.
  • Farshi, M., Gudmundsson, J. (2005). Experimental Study of Geometric t-Spanners. 13th Annual European Symposium on Algorithms ESA 2005, Germany: Springer.
  • Gudmundsson, J., Narasimhan, G., Smid, M. (2005). Fast Pruning of Geometric Spanners. 22nd Annual Symposium on Theoretical Aspects of Computer Science STACS 2005, Germany: Springer.
  • Farshi, M., Giannopoulos, P., Gudmundsson, J. (2005). Finding the Best Shortcut in a Geometric Network. 21st Annual ACM Symposium on Computational Geometry SoCG 2005, United States: Association for Computing Machinery (ACM).
  • Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Vigneron, A. (2005). Sparse Geometric Graphs with Small Dilation. 16th Annual International Symposium on Algorithms and Computation ISAAC 2005, Germany: Springer.
  • de Berg, M., Gudmundsson, J., Katz, M., Levcopoulos, C., Overmars, M., van der Stappen, A. (2005). TSP with neighborhoods of varying size. Journal of Algorithms, 57(1), 22-36.
Back to Top

For support on your academic profile contact Research Support.