home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. J.G. Gudmundsson

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. J.G. Gudmundsson

• contact information
• my technical reports
• former member of group games and virtual worlds

some publications

Buchin, K.A., Buchin- Walther, M., Gudmundsson, J. G., Löffler, M. & Luo, J. (2008). Detecting Commuting Patterns by Clustering Subtrajectories. UU-CS 2008-29. onbekend: UU WINFI Informatica en Informatiekunde.

Benkert, M., Gudmundsson, J. G., Knauer, C., Moet, E.J., Oostrum, R.W. van & Wolff, A. (2006). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. In D.Z. Chen & D.T. Lee (Eds.), Computing and Combinatorics, 12th Annual International Conference, COCOON 2006 Vol. 4112. Lecture Notes in Computer Science (pp. 166-175). Taipei, Taiwan.

Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2005). The TSP with neighborhoods of varying size. Journal of Algorithms, 57, 22-36.

Gudmundsson, J. G., Haverkort, H.J. & Kreveld, M.J. van (2003). Constraint Higher-Order Delaunay Triangulations. In 19th European Workshop on Computational Geometry CG 2003. Bonn: Institute of Computer Science I, University of Bonn.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2003). Facility Location and the Geometric Minimum-Diameter Spanning Tree. UU-CS 2003-006. Utrecht: Utrecht University: Information and Computing Sciences.

Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2003). On R-trees with low query complexity. Computational Geometry: Theory and Applications, 2003(24), 179-195.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2002). Approximating the Geometric Minimum-Diameter Spanning Tree. In Proceedings of the 18th European Workshop on Computational Geometry (pp. 41-45). Warszawa.

Andersson, J., Gudmundsson, J. G., Levcopoulos, C. & Narasimhan, G. (2002). Balanced partition of minimum spanning trees. UU-CS 2002-037. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2002). Box-Trees and R-Trees with Near-Optimal Query Time. Discrete and Computational Geometry, 28(3), 291-312.

Haverkort, H.J., Berg, M.T. de & Gudmundsson, J. G. (2002). Box-Trees for Collision Checking in Industrial Installations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 53-62). Barcelona, Spain.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2002). Facility Location and the Geometric Minimum-Diameter Spanning Tree. In et.al Jansen (Ed.), Approximation Algorithms for Combinatorial Optimization (APPROX) (pp. 146-160). Rome, Italy.

Gudmundsson, J. G., Hammar, M. & Kreveld, M.J. van (2002). Higher order Delaunay triangulations. Computational Geometry: Theory and Applications, 23(1), 85-98.

Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with Neighborhoods of Varying Size. UU-CS 2002-036. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with neighborhouds of varying size. In Proceedings10th European Symposium on Algorithms ( ESA 2002) (pp. 187-199).

Gudmundsson, J. G., Levcopoulos, C. & Narasimhan, G. (2001). Approximating a Minimum Manhattan Network. Nordic journal of computing, 219-232.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-Trees and R-Trees with Near-Optimal Query Time. UU-CS 2001-10. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In Proc. 17th ACM Symposium on Computational Geometry (pp. 124-133). New York: ACM.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In R.L. Lagendijk, J.W.J. Heijnsdijk, A.D. Pimentel & M.H.F. Wilkinson (Eds.), ASCI: Proc. 7th Annual Conference of the Advanced School for Computing and Imaging (pp. 283-290). Delft: Advanced School for Computing and Imaging.

Hammar, M., Gudmundsson, J. G. & Kreveld, M.J. van (2001). Higher Order Delaunay Triangulations. UU-CS 2001-05. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2001). On R-trees with low query complexity. UU-CS 2001-21. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.