You are here: University of Sydney / Faculty of Engineering / About us / Academic staff / Dr Joachim Gudmundsson 

Dr Joachim Gudmundsson

SOAR Fellow
Associate Professor, ARC Future Fellow
Computational Geometry, Data Structures, Approximation Algorithms
School of Computer Science

J12 - Computer Science Building
The University of Sydney

Telephone +61 2 9351 4494

Website School of Computer Science

Sydney Algorithms and Computing Theory (SACT) research group

Research interests

Associate Professor Joachim Gudmundsson's research focuses on developing effective algorithms and data structures for geometric data. In particular, he analyses movement - of people, of animals, of traffic - of anything for which we want to know more about movement patterns.

"Early analysis of movement data was done manually - and it still is, to a large extent - but the recent explosion in the amount of tracking available data requires novel analytical tools to further enhance the information that can be extracted. Algorithms can be applied to many different applications to support the work of experts in particular areas.

"For example, I am currently working with ecologists in Israel, using algorithms to detect bird migration patterns. In this way we can better understand the birds' movements, and provide tools to improve the management of endangered species.

"I've also been working with sports analysts in France. Cameras record football player's movements during games, then we analyse the data, calculate all possible passes, identify each player's movements and map out alternative options if they are available. This information can then be used to find out each player's weak and strong points, to improve training exercises and to develop set pieces.

"My research basically involves working out a step-by-step description of how to solve problems. I really liked solving puzzles when I was a kid, and in my current work I'm just trying to solve bigger and more complicated problems. It's incredibly exciting to solve a problem that no one else has been able to solve - I get a genuine buzz from it.

"I've been working in this area for 15 years. I received a Future Fellowship from the Australian research Council three years ago, which has allowed me to continue develop my research."

Back to Top

Teaching and supervision

COMP5045 - Computational Geometry

Back to Top

Current research students

Project title Research student
Recognizing Complex Entity Mentions Xiang DAI
Appropriate Consensus Protocols for Blockchain Zhongli DONG
Rounding Linear Relaxations of Combinatorial Optimisation Problems Patrick EADES
Novel Data Structures for Advanced Computational Movement Analysis John PFEIFER
Back to Top

Associations

Back to Top

Awards and honours

Back to Top

In the media

    Back to Top

    International collaboration


      Domestic collaboration


        Back to Top

        Selected grants

        2019

        • SOAR Fellowship; Gudmundsson J; DVC Research/SOAR Fellowships.

        2018

        • Devising tools for big data sets to support computational movement analysis; Gudmundsson J; Australian Research Council (ARC)/Discovery Projects (DP).
        • Multimodal Neural Embeddings for Detecting Counterfeit Apps; Seneviratne S, Thilakarathna K, Gudmundsson J; Google (US)/Research Support.
        • Algorithms and data structures to support computational movement analysis; Gudmundsson J, van Kreveld M, L�ffler M; Office of Global Engagement/Partnership Collaboration Awards.

        2015

        • Local reoptimization for turbocharging heuristics; Gudmundsson J, Fellows M, Gaspers S, Mestre J, Fomin F; Australian Research Council (ARC)/Discovery Projects (DP).

        2011

        • 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. (2017). Movement Patterns in Spatio-Temporal Data. In Shashi Shekhar, Hui Xiong and Xun Zhou (Eds.), Encyclopedia of GIS 2017, (pp. 1362-1370). Cham: Springer International Publishing. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]

        Journals

        • Aronov, B., Bose, P., Demaine, E., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M. (2018). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica, 80(11), 3316-3334. [More Information]
        • de Berg, M., Gudmundsson, J., Mehr, M. (2018). Faster Algorithms for Computing Plurality Points. ACM Transactions on Algorithms, 14(3), 36:1-36:23. [More Information]
        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2018). Finding Pairwise Intersections Inside a Query Range. Algorithmica, 80(11), 3253-3269. [More Information]
        • Chawla, S., Estephan, J., Gudmundsson, J., Horton, M. (2017). Classification of Passes in Football Matches Using Spatiotemporal Data. ACM Transactions on Spatial Algorithms and Systems, 3(2), 1-30. [More Information]
        • Buchin, K., Buchin, M., Gudmundsson, J., Horton, M., Sijben, S. (2017). Compact flow diagrams for state sequences. ACM Journal of Experimental Algorithmics, 22(1), 1-23. [More Information]
        • Gudmundsson, J., Horton, M. (2017). Spatio-temporal analysis of team sports. ACM Computing Surveys, 50(2), 1-34. [More Information]
        • Gudmundsson, J., Katajainen, J. (2016). Editorial, SEA 2014 special issue. ACM Journal of Experimental Algorithmics, 21(1), 1-1. [More Information]
        • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2016). SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. Journal of Graph Theory, 82(1), 45-64. [More Information]
        • Gudmundsson, J., Valladares, N. (2015). A GPU Approach to Subrajectory Clustering Using the Frechet Distance. IEEE Transactions on Parallel and Distributed Systems, 26(4), 924-937. [More Information]
        • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2015). Augmenting Graphs to Minimize the Diameter. Algorithmica, 72(4), 995-1010. [More Information]
        • Gudmundsson, J., Smid, M. (2015). Fast algorithms for approximate Frechet matching queries in geometric trees. Computational Geometry, 48(6), 479-494. [More Information]
        • Dehkordi, H., Frati, F., Gudmundsson, J. (2015). Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications, 19(2), 761-778. [More Information]
        • Cheong, O., El Shawi, R., Gudmundsson, J. (2014). A fast algorithm for data collection along a fixed track. Theoretical Computer Science, 554, 254-262. [More Information]
        • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2014). A Generalization of the Convex Kakeya Problem. Algorithmica, 70(2), 152-170. [More Information]
        • Gudmundsson, J., Wolle, T. (2014). Football analysis using spatio-temporal tools. Computers, Environment and Urban Systems, 47, 16-27. [More Information]
        • Frati, F., Gudmundsson, J., Welzl, E. (2014). On the number of upward planar orientations of maximal planar graphs. Theoretical Computer Science, 544, 32-59. [More Information]
        • El Shawi, R., Gudmundsson, J., Levcopoulos, C. (2014). Quickest path queries on transportation network. Computational Geometry, 47(7), 695-709. [More Information]
        • de Berg, M., Cook IV, A., Gudmundsson, J. (2013). Fast Frechet queries. Computational Geometry, 46(6), 747-755. [More Information]
        • El Shawi, R., Gudmundsson, J. (2013). Fast query structures in anisotropic media. Theoretical Computer Science, 497, 112-122. [More Information]
        • Benkert, M., Gudmundsson, J., Merrick, D., Wolle, T. (2012). Approximate one-to-one point pattern matching. Journal of Discrete Algorithms (Amsterdam), 15, 1-15. [More Information]
        • Gudmundsson, J., Morin, P., Smid, M. (2011). Algorithms for Marketing-Mix Optimization. Algorithmica, 60(4), 1004-1016. [More Information]
        • 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. [More Information]
        • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2011). Detecting Regular Visit Patterns. Algorithmica, 60(4), 829-852. [More Information]
        • 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. [More Information]
        • Abam, M., Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2011). Geometric Spanners for Weighted Point Sets. Algorithmica, 61(1), 207-225. [More Information]
        • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2011). Notes on Large Angle Crossing Graphs. Chicago Journal of Theoretical Computer Science, 2011, 1-14. [More Information]
        • Abam, M., de Berg, M., Gudmundsson, J. (2010). A simple and efficient kinetic spanner. Computational Geometry, 43(3), 251-256. [More Information]
        • 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. [More Information]
        • Gudmundsson, J. (2010). Editorial, SWAT 2008 Special Issue. Algorithmica, 57(3), 435. [More Information]
        • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2010). Finding Popular Places. International Journal of Computational Geometry and Applications, 20(1), 19-42. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2009). Compressing spatio-temporal trajectories. Computational Geometry, 42(9), 825-841. [More Information]
        • Farshi, M., Gudmundsson, J. (2009). Experimental Study of Geometric t-Spanners. ACM Journal of Experimental Algorithmics, 14, 1.3:1-1.3:39. [More Information]
        • Gudmundsson, J., Smid, M. (2009). On Spanners of Geometric Graphs. International Journal of Foundations of Computer Science, 20(1), 135-149. [More Information]
        • 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. [More Information]
        • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2009). Region-Fault Tolerant Geometric Spanners. Discrete and Computational Geometry, 41(4), 556-582. [More Information]
        • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2009). Region-restricted clustering for geographic data mining. Computational Geometry, 42(3), 231-240. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2009). Restricted Mesh Simplification Using Edge Contractions. International Journal of Computational Geometry and Applications, 19(3), 247-265. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2008). Reporting flock patterns. Computational Geometry, 41(3), 111-125. [More Information]
        • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2008). Reporting Leaders and Followers among Trajectories of Moving Point Objects. Geoinformatica, 12(4), 497-528. [More Information]
        • 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. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2007). Approximate distance oracles for graphs with dense clusters. Computational Geometry, 37(3), 142-154. [More Information]
        • Gudmundsson, J., Narasimhan, G., Smid, M. (2007). Distance-preserving approximations of polygonal paths. Computational Geometry, 36(3), 183-196. [More Information]
        • 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. [More Information]
        • Gudmundsson, J., van Kreveld, M., Speckmann, B. (2007). Efficient Detection of Patterns in 2D Trajectories of Moving Points. Geoinformatica, 11(2), 195-215. [More Information]
        • Gudmundsson, J., Levcopoulos, C. (2007). Minimum weight pseudo-triangulations. Computational Geometry, 38(3), 139-153. [More Information]
        • Gudmundsson, J., Jay, B. (2007). Preface - Special Issue: Selected Papers from CATS 2006. International Journal of Foundations of Computer Science, 18(2), 195-196. [More Information]
        • 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. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2005). Chips on wafers, or packing rectangles into grids. Computational Geometry, 30(2), 95-111. [More Information]
        • Gudmundsson, J., Haverkort, H., van Kreveld, M. (2005). Constrained higher order Delaunay triangulations. Computational Geometry, 30(3), 271-277. [More Information]
        • Bose, P., Gudmundsson, J., Smid, M. (2005). Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica, 42(3-4), 249-264. [More Information]
        • 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. [More Information]

        Edited Journals

        • Gudmundsson, J. (2010). Algorithmica Volume 57, Number 3. Algorithmica, 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., Mohades, A., Mirzanezhad, M., Wenk, C. (2018). Fast frechet distance between curves with long edges. 3rd International Workshop on Interactive and Spatial Computing (IWISC 2018), New York: Association for Computing Machinery (ACM). [More Information]
        • Gudmundsson, J., Kostitsyna, I., Loffler, M., Muller, T., Sacristan, V., Silveira, R. (2018). Theoretical analysis of beaconless geocast protocols in 1D. 15th Workshop on Analytic Algorithms and Combinatorics (ANALCO 2018), New Orleans: SIAM Publications. [More Information]
        • Gaspers, S., Gudmundsson, J., Horton, M., Rummele, S. (2018). When is red-blue nonblocker fixed-parameter tractable? 13th International Symposium on Latin American Theoretical Informatics (LATIN 2018), Cham: Springer. [More Information]
        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2017). A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2017), New York: Association for Computing Machinery (ACM). [More Information]
        • Chung, Y., Gudmundsson, J., Takatsuka, M. (2017). A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns. The 24th International Conference On Neural Information Processing (ICONIP 2017) (proceedings part V), Cham: Springer. [More Information]
        • Gaspers, S., Gudmundsson, J., Mestre, J., Rummele, S. (2017). Barrier coverage with non-uniform lengths to minimize aggregate movements. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Cherry, A., Gudmundsson, J., Mestre, J. (2017). Barrier coverage with uniform radii in 2D. 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Cham: Springer Verlag. [More Information]
        • Gudmundsson, J., Smid, M. (2017). Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017. 29th Canadian Conference on Computational Geometry (CCCG 2017), Ottawa.
        • Gudmundsson, J., Pagh, R. (2017). Range-efficient consistent sampling and locality-sensitive hashing for polygons. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Bae, S., de Berg, M., Cheong, O., Gudmundsson, J., Levcopoulos, C. (2017). Shortcuts for the circle. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Gaspers, S., Gudmundsson, J., Jones, M., Mestre, J., Ruemmele, S. (2017). Turbocharging Treewidth Heuristics. 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Leibniz: Schloss Dagstuhl - Leibniz Center for Informatics. [More Information]
        • Buchin, K., Buchin, M., Gudmundsson, J., Horton, M., Sijben, S. (2016). Compact flow diagrams for state sequences. 15th International Symposium on Experimental Algorithms (SEA 2016), Cham: Springer. [More Information]
        • de Berg, M., Gudmundsson, J., Mehr, M. (2016). Faster Algorithms for Computing Plurality Points. The 32nd International Symposium on Computational Geometry (SoCG 2016), Saarbrucken/Wadern: Schloss Dagstuhl. [More Information]
        • Konzack, M., McKetterick, T., Wilcox, G., Buchin, M., Giuggioli, L., Gudmundsson, J., Westenberg, M., Buchin, K. (2015). Analyzing Delays in Trajectories. 2015 8th IEEE Pacific Visualization Symposium (PacificVis 2015), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
        • Horton, M., Gudmundsson, J., Chawla, S., Estephan, J. (2015). Automated Classification of Passing in Football. 19th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2015), Switzerland: Springer. [More Information]
        • Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T. (2015). Computational Aspects of Multi-Winner Approval Voting. International Conference on Autonomous Agents & Multiagent Systems 2015, New York: ACM.
        • Grosse, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F. (2015). Fast Algorithms for Diameter-Optimally Augmenting Paths. The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Berlin: Springer-Verlag. [More Information]
        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2015). Finding Pairwise Intersections Inside a Query Range. 14th International Symposium, WADS Algorithms and Data Structures, Cham, Switzerland: Springer Lecture Notes in Computer Science. [More Information]
        • Aziz, H., Gaspers, S., Gudmundsson, J., Mestre, J., Taeubig, H. (2015). Welfare Maximization in Fractional Hedonic Games. 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires: AAAI Press.
        • Dehkordi, H., Frati, F., Gudmundsson, J. (2014). Increasing-Chord Graphs On Point Sets. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
        • Gudmundsson, J., van Kreveld, M., Staals, F. (2013). Algorithms for hotspot computation on trajectory data. 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, New York, NY, USA: Association for Computing Machinery (ACM). [More Information]
        • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2013). Augmenting graphs to minimize the diameter. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
        • Gudmundsson, J., Smid, M. (2013). Frechet Queries in Geometric Trees. 21st Annual European Symposium on Algorithms (ESA 2013), Heidelberg: Springer. [More Information]
        • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2013). SEFE with no mapping via large induced outerplane graphs in plane graphs. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
        • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2012). A Generalization of the Convex Kakeya Problem. 10th Latin American Symposium on Theoretical Informatics (LATIN 2012), Berlin: Springer. [More Information]
        • 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). [More Information]
        • 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). [More Information]
        • 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). [More Information]
        • 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), Ottawa, Canada: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • El Shawi, R., Gudmundsson, J. (2011). Quickest Paths in Anisotropic Media. 5th International Conference on Combinatorial Optimization and Applications (COCOA 2011), Berlin: Springer. [More Information]
        • Djordjevic, B., Gudmundsson, J. (2010). Detecting Areas Visited Regularly. 16th Annual International Computing and Combinatorics Conference COCOON 2010, Germany: Springer. [More Information]
        • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2010). Notes on Large Angle Crossing Graphs. 16th Computing: The Australasian Theory Symposium CATS 2010, Sydney: Australian Computer Society.
        • Gudmundsson, J., Morin, P. (2010). Planar Visibility: Testing and Counting. 26th Annual Symposium on Computational Geometry (SoCG 2010), New York: Association for Computing Machinery (ACM). [More Information]
        • Gudmundsson, J., Wolle, T. (2010). Towards Automated Football Analysis: Algorithms and Data Structures. 10th Australasian Conference on Mathematics and Computers in Sport MCS 2010, Darwin: 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. [More Information]
        • 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. [More Information]
        • Abam, M., de Berg, M., Gudmundsson, J. (2008). A Simple and Efficient Kinetic Spanner. 24th Annual ACM Symposium on Computational Geometry SoCG 2008, New York: Association for Computing Machinery (ACM). [More Information]
        • 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, Sydney: 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, Berlin: Springer. [More Information]
        • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2008). Detecting Regular Visit Patterns. 16th Annual European Symposium on Algorithms ESA 2008, Germany: Springer. [More Information]
        • 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, New York: Association for Computing Machinery (ACM). [More Information]
        • 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). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2007). Finding Popular Places. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer. [More Information]
        • Merrick, D., Gudmundsson, J. (2007). Path Simplification for Metro Map Layout. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer. [More Information]
        • 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). [More Information]
        • Gudmundsson, J., van Kreveld, M., Merrick, D. (2007). Schematisation of Tree Drawings. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer. [More Information]
        • 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. [More Information]
        • 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). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2006). Reporting Flock Patterns. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2006). Restricted Mesh Simplification Using Edge Contractions. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer. [More Information]
        • 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). [More Information]
        • 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. [More Information]

        Reference Works

        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Applications of Geometric Spanner Networks. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 86-90). New York: Springer Science+Business Media.
        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 846-852). New York: Springer Science+Business Media.
        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Planar Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 1570-1574). New York: Springer Science+Business Media.
        • 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.

        2018

        • Aronov, B., Bose, P., Demaine, E., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M. (2018). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica, 80(11), 3316-3334. [More Information]
        • Gudmundsson, J., Mohades, A., Mirzanezhad, M., Wenk, C. (2018). Fast frechet distance between curves with long edges. 3rd International Workshop on Interactive and Spatial Computing (IWISC 2018), New York: Association for Computing Machinery (ACM). [More Information]
        • de Berg, M., Gudmundsson, J., Mehr, M. (2018). Faster Algorithms for Computing Plurality Points. ACM Transactions on Algorithms, 14(3), 36:1-36:23. [More Information]
        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2018). Finding Pairwise Intersections Inside a Query Range. Algorithmica, 80(11), 3253-3269. [More Information]
        • Gudmundsson, J., Kostitsyna, I., Loffler, M., Muller, T., Sacristan, V., Silveira, R. (2018). Theoretical analysis of beaconless geocast protocols in 1D. 15th Workshop on Analytic Algorithms and Combinatorics (ANALCO 2018), New Orleans: SIAM Publications. [More Information]
        • Gaspers, S., Gudmundsson, J., Horton, M., Rummele, S. (2018). When is red-blue nonblocker fixed-parameter tractable? 13th International Symposium on Latin American Theoretical Informatics (LATIN 2018), Cham: Springer. [More Information]

        2017

        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2017). A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2017), New York: Association for Computing Machinery (ACM). [More Information]
        • Chung, Y., Gudmundsson, J., Takatsuka, M. (2017). A Visual Analysis of Changes to Weighted Self-Organizing Map Patterns. The 24th International Conference On Neural Information Processing (ICONIP 2017) (proceedings part V), Cham: Springer. [More Information]
        • Gaspers, S., Gudmundsson, J., Mestre, J., Rummele, S. (2017). Barrier coverage with non-uniform lengths to minimize aggregate movements. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Cherry, A., Gudmundsson, J., Mestre, J. (2017). Barrier coverage with uniform radii in 2D. 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Cham: Springer Verlag. [More Information]
        • Chawla, S., Estephan, J., Gudmundsson, J., Horton, M. (2017). Classification of Passes in Football Matches Using Spatiotemporal Data. ACM Transactions on Spatial Algorithms and Systems, 3(2), 1-30. [More Information]
        • Buchin, K., Buchin, M., Gudmundsson, J., Horton, M., Sijben, S. (2017). Compact flow diagrams for state sequences. ACM Journal of Experimental Algorithmics, 22(1), 1-23. [More Information]
        • Gudmundsson, J., Laube, P., Wolle, T. (2017). Movement Patterns in Spatio-Temporal Data. In Shashi Shekhar, Hui Xiong and Xun Zhou (Eds.), Encyclopedia of GIS 2017, (pp. 1362-1370). Cham: Springer International Publishing. [More Information]
        • Gudmundsson, J., Smid, M. (2017). Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017. 29th Canadian Conference on Computational Geometry (CCCG 2017), Ottawa.
        • Gudmundsson, J., Pagh, R. (2017). Range-efficient consistent sampling and locality-sensitive hashing for polygons. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Bae, S., de Berg, M., Cheong, O., Gudmundsson, J., Levcopoulos, C. (2017). Shortcuts for the circle. 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
        • Gudmundsson, J., Horton, M. (2017). Spatio-temporal analysis of team sports. ACM Computing Surveys, 50(2), 1-34. [More Information]
        • Gaspers, S., Gudmundsson, J., Jones, M., Mestre, J., Ruemmele, S. (2017). Turbocharging Treewidth Heuristics. 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Leibniz: Schloss Dagstuhl - Leibniz Center for Informatics. [More Information]

        2016

        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Applications of Geometric Spanner Networks. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 86-90). New York: Springer Science+Business Media.
        • Buchin, K., Buchin, M., Gudmundsson, J., Horton, M., Sijben, S. (2016). Compact flow diagrams for state sequences. 15th International Symposium on Experimental Algorithms (SEA 2016), Cham: Springer. [More Information]
        • Gudmundsson, J., Katajainen, J. (2016). Editorial, SEA 2014 special issue. ACM Journal of Experimental Algorithmics, 21(1), 1-1. [More Information]
        • de Berg, M., Gudmundsson, J., Mehr, M. (2016). Faster Algorithms for Computing Plurality Points. The 32nd International Symposium on Computational Geometry (SoCG 2016), Saarbrucken/Wadern: Schloss Dagstuhl. [More Information]
        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 846-852). New York: Springer Science+Business Media.
        • Gudmundsson, J., Narasimhan, G., Smid, M. (2016). Planar Geometric Spanners. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms. (pp. 1570-1574). New York: Springer Science+Business Media.
        • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2016). SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. Journal of Graph Theory, 82(1), 45-64. [More Information]

        2015

        • Gudmundsson, J., Valladares, N. (2015). A GPU Approach to Subrajectory Clustering Using the Frechet Distance. IEEE Transactions on Parallel and Distributed Systems, 26(4), 924-937. [More Information]
        • Konzack, M., McKetterick, T., Wilcox, G., Buchin, M., Giuggioli, L., Gudmundsson, J., Westenberg, M., Buchin, K. (2015). Analyzing Delays in Trajectories. 2015 8th IEEE Pacific Visualization Symposium (PacificVis 2015), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
        • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2015). Augmenting Graphs to Minimize the Diameter. Algorithmica, 72(4), 995-1010. [More Information]
        • Horton, M., Gudmundsson, J., Chawla, S., Estephan, J. (2015). Automated Classification of Passing in Football. 19th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2015), Switzerland: Springer. [More Information]
        • Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T. (2015). Computational Aspects of Multi-Winner Approval Voting. International Conference on Autonomous Agents & Multiagent Systems 2015, New York: ACM.
        • Gudmundsson, J., Smid, M. (2015). Fast algorithms for approximate Frechet matching queries in geometric trees. Computational Geometry, 48(6), 479-494. [More Information]
        • Grosse, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F. (2015). Fast Algorithms for Diameter-Optimally Augmenting Paths. The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Berlin: Springer-Verlag. [More Information]
        • de Berg, M., Gudmundsson, J., Mehrabi, A. (2015). Finding Pairwise Intersections Inside a Query Range. 14th International Symposium, WADS Algorithms and Data Structures, Cham, Switzerland: Springer Lecture Notes in Computer Science. [More Information]
        • Dehkordi, H., Frati, F., Gudmundsson, J. (2015). Increasing-Chord Graphs On Point Sets. Journal of Graph Algorithms and Applications, 19(2), 761-778. [More Information]
        • Aziz, H., Gaspers, S., Gudmundsson, J., Mestre, J., Taeubig, H. (2015). Welfare Maximization in Fractional Hedonic Games. 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires: AAAI Press.

        2014

        • Cheong, O., El Shawi, R., Gudmundsson, J. (2014). A fast algorithm for data collection along a fixed track. Theoretical Computer Science, 554, 254-262. [More Information]
        • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2014). A Generalization of the Convex Kakeya Problem. Algorithmica, 70(2), 152-170. [More Information]
        • Gudmundsson, J., Wolle, T. (2014). Football analysis using spatio-temporal tools. Computers, Environment and Urban Systems, 47, 16-27. [More Information]
        • Dehkordi, H., Frati, F., Gudmundsson, J. (2014). Increasing-Chord Graphs On Point Sets. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
        • Frati, F., Gudmundsson, J., Welzl, E. (2014). On the number of upward planar orientations of maximal planar graphs. Theoretical Computer Science, 544, 32-59. [More Information]
        • El Shawi, R., Gudmundsson, J., Levcopoulos, C. (2014). Quickest path queries on transportation network. Computational Geometry, 47(7), 695-709. [More Information]

        2013

        • Gudmundsson, J., van Kreveld, M., Staals, F. (2013). Algorithms for hotspot computation on trajectory data. 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, New York, NY, USA: Association for Computing Machinery (ACM). [More Information]
        • Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L. (2013). Augmenting graphs to minimize the diameter. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
        • de Berg, M., Cook IV, A., Gudmundsson, J. (2013). Fast Frechet queries. Computational Geometry, 46(6), 747-755. [More Information]
        • El Shawi, R., Gudmundsson, J. (2013). Fast query structures in anisotropic media. Theoretical Computer Science, 497, 112-122. [More Information]
        • Gudmundsson, J., Smid, M. (2013). Frechet Queries in Geometric Trees. 21st Annual European Symposium on Algorithms (ESA 2013), Heidelberg: Springer. [More Information]
        • Angelini, P., Evans, W., Frati, F., Gudmundsson, J. (2013). SEFE with no mapping via large induced outerplane graphs in plane graphs. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]

        2012

        • Ahn, H., Bae, S., Cheong, O., Gudmundsson, J., Tokuyama, T., Vigneron, A. (2012). A Generalization of the Convex Kakeya Problem. 10th Latin American Symposium on Theoretical Informatics (LATIN 2012), Berlin: Springer. [More Information]
        • 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). [More Information]
        • Benkert, M., Gudmundsson, J., Merrick, D., Wolle, T. (2012). Approximate one-to-one point pattern matching. Journal of Discrete Algorithms (Amsterdam), 15, 1-15. [More Information]
        • 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. [More Information]
        • 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). [More Information]
        • 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). [More Information]
        • 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), Ottawa, Canada: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
        • 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. [More Information]
        • 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. [More Information]

        2011

        • Gudmundsson, J., Morin, P., Smid, M. (2011). Algorithms for Marketing-Mix Optimization. Algorithmica, 60(4), 1004-1016. [More Information]
        • 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. [More Information]
        • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2011). Detecting Regular Visit Patterns. Algorithmica, 60(4), 829-852. [More Information]
        • 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. [More Information]
        • de Berg, M., Cook IV, A., Gudmundsson, J. (2011). Fast Frechet Queries. 22nd International Symposium on Algorithms and Computation ISAAC 2011, Heidelberg, Germany: Springer. [More Information]
        • Abam, M., Berg, M., Farshi, M., Gudmundsson, J., Smid, M. (2011). Geometric Spanners for Weighted Point Sets. Algorithmica, 61(1), 207-225. [More Information]
        • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2011). Notes on Large Angle Crossing Graphs. Chicago Journal of Theoretical Computer Science, 2011, 1-14. [More Information]
        • El Shawi, R., Gudmundsson, J. (2011). Quickest Paths in Anisotropic Media. 5th International Conference on Combinatorial Optimization and Applications (COCOA 2011), Berlin: Springer. [More Information]

        2010

        • Abam, M., de Berg, M., Gudmundsson, J. (2010). A simple and efficient kinetic spanner. Computational Geometry, 43(3), 251-256. [More Information]
        • Gudmundsson, J. (2010). Algorithmica Volume 57, Number 3. Algorithmica, 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. [More Information]
        • Djordjevic, B., Gudmundsson, J. (2010). Detecting Areas Visited Regularly. 16th Annual International Computing and Combinatorics Conference COCOON 2010, Germany: Springer. [More Information]
        • Gudmundsson, J. (2010). Editorial, SWAT 2008 Special Issue. Algorithmica, 57(3), 435. [More Information]
        • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2010). Finding Popular Places. International Journal of Computational Geometry and Applications, 20(1), 19-42. [More Information]
        • 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. [More Information]
        • Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T. (2010). Notes on Large Angle Crossing Graphs. 16th Computing: The Australasian Theory Symposium CATS 2010, Sydney: Australian Computer Society.
        • Gudmundsson, J., Morin, P. (2010). Planar Visibility: Testing and Counting. 26th Annual Symposium on Computational Geometry (SoCG 2010), New York: Association for Computing Machinery (ACM). [More Information]
        • 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. [More Information]
        • Gudmundsson, J., Wolle, T. (2010). Towards Automated Football Analysis: Algorithms and Data Structures. 10th Australasian Conference on Mathematics and Computers in Sport MCS 2010, Darwin: 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. [More Information]
        • Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T. (2009). Compressing spatio-temporal trajectories. Computational Geometry, 42(9), 825-841. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Gudmundsson, J., Smid, M. (2009). On Spanners of Geometric Graphs. International Journal of Foundations of Computer Science, 20(1), 135-149. [More Information]
        • 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. [More Information]
        • Abam, M., de Berg, M., Farshi, M., Gudmundsson, J. (2009). Region-Fault Tolerant Geometric Spanners. Discrete and Computational Geometry, 41(4), 556-582. [More Information]
        • Gudmundsson, J., van Kreveld, M., Narasimhan, G. (2009). Region-restricted clustering for geographic data mining. Computational Geometry, 42(3), 231-240. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2009). Restricted Mesh Simplification Using Edge Contractions. International Journal of Computational Geometry and Applications, 19(3), 247-265. [More Information]

        2008

        • Abam, M., de Berg, M., Gudmundsson, J. (2008). A Simple and Efficient Kinetic Spanner. 24th Annual ACM Symposium on Computational Geometry SoCG 2008, New York: Association for Computing Machinery (ACM). [More Information]
        • 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, Sydney: 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. [More Information]
        • 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. [More Information]
        • 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, Berlin: Springer. [More Information]
        • Djordjevic, B., Gudmundsson, J., Pham, A., Wolle, T. (2008). Detecting Regular Visit Patterns. 16th Annual European Symposium on Algorithms ESA 2008, Germany: Springer. [More Information]
        • 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, New York: Association for Computing Machinery (ACM). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Andersson, M., Gudmundsson, J., Laube, P., Wolle, T. (2008). Reporting Leaders and Followers among Trajectories of Moving Point Objects. Geoinformatica, 12(4), 497-528. [More Information]
        • 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. [More Information]

        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). [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2007). Approximate distance oracles for graphs with dense clusters. Computational Geometry, 37(3), 142-154. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Gudmundsson, J., van Kreveld, M., Speckmann, B. (2007). Efficient Detection of Patterns in 2D Trajectories of Moving Points. Geoinformatica, 11(2), 195-215. [More Information]
        • Farshi, M., Gudmundsson, J. (2007). Experimental Study of Geometric t-Spanners: A Running Time Comparison. 6th International Workshop Experimental Algorithms WEA 2007, Germany: Springer. [More Information]
        • 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. [More Information]
        • Benkert, M., Djordjevic, B., Gudmundsson, J., Wolle, T. (2007). Finding Popular Places. 18th Annual International Symposium on Algorithms and Computation ISAAC 2007, Germany: Springer. [More Information]
        • 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. [More Information]
        • Merrick, D., Gudmundsson, J. (2007). Path Simplification for Metro Map Layout. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer. [More Information]
        • Gudmundsson, J., Jay, B. (2007). Preface - Special Issue: Selected Papers from CATS 2006. International Journal of Foundations of Computer Science, 18(2), 195-196. [More Information]
        • 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). [More Information]
        • Gudmundsson, J., van Kreveld, M., Merrick, D. (2007). Schematisation of Tree Drawings. 14th International Symposium on Graph Drawing GD 2006, Germany: Springer. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • 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. [More Information]
        • Benkert, M., Gudmundsson, J., Hubner, F., Wolle, T. (2006). Reporting Flock Patterns. 14th Annual European Symposium on Algorithms ESA 2006, Germany: Springer. [More Information]
        • Andersson, M., Gudmundsson, J., Levcopoulos, C. (2006). Restricted Mesh Simplification Using Edge Contractions. 12th Annual International Computing and Combinatorics Conference COCOON 2006, Germany: Springer. [More Information]
        • 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. [More Information]
        • Gudmundsson, J., Haverkort, H., van Kreveld, M. (2005). Constrained higher order Delaunay triangulations. Computational Geometry, 30(3), 271-277. [More Information]
        • Bose, P., Gudmundsson, J., Smid, M. (2005). Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica, 42(3-4), 249-264. [More Information]
        • 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). [More Information]
        • 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. [More Information]
        • 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. [More Information]
        Back to Top

        For support on your academic profile contact .