j Joachim Gudmundsson

Menu:

Contact:

Joachim Gudmundsson
School of IT
Building J12
University of Sydney
NSW 2006
Australia

Ph. 02 9351 4494
Mob 04 2307 0859

Links:

Journals

  1. J. Gudmundsson and C. Levcopoulos.
    Close approximations of minimum rectangular coverings. [pdf]
    Journal of Combinatorial Optimization 3 (4):437-452, December 1999.

  2. J. Gudmundsson and C. Levcopoulos.
    A fast approximation algorithm for TSP with neighborhoods. [pdf]
    Nordic Journal of Computing, 6(4):469-488, 1999.

  3. J. Gudmundsson and C. Levcopoulos.
    A parallel approximation algorithm for minimum weight triangulation. [pdf]
    Nordic Journal of Computing, 7(1):32-57, 2000.

  4. J. Gudmundsson, C. Levcopoulos and G. Narasimhan.
    Approximating a minimum Manhattan network. [pdf]
    Nordic Journal of Computing, 8(2):219-232, 2001.

  5. J. Gudmundsson, T. Husfeldt and C. Levcopoulos.
    Lower bounds for approximate polygon decomposition and minimum gap. [pdf]
    Information Processing Letters, 81(3):137-141, 2002.

  6. J. Gudmundsson, M. Hammar and M. van Kreveld.
    Higher order Delaunay triangulation. [pdf]
    Computational Geometry - Theory and Applications , 23(1):85-98, 2002.

  7. P. K. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar and H. J. Haverkort.
    Box-trees and R-trees with near-optimal query time. [pdf]
    Discrete and Computational Geometry, 28:291-312, 2002.

  8. J. Gudmundsson, C. Levcopoulos and G. Narasimhan.
    Improved greedy algorithm for constructing sparse geometric spanners. [pdf]
    SIAM Journal of Computing, 31(5):1479-1500, 2002.

  9. M. de Berg, J. Gudmundsson, M. Hammar and M. Overmars.
    On R-trees with low stabbing number. [pdf]
    Computational Geometry - Theory and Applications 24(3):179-195, 2003.

  10. M. Andersson, J. Gudmundsson, C. Levcopoulos and G. Narasimhan.
    Balanced Partition of Minimum Spanning Trees. [pdf]
    International Journal on Computational Geometry and Applications, 13(4):303-316, 2003.

  11. J. Gudmundsson, H. J. Haverkort, S.-M. Park, C.-S. Shin and A. Wolff.
    Approximating the geometric minimum-diameter spanning tree. [pdf]
    Computational Geometry - Theory and Applications, 27(1):87-106, 2004.

  12. J. Bose, J. Gudmundsson and P. Morin.
    Ordered theta graphs. [pdf]
    Computational Geometry - Theory and Applications, 28(1):11-18, 2004.

  13. H. J. Haverkort , M. de Berg and J. Gudmundsson.
    Box-Trees for Collision Checking in Industrial Installations. [pdf]
    Computational Geometry - Theory and Applications, 28(2-3):113-135, 2004.

  14. M. Andersson, J. Gudmundsson and C. Levcopoulos.
    Chips on Wafers. [pdf]
    Computational Geometry - Theory and Applications, 30(2):95-111, 2005.

  15. J. Bose, J. Gudmundsson and M. Smid.
    Constructing plane spanners of bounded degree and low weight. [pdf]
    Algoritmica 42: 249�264, 2005.

  16. J. Gudmundsson, H. J. Haverkort and M. van Kreveld.
    Constrained Higher Order Delaunay Triangulation. [pdf]
    Computational Geometry - Theory and Applications 30(3):271 - 277, 2005.

  17. M. de Berg, J. Gudmundsson, M. Katz, C. Levcopoulos, M. Overmars and F. van der Stappen.
    Constant factor approximation algorithms for TSPN with fat objects. [pdf]
    Journal of Algorithms, 57:22-36, 2005.

  18. J. Bose, O. Cheong, S. Cabello, J. Gudmundsson, M. van Kreveld and B. Speckmann.
    Area-preserving approximations of polygonal paths [pdf]
    Journal of Discrete Algorithms, 4(4):554-566, 2006.

  19. M. Andersson, J. Gudmundsson and C. Levcopoulos.
    Approximate distance oracles for graphs with dense clusters. [pdf]
    Computational Geometry - Theory and Applications, 37(3):142-154, 2007.

  20. J. Gudmundsson, G. Narasimhan and M. Smid.
    Distance-preserving approximations of polygonal paths. [pdf]
    Computational Geometry - Theory and Applications, 36(3):183-196, 2007.

  21. J. Gudmundsson, M. van Kreveld and B. Speckmann.
    Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets. [pdf]
    GeoInformatica, 11(2):195-215, 2007.

  22. J. Gudmundsson and C. Levcopoulos.
    Minimum weight pseudo-triangulations. [pdf]
    Computational Geometry - Theory and Applications, 38(3):139-153, 2007.

  23. M. Benkert, J. Gudmundsson, H. Haverkort and A. Wolff.
    Constructing Interference-Minimal Networks. [pdf]
    Computational Geometry - Theory and Applications, 40(3):207-219, 2008.

  24. B. Aronov, M. de Berg, O. Cheong, J. Gudmundsson, H. Haverkort and A. Vigneron.
    Sparse geometric graphs with small dilation. [pdf]
    Computational Geometry - Theory and Applications, 40(3):179-194, 2008.

  25. M. Farshi, P. Giannopoulos and J. Gudmundsson.
    Improving the stretch factor of a geometric graph by edge augmentation. [pdf]
    SIAM Journal on Computing, 38(1):226-240, 2008.

  26. J. Gudmundsson, C. Levopoulos, G. Narasimhan and M. Smid.
    Approximate Distance Oracles for Geometric Spanners. [pdf]
    ACM Transactions on Algorithms, 4(1), 2008. Merged version of [C11] and [C17].

  27. M. Benkert, J. Gudmundsson, F. Hubner and T. Wolle.
    Reporting Flock Patterns. [pdf]
    Computational Geometry - Theory and Applications, 41(3):11-125, 2008.

  28. H.-K. Ahn, S. W. Bae, O. Cheong and J. Gudmundsson.
    Aperture-Angle and Hausdorff-Approximation of Convex Figures. [pdf]
    Discrete and Computational Geometry, 40(3): 414-429, 2008.

  29. M. Andersson, J. Gudmundsson, P. Laube and T. Wolle.
    Reporting leaders and followers among trajectories of moving point objects. [pdf]
    GeoInformatica, 12(4):497-528, 2008.

  30. J. Gudmundsson, M. van Kreveld and G. Narasimhan.
    Region-restricted clustering for geographic data mining. [pdf]
    Computational Geometry - Theory and Applications, 42(3):231-240, 2009.

  31. M. Benkert, J. Gudmundsson, C. Knauer, R. van Oostrum and A. Wolff.
    A 2/3-approximation algorithm for a disc packing problem. [pdf]
    International Journal on Computational Geometry and Applications, 19(3):267-288, 2009.

  32. M. Andersson, J. Gudmundsson and C. Levcopoulos.
    Restricted mesh simplification using edge contractions. [pdf]
    International Journal on Computational Geometry and Applications, 19(3):247-265, 2009.

  33. J. Gudmundsson and M. Smid.
    On spanners of geometric graphs. [pdf]
    International Journal of Foundations of Computer Science, 20(1):135-150, 2009.

  34. M. Ali Abam, M. de Berg, M. Farshi and J. Gudmundsson.
    Region-fault tolerant geometric spanners. [pdf]
    Discrete and Computational Geometry, 41(4):556-582, 2009.

  35. M. Farshi and J. Gudmundsson.
    Experimental study of geometric t-spanners. [pdf]
    ACM Journal of Experimental Algorithmics, 14(1):3-39, 2009.
    Merged version of [C28] and [C44].

  36. J. Gudmundsson, J. Katajainen, D. Merrick, C. Ong and T. Wolle.
    Compressing spatio-temporal trajectories. [pdf]
    Computational Geometry - Theory and Applications, 42(9):825-841, 2009.

  37. L. Devroye, J. Gudmundsson and P. Morin.
    On the expected maximum degree of Gabriel and Yao graphs. [arXiv]
    Advances in Applied Probability, 41(4):1123-1140, 2009.

  38. M. Ali Abam, M. de Berg and J. Gudmundsson.
    A simple and efficient kinetic spanner. [pdf]
    Computational Geometry - Theory and Applications, 43(3):251-256, 2010.

  39. M. Benkert, B. Djordjevic, J. Gudmundsson and T. Wolle.
    Finding popular places. [pdf]
    International Journal on Computational Geometry and Applications, 20(1):19-42, 2010.

  40. K. Buchin, S. Cabello, J. Gudmundsson, M. Loffler, J. Luo, G. Rote, R. I. Silveira, B. Speckmann and T. Wolle.
    Finding the Most Relevant Fragments in Networks.
    Journal of Graph Algorithms and Applications, 14(2):307-336, 2010.

  41. K. Buchin, M. Buchin and J. Gudmundsson.
    Constrained free space diagrams: a tool for trajectory analysis. [pdf]
    International Journal of GIS, 24(7):1101-1125, 2010.

  42. F. Gieseke, J. Gudmundsson and J. Vahrenhold.
    Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies.
    Journal of Discrete Algorithms, 8(3):259-272, 2010.

  43. K. Buchin, M. Buchin, J. Gudmundsson, M. Loffler and J. Luo.
    Detecting Commuting Patterns by Clustering Subtrajectories. [pdf]
    International Journal on Computational Geometry and Applications, 21(3):253-282, 2011.

  44. B. Djordjevic, J. Gudmundsson, A. Pham and T. Wolle.
    Detecting Regular Visit Patterns. [pdf]
    Algorithmica, 60(4):829-852, 2011.

  45. J. Gudmundsson, P. Morin and M. Smid.
    Algorithms for marketing-mix optimization. [arXiv]
    Algorithmica, 60(4):1004-1016, 2011.

  46. M. Ali Abam, M. de Berg, M. Farshi, J. Gudmundsson and M. Smid.
    Geometric Spanners for Weighted Point Sets. [pdf]
    Algorithmica, 61(1):207-225, 2011.

  47. O. Cheong, H. Everett, M. Glisse, J. Gudmundsson, S. Hornus, S. Lazard, M. Lee and H.-S. Na.
    Farthest-polygon Voronoi diagrams. [pdf]
    Computational Geometry - Theory and Applications, 44(4):234-247, 2011.

  48. V. Dujmovic, J. Gudmundsson, P. Morin and T. Wolle.
    Notes on large angle crossing graphs. [pdf]
    Chicago Journal on Theoretical Computer Science, 2011(4):1-14, 2011.

  49. M. Benkert, J. Gudmundsson, D. Merrick and T. Wolle.
    Approximate one-to-one point pattern matching. [pdf]
    Journal of Discrete Algorithms, 15:1-15, 2012.

  50. M. de Berg, A. F. Cook IV and J. Gudmundsson.
    Fast Frechet Queries. [pdf]
    Computational Geometry - Theory and Applications, 46(6):747-755, 2013.

  51. R. El Shawi and J. Gudmundsson.
    Fast query structures in anisotropic media. [pdf]
    Theoretical Computer Science, 497:112-122, 2013.

  52. H.-K. Ahn, S. W. Bae, O. Cheong, J. Gudmundsson, T. Tokuyama and A. Vigneron.
    A Generalization of the Convex Kakeya Problem. [arXiv]
    To appear in Algorithmica.

  53. J. Gudmundsson and T. Wolle.
    Football analysis using spatio-temporal tools
    To appear in Computers, Environment and Urban Systems.

  54. O. Cheong, R. El Shawi and J. Gudmundsson.
    A fast algorithm for data collection along a fixed track.
    To appear in Theoretical Computer Science.

  55. R. El Shawi, J. Gudmundsson and C. Levopoulos.
    Quickest Path Queries on Transportation Network.
    To appear in Computational Geometry - Theory and Applications.

  56. F. Frati, S. Gaspers, J. Gudmundsson and L. Mathieson.
    Augmenting Graphs to Minimize the Diameter. [arXiv]
    To appear in Algorithmica.

  57. J. Gudmundsson and N. Valladares.
    A GPU approach to subtrajectory clustering using the Fréchet distance. [pdf]
    To appear in IEEE Transactions on Parallel and Distributed Systems.

    Refereed conferences

    1. C. Levcopoulos and J. Gudmundsson.
      Close approximations of minimum rectangular coverings. [pdf]
      FST&TCS 1996.

    2. C. Levcopoulos and J. Gudmundsson.
      Approximation algorithms for covering polygons with squares and similar problems. [pdf]
      RANDOM 1997.

    3. C. Levcopoulos and J. Gudmundsson.
      A linear-time approximation algorithm for minimum rectangular coverings. [pdf]
      FCT 1997.

      C. Levcopoulos and J. Gudmundsson.
      A parallel approximation algorithm for minimum weight triangulation. [pdf]
      FST&TCS 1998.

    4. C. Levcopoulos and J. Gudmundsson.
      A fast approximation algorithm for TSP with neighborhoods and red-blue separation. [pdf].
      COCOON 1999.

    5. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
      Approximating Minimum Manhattan Networks. [pdf]
      APPROX 1999.

    6. C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
      Improved greedy algorithm for constructing sparse geometric spanners. [pdf]
      SWAT 2000.

    7. M. Hammar, M. van Kreveld and J. Gudmundsson.
      Higher order Delaunay triangulation. [pdf]
      ESA 2000.

    8. M. de Berg, M. Hammar, M. Overmars and J. Gudmundsson.
      On R-trees with low stabbing number. [pdf]
      ESA 2000.

    9. P. K. Agarwal, M. de Berg, M. Hammar, H. J. Haverkort and J. Gudmundsson.
      Box-Trees and R-Trees with Near-Optimal Query Time. [pdf]
      ACM SoCG 2001.

    10. C. Levcopoulos, G. Narasimhan, M. Smid and J. Gudmundsson
      Approximate Distance Oracles for Geometric Graphs. [pdf]
      ACM-SIAM SODA 2002.

    11. M. Andersson, C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
      Balanced Partition of Minimum Spanning Trees. [pdf]
      CGA 2002. (Best paper).

    12. H. J. Haverkort, M. de Berg and J. Gudmundsson.
      Box-Trees for Collision Checking in Industrial Installations. [pdf]
      ACM SoCG 2002.

    13. M. de Berg, M. Katz, C. Levcopoulos, M. Overmars, F. van der Stappen and J. Gudmundsson.
      Constant factor approximation algorithms for TSPN with fat objects. [pdf]
      ESA 2002.

    14. J. Bose, M. Smid and J. Gudmundsson
      Constructing plane spanners of bounded degree and low weight. [pdf]
      ESA 2002.

    15. H. J. Haverkort, S.-M. Park, C.-S. Shin, A. Wolff and J. Gudmundsson.
      Approximating the geometric minimum-diameter spanning tree. [pdf]
      APPROX 2002.

    16. C. Levcopoulos, G. Narasimhan, M. Smid and J. Gudmundsson.
      Approximate Distance Oracles Revisited. [pdf]
      ISAAC, 2002. Tech. report TR-04-08. (Merge of [11] and [17])

    17. J. Gudmundsson.
      Constructing t-spanners with small separators.
      FCT 2003.
      [There is an error in the conference version of this paper.
      A full and (hopefully) correct version will be available within short.]

    18. M. Andersson, C. Levcopoulos and J. Gudmundsson.
      Chips on Wafers. [pdf]
      WADS 2003.

    19. G. Narasimhan, M. Smid and J. Gudmundsson.
      Distance-preserving approximations of polygonal paths. [pdf]
      FST&TCS 2003.

    20. M. Andersson, C. Levcopoulos and J. Gudmundsson.
      Approximate distance oracles for graphs with dense clusters. [pdf]
      ISAAC 2004.

    21. M. van Kreveld, B. Speckmann and J. Gudmundsson.
      Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets. [pdf]
      ACM GIS 2004.

    22. C. Levcopoulos and J. Gudmundsson.
      Minimum weight pseudo-triangulations [pdf]
      FST&TCS 2004.

    23. J. Vahrenhold and J. Gudmundsson.
      I/O-efficiently pruning dense spanners [pdf]
      JCDCG 2004.

    24. J. Bose, O. Cheong, S. Cabello, M. van Kreveld, B. Speckmann and J. Gudmundsson.
      Area-preserving approximations of polygonal paths [pdf]
      JCDCG 2004.

    25. G. Narasimhan, M. Smid and J. Gudmundsson
      Fast pruning of geometric spanners. [pdf]
      STACS 2005.

    26. M. Farshi, P. Giannopoulos and J. Gudmundsson.
      Finding the best shortcut in a geometric network [pdf]
      ACM SoCG 2005.

    27. M. Farshi and J. Gudmundsson.
      Experimental analysis of geometric t-spanners. [pdf]
      ESA 2005.

    28. B. Aronov, M. de Berg, O. Cheong, H. Haverkort, A. Vigneron and J. Gudmundsson.
      Sparse geometric graphs with small dilation [pdf]
      ISAAC 2005.

    29. M. Benkert, H. Haverkort, A. Wolff and J. Gudmundsson.
      Constructing Interference-Minimal Networks. [pdf]
      SOFSEM 2006.

    30. B. Aronov, P. Bose, E. D. Demaine, J. Iacono, S. Langerman, M. Smid and J. Gudmundsson.
      Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [pdf]
      LATIN 2006.

    31. M. Smid and J. Gudmundsson.
      On spanners of geometric graphs. [pdf]
      SWAT 2006.

    32. M. Andersson, C. Levcopoulos and J. Gudmundsson.
      Restricted Mesh Simplification Using Edge Contractions. [pdf]
      COCOON 2006.

    33. M. Benkert, C. Knauer, E. Moet, R. van Oostrum, A. Wolff and J. Gudmundsson.
      A 2/3-approximation algorithm for a disc packing problem. [pdf]
      COCOON 2006.

    34. M. Benkert, F. Hubner, T. Wolle and J. Gudmundsson.
      Reporting Flock Patterns. [pdf]
      ESA 2006.

    35. M. van Kreveld, G. Narasimhan and J. Gudmundsson.
      Region-Restricted Clustering for Geographic Data Mining. [pdf]
      ESA 2006.

    36. D. Merrick and J. Gudmundsson.
      C-Directed Path Simplification for Metro Map Layout. [pdf]
      GD 2006.

    37. D. Merrick, M. van Kreveld and J. Gudmundsson.
      Metro map with tree layouts. [pdf]
      GD 2006.

    38. M. van Kreveld and J. Gudmundsson.
      Computing longest duration flocks in spatio-temporal data. [pdf]
      ACM GIS 2006.

    39. M. Ali Abam, M. de Berg, M. Farshi and J. Gudmundsson.
      Region-Fault Tolerant Geometric Spanners. [pdf]
      ACM-SIAM SODA 2007.

    40. G. Al-Naymat, S. Chawla and J. Gudmundsson.
      Dimensionality reduction for long duration and complex spatio-temporal queries. [pdf]
      ACM SAC 2007.

    41. M. Andersson, P. Laube, T. Wolle and J. Gudmundsson.
      Leadership queries in trajectory data. [pdf]
      ACM SAC 2007.

    42. H.-K. Ahn, S. W. Bae, O. Cheong and J. Gudmundsson.
      Aperture-Angle and Hausdorff-Approximation of Convex Figures. [pdf]
      ACM SoCG 2007.

    43. M. Farshi and J. Gudmundsson.
      Experimental study of geometric t-spanners: a running time comparison. [pdf]
      WEA 2007.

    44. O. Cheong, H. Everett, M. Glisse, S. Hornus, S. Lazard, M. Lee, H.-S. Na and J. Gudmundsson.
      Farthest-polygon Voronoi diagrams. [pdf]
      ESA 2007.

    45. J. Katajainen, D. Merrick, C. Ong, T. Wolle and J. Gudmundsson.
      Compressing spatio-temporal trajectories. [pdf]
      ISAAC 2007.

    46. M. Benkert, B. Djordjevic, T. Wolle and J. Gudmundsson.
      Finding Popular Places. [pdf]
      ISAAC 2007.

    47. M. Asquith, D. Merrick and J. Gudmundsson.
      An ILP for the line ordering problem. [pdf]
      CATS 2008.

    48. M. Ali Abam, M. de Berg and J. Gudmundsson.
      A Simple and Efficient Kinetic Spanner. [pdf]
      ACM SoCG 2008.

    49. B. Djordjevic, A. Pham, T. Wolle and J. Gudmundsson.
      Detecting Regular Visit Patterns. [pdf]
      ESA 2008.

    50. K. Buchin, M. Buchin, Jun Luo, M. Löffler and J. Gudmundsson.
      Detecting Commuting Patterns by Clustering Subtrajectories. [pdf]
      ISAAC 2008.

    51. K. Buchin, M. Buchin and J. Gudmundsson.
      Detecting Single File Movement. [pdf]
      ACM GIS 2008.

    52. K. Buchin, S. Cabello, M. Löffler, J. Luo, G. Rote, R. Silveira, B. Speckmann, T. Wolle and J. Gudmundsson.
      Efficient Algorithms for Detecting Point Patterns on Networks. [pdf]
      AGILE 2009 (Best paper award!).

    53. O. Cheong, H.-S. Kim, D. Schymura, F. Stehn and J. Gudmundsson.
      Measuring the Similarity of Geometric Graphs. [pdf]
      SEA 2009.

    54. M. Ali Abam, M. de Berg, M. Farshi, M. Smid and J. Gudmundsson.
      Geometric Spanners for Weighted Point Sets. [pdf]
      ESA 2009.

    55. V. Dujmovic, P. Morin, T. Wolle and J. Gudmundsson.
      Notes on large angle crossing graphs. [arXiv]
      CATS 2010.

    56. P. Morin and J. Gudmundsson.
      Planar Visibility: Testing and Counting. [arXiv]
      SoCG 2010.

    57. B. Djordjevic and J. Gudmundsson.
      Detecting areas visited regularly. [pdf]
      COCOON 2010.

    58. R. El Shawi and J. Gudmundsson.
      Quickest Paths in Anisotropic Media.
      COCOA 2011.

    59. M. de Berg, A. F. Cook IV and J. Gudmundsson.
      Fast Frechet Queries. [pdf]
      ISAAC 2011.

    60. R. El Shawi, C. Levcopoulos and J. Gudmundsson.
      Quickest Path queries on transportation network. [arXiv]
      CATS 2012.

    61. W. Si, B. Scholz, G. Mao, R. Boreli, A. Zomaya and J. Gudmundsson.
      On Graphs Supporting Greedy Forwarding for Directional Wireless Networks.
      ICC 2012.

    62. H.-K. Ahn, S. W. Bae, O. Cheong, T. Tokuyama, A. Vigneron and J. Gudmundsson.
      A Generalization of the Convex Kakeya Problem. [pdf]
      LATIN 2012.

    63. F. Frati, E. Welzl and J. Gudmundsson.
      On the Number of Upward Planar Orientations of Maximal Planar Graphs. [pdf]
      ISAAC 2012.

    64. T. Wolle and J. Gudmundsson.
      Football analysis using spatio-temporal tools (short paper). [pdf]
      ACM SIGSPATIAL 2012.

    65. N. Valladares and J. Gudmundsson.
      A GPU approach to subtrajectory clustering using the Fréchet distance. [pdf]
      ACM SIGSPATIAL 2012.

    66. A. Thom, J. Vahrenhold and J. Gudmundsson.
      Of Motifs and Goals: Mining Trajectory Data. [pdf]
      ACM SIGSPATIAL 2012.

    67. O. Cheong, R. El Shawi and J. Gudmundsson.
      A fast algorithm for data collection along a fixed track. [pdf]
      COCOON 2013.

    68. M. Smid and J. Gudmundsson.
      Frechet queries in geometric trees. [pdf]
      ESA 2013.

    69. M. van Kreveld, F. Staals and J. Gudmundsson.
      Algorithms for Hotspot Computation on Trajectory Data
      ACM SIGSPATIAL 2013.

    70. P. Angelini, W. Evans, F. Frati and J. Gudmundsson.
      SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. [arXiv]
      ISAAC 2013.

    71. F. Frati, S. Gaspers, L. Mathieson and J. Gudmundsson.
      Augmenting Graphs to Minimize the Diameter. [arXiv]
      ISAAC 2013.

      Other publications

      1. M. Andersson, C. Levcopoulos, G. Narasimhan and J. Gudmundsson.
        Balanced Partition of Minimum Spanning Trees
        EWCG 2002.

      2. H. J. Haverkort, S.-M. Park, C.-S. Shin, A. Wolff and J. Gudmundsson.
        Approximating the geometric minimum-diameter spanning tree.
        EWCG 2002.

      3. J. Bose, P. Morin and J. Gudmundsson.
        Ordered theta graphs.
        CCCG 2002.

      4. M. Andersson, C. Levcopoulos and J. Gudmundsson.
        Chips on Wafers, or Packing Rectangles into Grids
        EWCG 2003.

      5. H. J. Haverkort, M. van Kreveld and J. Gudmundsson.
        Constrained Higher Order Delaunay Triangulation
        EWCG 2003.

      6. M. Andersson, C. Levcopoulos and J. Gudmundsson.
        Approximate distance oracles for graphs with dense clusters
        EWCG 2004.

      7. C. Levcopoulos and J. Gudmundsson.
        Minimum weight pseudo-triangulations
        EWCG 2004.

      8. M. Farshi, P. Giannopoulos and J. Gudmundsson.
        Finding the best shortcut in a geometric network
        EWCG 2005.

      9. M. Benkert, H. Haverkort, A. Wolff and J. Gudmundsson.
        Constructing Interference-Minimal Networks
        EWCG 2005.

      10. B. Aronov, P. Bose, E. D. Demaine, J. Iacono, S. Langerman, M. Smid and J. Gudmundsson.
        Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
        FWCG 2005.

      11. B. Aronov, M. de Berg, O. Cheong, H. Haverkort, A. Vigneron and J. Gudmundsson.
        Sparse geometric graphs with small dilation.
        WAAC 2005.

      12. D. Merrick and J. Gudmundsson.
        Increasing the Readability of Graph Drawings with Centrality-Based Scaling
        APVIS 2006.

      13. M. Andersson, C. Levcopoulos and J. Gudmundsson.
        Restricted mesh simplification using edge contractions
        EWCG 2006.

      14. M. Benkert, C. Knauer, E. Moet, R. van Oostrum, A. Wolff and Joachim Gudmundsson.
        A slow approximation algorithm for a geometric dispersion problem.
        EWCG 2006.

      15. M. Farshi and J. Gudmundsson.
        Computing the diameter of a t-spanner. [pdf]
        AIM 2006.

      16. O. Klein, C. Knauer, M. Smid and J. Gudmundsson.
        Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance. [pdf]
        EWCG 2007.

      17. O. Cheong, H. Everett, M. Glisse, S. Hornus, S. Lazard, M. Lee, H.-S. Na and J. Gudmundsson.
        Farthest-polygon Voronoi diagrams. [pdf]
        WAAC 2007.

      18. O. Cheong, H.-S. Kim, D. Schymura, F. Stehn and J. Gudmundsson.
        Measuring the similarity of geometric graphs. [pdf]
        EWCG 2009.

      19. T. Wolle and J. Gudmundsson.
        Towards Automated Football Analysis: Algorithms and Data Structures.
        ACMCS 2010.

      Theses, edited volumes and handbook chapters

      1. J. Gudmundsson,
        Covering Polygons with Rectangles,
        Masters thesis, LUNDFD6/NFCS-5081/1-36/1996,
        Department of Computer Science, Lund University, Sweden, 1996.

      2. J. Gudmundsson,
        Geometric Decompositions and Networks - Approximation Bounds and Algorithms,
        ISBN 91-7874-098-3, Ph. D. thesis, 2000.

      3. C. Knauer and J. Gudmundsson.
        Dilation and detour in geometric networks.
        Handbook on approximation algorithms and metaheuristics [pdf]
        Chapter 52, (Editor Teofilo Gonzalez). Chapman & Hall/CRC, 2006.

      4. B. Jay and J. Gudmundsson (Eds.).
        Proceedings of the 12th Computing: The Australasian Theory Symposium (CATS2006).
        CRPIT series Vol. 51, Hobart, Tasmania, Australia, January 2006.
        ISBN 1-920-68233-3.

      5. B. Jay and J. Gudmundsson (Eds.).
        Proceedings of the 13th Computing: The Australasian Theory Symposium (CATS2007).
        CRPIT series Vol. 65, Ballarat, Victoria, Australia, January 2007.
        ISBN 1-920-68246-5.

      6. M. de Berg, R. van Oostrum, B. Speckmann and J. Gudmundsson.
        Editorial foreword in special issue of EWCG'05 in
        Computational Geometry -Theory & Applications, 36(1):1, 2007.

      7. B. Jay and J. Gudmundsson.
        Editorial foreword in special issue of CATS'06 in
        International Journal of Foundations of Computer Science, 18(2):195, 2007.

      8. P. Laube, T. Wolle and J. Gudmundsson.
        Movement patterns in spatio-temporal data. [pdf]
        Encyclopedia of GIS,
        (S. Shekhar and H. Xiong, editors), Springer-Verlag, 2007.

      9. G. Narasimhan, M. Smid and J. Gudmundsson.
        Geometric spanners. [pdf]
        Encyclopedia of Algorithms,
        (M.-Y. Kao, editor), Springer-Verlag, 2008.

      10. G. Narasimhan, M. Smid and J. Gudmundsson.
        Plane geometric spanners. [pdf]
        Encyclopedia of Algorithms,
        (M.-Y. Kao, editor), Springer-Verlag, 2008.

      11. G. Narasimhan, M. Smid and J. Gudmundsson.
        Application of geometric spanner networks. [pdf]
        Encyclopedia of Algorithms,
        (M.-Y. Kao, editor), Springer-Verlag, 2008.

      12. J. Gudmundsson (Ed.).
        Proceedings of the 11th Scandinavian Workshop on Algorithm theory (SWAT 2008).
        Lecture Notes in Computer Science 5124, Springer-Verlag Berlin Heidelberg, 2008
        ISBN 3-540-69900-7.

      13. J. Gudmundsson.
        Editorial foreword in special issue of SWAT'08 in
        Algorithmica, 57(3):435, 2010.

      14. R. El Shawi and J. Gudmundsson.
        Shortest path in transportation network and weighted subdivisions.
        Graph Data Management: Techniques and Applications,
        Chapter 20, (S. Sakr and E. Pardede, editors). IGI Global, 2011.

      15. P. Laube, T. Wolle and J. Gudmundsson.
        Computational Movement Analysis.
        Handbook of Geographic Information,
        (W. Kresse and D. M. Danko, editors), Springer, 2011.