The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joachim Gudmundsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility Location and the Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:146-160 [Conf]
  2. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:17-21 [Conf]
  3. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Restricted Mesh Simplification Using Edge Contractions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:196-204 [Conf]
  4. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:166-175 [Conf]
  5. Joachim Gudmundsson, Christos Levcopoulos
    A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:473-482 [Conf]
  6. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-trees and R-trees with near-optimal query time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:124-133 [Conf]
  7. Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
    Finding the best shortcut in a geometric network. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:327-335 [Conf]
  8. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:53-62 [Conf]
  9. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
    Aperture-angle and Hausdorff-approximation of convex figures. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:37-45 [Conf]
  10. Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle
    Reporting Flock Patterns. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:660-671 [Conf]
  11. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:167-178 [Conf]
  12. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:187-199 [Conf]
  13. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:234-246 [Conf]
  14. Mohammad Farshi, Joachim Gudmundsson
    Experimental Study of Geometric t-Spanners. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:556-567 [Conf]
  15. Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
    Higher Order Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:232-243 [Conf]
  16. Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan
    Region-Restricted Clustering for Geographic Data Mining. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:399-410 [Conf]
  17. Joachim Gudmundsson
    Constructing Sparse t-Spanners with Small Separators. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:86-97 [Conf]
  18. Christos Levcopoulos, Joachim Gudmundsson
    A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:305-316 [Conf]
  19. Joachim Gudmundsson, Christos Levcopoulos
    Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:299-310 [Conf]
  20. Joachim Gudmundsson, Christos Levcopoulos
    A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:233-244 [Conf]
  21. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-Preserving Approximations of Polygonal Paths. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:217-228 [Conf]
  22. Christos Levcopoulos, Joachim Gudmundsson
    Close Approximation of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:135-146 [Conf]
  23. Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick
    Schematisation of Tree Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:66-76 [Conf]
  24. Damian Merrick, Joachim Gudmundsson
    Path Simplification for Metro Map Layout. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:258-269 [Conf]
  25. Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Efficient detection of motion patterns in spatio-temporal data sets. [Citation Graph (0, 0)][DBLP]
    GIS, 2004, pp:250-257 [Conf]
  26. Joachim Gudmundsson, Marc J. van Kreveld
    Computing longest duration flocks in trajectory data. [Citation Graph (0, 0)][DBLP]
    GIS, 2006, pp:35-42 [Conf]
  27. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2002, pp:26-35 [Conf]
  28. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Approximate Distance Oracles for Graphs with Dense Clusters. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:53-64 [Conf]
  29. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
    Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:50-59 [Conf]
  30. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate Distance Oracles Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:357-368 [Conf]
  31. Joachim Gudmundsson, Jan Vahrenhold
    I/O-Efficiently Pruning Dense Spanners. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:106-116 [Conf]
  32. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  33. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:28-38 [Conf]
  34. Christos Levcopoulos, Joachim Gudmundsson
    Approximation Algorithms for Covering Polygons with Squares and Similar Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:27-41 [Conf]
  35. Mattias Andersson, Joachim Gudmundsson, Patrick Laube, Thomas Wolle
    Reporting leadership patterns among trajectories. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:3-7 [Conf]
  36. Ghazi Al-Naymat, Sanjay Chawla, Joachim Gudmundsson
    Dimensionality reduction for long duration and complex spatio-temporal queries. [Citation Graph (0, 0)][DBLP]
    SAC, 2007, pp:393-397 [Conf]
  37. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate distance oracles for geometric graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:828-837 [Conf]
  38. Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
    Constructing Interference-Minimal Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:166-176 [Conf]
  39. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Fast Pruning of Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:508-520 [Conf]
  40. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:314-327 [Conf]
  41. Joachim Gudmundsson, Michiel H. M. Smid
    On Spanners of Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:388-399 [Conf]
  42. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Chips on Wafers. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:412-423 [Conf]
  43. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:249-264 [Journal]
  44. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
    On R-trees with low query complexity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:179-195 [Journal]
  45. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Chips on wafers, or packing rectangles into grids. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:95-111 [Journal]
  46. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:11-18 [Journal]
  47. Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
    Higher order Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:85-98 [Journal]
  48. Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld
    Constrained higher order Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:271-277 [Journal]
  49. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility location and the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:87-106 [Journal]
  50. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:113-135 [Journal]
  51. Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid
    Distance-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:183-196 [Journal]
  52. Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:1- [Journal]
  53. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-Trees and R-Trees with Near-Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:3, pp:291-312 [Journal]
  54. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:303-316 [Journal]
  55. Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
    Lower bounds for approximate polygon decomposition and minimum gap. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:3, pp:137-141 [Journal]
  56. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with neighborhoods of varying size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:22-36 [Journal]
  57. Joachim Gudmundsson, Christos Levcopoulos
    Close Approximations of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:4, pp:437-452 [Journal]
  58. Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
  59. Joachim Gudmundsson, Christos Levcopoulos
    A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:1, pp:32-57 [Journal]
  60. Joachim Gudmundsson, Christos Levcopoulos
    A Fast Approximation Algorithm for TSP with Neighborhoods. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:4, pp:469-0 [Journal]
  61. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating a Minimum Manhattan Network. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:2, pp:219-232 [Journal]
  62. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1479-1500 [Journal]
  63. Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
    Farthest-Polygon Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:407-418 [Conf]
  64. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
    Region-fault tolerant geometric spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1-10 [Conf]
  65. Mohammad Farshi, Joachim Gudmundsson
    Experimental Study of Geometric t-Spanners: A Running Time Comparison. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:270-284 [Conf]
  66. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Approximate distance oracles for graphs with dense clusters. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:142-154 [Journal]
  67. Joachim Gudmundsson, Christos Levcopoulos
    Minimum weight pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:139-153 [Journal]
  68. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  69. Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
    Aperture-Angle and Hausdorff-Approximation of Convex Figures [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  70. Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Efficient Detection of Patterns in 2D Trajectories of Moving Points. [Citation Graph (0, 0)][DBLP]
    GeoInformatica, 2007, v:11, n:2, pp:195-215 [Journal]

  71. Increasing the readability of graph drawings with centrality-based scaling. [Citation Graph (, )][DBLP]


  72. An ILP for the metro-line crossing problem. [Citation Graph (, )][DBLP]


  73. Detecting Areas Visited Regularly. [Citation Graph (, )][DBLP]


  74. A simple and efficient kinetic spanner. [Citation Graph (, )][DBLP]


  75. Planar visibility: testing and counting. [Citation Graph (, )][DBLP]


  76. A Simple Algorithm for I/O-efficiently Pruning Dense Spanners. [Citation Graph (, )][DBLP]


  77. 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. [Citation Graph (, )][DBLP]


  78. Detecting Regular Visit Patterns. [Citation Graph (, )][DBLP]


  79. Geometric Spanners for Weighted Point Sets. [Citation Graph (, )][DBLP]


  80. Constructing interference-minimal networks. [Citation Graph (, )][DBLP]


  81. Finding the best shortcut in a geometric network. [Citation Graph (, )][DBLP]


  82. Detecting single file movement. [Citation Graph (, )][DBLP]


  83. Finding Popular Places. [Citation Graph (, )][DBLP]


  84. Compressing Spatio-temporal Trajectories. [Citation Graph (, )][DBLP]


  85. Detecting Commuting Patterns by Clustering Subtrajectories. [Citation Graph (, )][DBLP]


  86. Measuring the Similarity of Geometric Graphs. [Citation Graph (, )][DBLP]


  87. Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]


  88. Constructing minimum-interference networks. [Citation Graph (, )][DBLP]


  89. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  90. Reporting flock patterns. [Citation Graph (, )][DBLP]


  91. Region-restricted clustering for geographic data mining. [Citation Graph (, )][DBLP]


  92. Compressing spatio-temporal trajectories. [Citation Graph (, )][DBLP]


  93. A simple and efficient kinetic spanner. [Citation Graph (, )][DBLP]


  94. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  95. Algorithms for Marketing-Mix Optimization [Citation Graph (, )][DBLP]


  96. On the Expected Maximum Degree of Gabriel and Yao Graphs [Citation Graph (, )][DBLP]


  97. Notes on large angle crossing graphs [Citation Graph (, )][DBLP]


  98. Planar Visibility: Testing and Counting [Citation Graph (, )][DBLP]


  99. Farthest-Polygon Voronoi Diagrams [Citation Graph (, )][DBLP]


  100. Region-Fault Tolerant Geometric Spanners. [Citation Graph (, )][DBLP]


  101. Aperture-Angle and Hausdorff-Approximation of Convex Figures. [Citation Graph (, )][DBLP]


Search in 0.275secs, Finished in 0.280secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002