Joachim Gudmundsson Papers on DiSC'04 Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets Publications Note: Links lead to the DBLP on the Web. Joachim Gudmundsson Joachim Gudmundsson, Giri Narasimhan , Michiel H. M. Smid : Fast Pruning of Geometric Spanners. STACS 2005 : 508-520 Joachim Gudmundsson, Christos Levcopoulos : Minimum Weight Pseudo-Triangulations. FSTTCS 2004 : 299-310 Joachim Gudmundsson, Marc J. van Kreveld , Bettina Speckmann : Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004 : 250-257 Mattias Andersson , Joachim Gudmundsson, Christos Levcopoulos : Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004 : 53-64 Joachim Gudmundsson: Constructing Sparse t-Spanners with Small Separators. FCT 2003 : 86-97 Joachim Gudmundsson, Giri Narasimhan , Michiel H. M. Smid : Distance-Preserving Approximations of Polygonal Paths. FSTTCS 2003 : 217-228 Mattias Andersson , Joachim Gudmundsson, Christos Levcopoulos : Chips on Wafers. WADS 2003 : 412-423 Mark de Berg , Joachim Gudmundsson, Mikael Hammar , Mark H. Overmars : On R-trees with low query complexity. Comput. Geom. 24 (3): 179-195 (2003) Mattias Andersson , Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13 (4): 303-316 (2003) Joachim Gudmundsson, Herman J. Haverkort , Sang-Min Park , Chan-Su Shin , Alexander Wolff : Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002 : 146-160 Prosenjit Bose , Joachim Gudmundsson, Pat Morin : Ordered theta graphs. CCCG 2002 : 17-21 Mark de Berg , Joachim Gudmundsson, Matthew J. Katz , Christos Levcopoulos , Mark H. Overmars , A. Frank van der Stappen : TSP with Neighborhoods of Varying Size. ESA 2002 : 187-199 Prosenjit Bose , Joachim Gudmundsson, Michiel H. M. Smid : Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002 : 234-246 Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan , Michiel H. M. Smid : Approximate Distance Oracles Revisited. ISAAC 2002 : 357-368 Mattias Andersson , Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002 : 26-35 Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan , Michiel H. M. Smid : Approximate distance oracles for geometric graphs. SODA 2002 : 828-837 Herman J. Haverkort , Mark de Berg , Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002 : 53-62 Joachim Gudmundsson, Mikael Hammar , Marc J. van Kreveld : Higher order Delaunay triangulations. Comput. Geom. 23 (1): 85-98 (2002) Pankaj K. Agarwal , Mark de Berg , Joachim Gudmundsson, Mikael Hammar , Herman J. Haverkort : Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28 (3): 291-312 (2002) Joachim Gudmundsson, Thore Husfeldt , Christos Levcopoulos : Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81 (3): 137-141 (2002) Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31 (5): 1479-1500 (2002) Pankaj K. Agarwal , Mark de Berg , Joachim Gudmundsson, Mikael Hammar , Herman J. Haverkort : Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001 : 124-133 Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Approximating a Minimum Manhattan Network. Nord. J. Comput. 8 (2): 219-232 (2001) Mark de Berg , Joachim Gudmundsson, Mikael Hammar , Mark H. Overmars : On R-trees with Low Stabbing Number. ESA 2000 : 167-178 Joachim Gudmundsson, Mikael Hammar , Marc J. van Kreveld : Higher Order Delaunay Triangulations. ESA 2000 : 232-243 Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000 : 314-327 Joachim Gudmundsson, Christos Levcopoulos : A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7 (1): 32-57 (2000) Joachim Gudmundsson, Christos Levcopoulos : A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999 : 473-482 Joachim Gudmundsson, Christos Levcopoulos , Giri Narasimhan : Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999 : 28-38 Joachim Gudmundsson, Christos Levcopoulos : Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3 (4): 437-452 (1999) Joachim Gudmundsson, Christos Levcopoulos : A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6 (4): 469- (1999) Joachim Gudmundsson, Christos Levcopoulos : A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998 : 233-244 Christos Levcopoulos , Joachim Gudmundsson: A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997 : 305-316 Christos Levcopoulos , Joachim Gudmundsson: Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997 : 27-41 Christos Levcopoulos , Joachim Gudmundsson: Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996 : 135-146 1 [ 14 ] [ 17 ] 2 [ 21 ] [ 27 ] [ 29 ] [ 32 ] 3 [ 12 ] [ 14 ] [ 17 ] [ 19 ] [ 24 ] [ 28 ] 4 [ 23 ] [ 25 ] 5 [ 11 ] [ 12 ] [ 14 ] [ 17 ] [ 18 ] [ 28 ] 6 [ 14 ] [ 17 ] [ 19 ] [ 26 ] 7 [ 16 ] 8 [ 24 ] 9 [ 11 ] [ 18 ] [ 33 ] 10 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 15 ] [ 16 ] [ 20 ] [ 21 ] [ 22 ] [ 24 ] [ 27 ] [ 29 ] [ 32 ] [ 34 ] 11 [ 25 ] 12 [ 7 ] [ 10 ] [ 13 ] [ 15 ] [ 20 ] [ 21 ] [ 22 ] [ 27 ] [ 30 ] [ 35 ] 13 [ 12 ] [ 24 ] [ 28 ] 14 [ 26 ] 15 [ 26 ] 16 [ 20 ] [ 22 ] [ 23 ] [ 30 ] [ 35 ] 17 [ 33 ] 18 [ 24 ] 19 [ 26 ] ©2005 Association for Computing Machinery