| Computing longest duration flocks in trajectory data J Gudmundsson, M Van Kreveld Proceedings of the 14th annual ACM international symposium on Advances in …, 2006 | 354 | 2006 |
| Reporting flock patterns M Benkert, J Gudmundsson, F Hübner, T Wolle Computational Geometry 41 (3), 111-125, 2008 | 260 | 2008 |
| Efficient detection of motion patterns in spatio-temporal data sets J Gudmundsson, M van Kreveld, B Speckmann Proceedings of the 12th annual ACM international workshop on Geographic …, 2004 | 211 | 2004 |
| Spatio-temporal analysis of team sports J Gudmundsson, M Horton ACM Computing Surveys (CSUR) 50 (2), 1-34, 2017 | 193 | 2017 |
| Reporting leaders and followers among trajectories of moving point objects M Andersson, J Gudmundsson, P Laube, T Wolle GeoInformatica 12 (4), 497-528, 2008 | 144 | 2008 |
| Computational aspects of multi-winner approval voting H Aziz, S Gaspers, J Gudmundsson, S Mackenzie, N Mattei, T Walsh arXiv preprint arXiv:1407.3247, 2014 | 133 | 2014 |
| Efficient detection of patterns in 2D trajectories of moving points J Gudmundsson, M van Kreveld, B Speckmann GeoInformatica 11 (2), 195-215, 2007 | 125 | 2007 |
| Movement Patterns in Spatio-Temporal Data. J Gudmundsson, P Laube, T Wolle Encyclopedia of GIS 726, 732, 2008 | 122 | 2008 |
| Detecting commuting patterns by clustering subtrajectories K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo International Journal of Computational Geometry & Applications 21 (03), 253-282, 2011 | 115 | 2011 |
| TSP with neighborhoods of varying size M de Berg, J Gudmundsson, MJ Katz, C Levcopoulos, MH Overmars, ... Journal of Algorithms 57 (1), 22-36, 2005 | 115 | 2005 |
| Fast greedy algorithms for constructing sparse geometric spanners J Gudmundsson, C Levcopoulos, G Narasimhan SIAM Journal on Computing 31 (5), 1479-1500, 2002 | 112 | 2002 |
| Football analysis using spatio-temporal tools J Gudmundsson, T Wolle Computers, Environment and Urban Systems 47, 16-27, 2014 | 110 | 2014 |
| Computational movement analysis J Gudmundsson, P Laube, T Wolle Springer handbook of geographic information, 423-438, 2011 | 102 | 2011 |
| Box-trees and R-trees with near-optimal query time M Hammar Discrete & Computational Geometry 28 (3), 291-312, 2002 | 100 | 2002 |
| Higher order Delaunay triangulations J Gudmundsson, M Hammar, M van Kreveld Computational Geometry 23 (1), 85-98, 2002 | 96 | 2002 |
| Detecting commuting patterns by clustering subtrajectories K Buchin, M Buchin, J Gudmundsson, M Löffler, J Luo International Symposium on Algorithms and Computation, 644-655, 2008 | 74 | 2008 |
| A fast approximation algorithm for TSP with neighborhoods J Gudmundsson, C Levcopoulos Nordic Journal of Computing 6 (4), 469-488, 1999 | 74 | 1999 |
| Ordered theta graphs P Bose, J Gudmundsson, P Morin Computational Geometry 28 (1), 11-18, 2004 | 67 | 2004 |
| Approximate distance oracles for geometric graphs J Gudmundsson, C Levcopoulos, G Narasimhan, M Smid Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002 | 63 | 2002 |
| Compressing spatio-temporal trajectories J Gudmundsson, J Katajainen, D Merrick, C Ong, T Wolle Computational geometry 42 (9), 825-841, 2009 | 62 | 2009 |
Mark de BergProfessor of Computer Science, TU EindhovenVerified email at win.tue.nl
