| Finding the shortest watchman route in a simple polygon S Carlsson, H Jonsson, BJ Nilsson Discrete & Computational Geometry 22, 377-402, 1999 | 148* | 1999 |
| Shortest Path Queries in Rectilinear Worlds M De Berg, M Van Kreveld, BJ Nilsson, M Overmars | 93* | 1992 |
| Guarding art galleries: Methods for mobile guards BJ Nilsson Department of Computer Science, Lund University, Sweden, 1995 | 90 | 1995 |
| Approximate guarding of monotone and rectilinear polygons EA Krohn, BJ Nilsson Algorithmica 66, 564-594, 2013 | 82* | 2013 |
| Optimum guard covers and m-watchmen routes for restricted polygons S Carlsson, BJ Nilsson, S Ntafos International Journal of Computational Geometry & Applications 3 (01), 85-105, 1993 | 70 | 1993 |
| Guarding lines and 2-link polygons is APX-hard B Brodén, M Hammar, BJ Nilsson 13th Canadian Conference on Computational Geometry, 45-48, 2001 | 59 | 2001 |
| A bandit-based ensemble framework for exploration/exploitation of diverse recommendation components: An experimental study within e-commerce B Brodén, M Hammar, BJ Nilsson, D Paraschakis ACM Transactions on Interactive Intelligent Systems (TiiS) 10 (1), 1-32, 2019 | 55* | 2019 |
| Approximation results for kinetic variants of TSP Hammar, Nilsson Discrete & Computational Geometry 27 (4), 635-651, 2002 | 52 | 2002 |
| Comparative evaluation of top-N recommenders in e-commerce: industrial perspective D Paraschakis, BJ Nilsson, J Holländer 14th International Conference on Machine Learning and Applications, (IEEE …, 2015 | 44 | 2015 |
| Using maximum coverage to optimize recommendation systems in e-commerce M Hammar, R Karlsson, BJ Nilsson Proceedings of the 7th ACM conference on Recommender systems, 265-272, 2013 | 41 | 2013 |
| Minimum spanning trees in d dimensions D Krznaric, C Levcopoulos, BJ Nilsson Nordic Journal of Computing 6 (4), 446-461, 1999 | 34 | 1999 |
| Optimum Watchmen Routes in Spiral Polygons," extended abstract B Nilsson, D Wood Proceedings 2nd Canadian Conference in Computational Geometry, Ottawa, 269-272, 1990 | 34 | 1990 |
| Concerning the time bounds of existing shortest watchman route algorithms M Hammar, BJ Nilsson Fundamentals of Computation Theory: 11th International Symposium, FCT'97 …, 1997 | 31 | 1997 |
| An optimal algorithm for the rectilinear link center of a rectilinear polygon BJ Nilsson, S Schuierer Computational Geometry 6 (3), 169-194, 1996 | 26* | 1996 |
| Computing vision points in polygons S Carlsson, BJ Nilsson Algorithmica 24, 50-75, 1999 | 25 | 1999 |
| Parallel searching on m rays M Hammar, BJ Nilsson, S Schuierer Computational Geometry 18 (3), 125-139, 2001 | 24 | 2001 |
| Computing the rectilinear link diameter of a polygon BJ Nilsson, S Schuierer Computational Geometry-Methods, Algorithms and Applications: International …, 1991 | 24 | 1991 |
| Approximating a shortest watchman route BJ Nilsson Fundamenta Informaticae 45 (3), 235-281, 2001 | 21* | 2001 |
| The complexity of guarding monotone polygons E Krohn, BJ Nilsson Canadian Conference on Computational Geometry, Charlottetown, Prince Edward …, 2012 | 20 | 2012 |
| Online clique clustering M Chrobak, C Dürr, A Fabijan, BJ Nilsson Algorithmica 82 (4), 938-965, 2020 | 18* | 2020 |
Dimitris ParaschakisPostdoctoral Researcher in Computer Science, Lund UniversityVerified email at cs.lth.se