Bengt J. Nilsson
Bengt J. Nilsson
Professor of Computer Science, Malmö University
Verified email at mau.se - Homepage
Title
Cited by
Cited by
Year
Finding the shortest watchman route in a simple polygon
S Carlsson, H Jonsson, BJ Nilsson
Discrete & Computational Geometry 22 (3), 377-402, 1999
127*1999
Shortest Path Queries in Rectilinear Worlds
M De Berg, M Van Kreveld, BJ Nilsson, M Overmars
86*1992
Guarding art galleries: Methods for mobile guards
BJ Nilsson
Department of Computer Science, Lund University, Sweden, 1995
811995
Approximate guarding of monotone and rectilinear polygons
EA Krohn, BJ Nilsson
Algorithmica 66 (3), 564-594, 2013
69*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
611993
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
532001
Approximation results for kinetic variants of TSP
M Hammar, BJ Nilsson
Discrete and Computational Geometry 27 (4), 635-651, 2002
402002
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
332015
Minimum spanning trees in d dimensions
D Krznaric, C Levcopoulos, BJ Nilsson
Nordic Journal of Computing 6 (4), 446-461, 1999
321999
Concerning the time bounds of existing shortest watchman route algorithms
M Hammar, BJ Nilsson
International Symposium on Fundamentals of Computation Theory, 210-221, 1997
301997
Optimum watchmen routes in spiral polygons
BJ Nilsson, D Wood
291990
Computing vision points in polygons
S Carlsson, BJ Nilsson
Algorithmica 24 (1), 50-75, 1999
271999
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
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
25*2019
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
252013
Parallel searching on m rays
M Hammar, BJ Nilsson, S Schuierer
Computational Geometry 18 (3), 125-139, 2001
252001
Computing the rectilinear link diameter of a polygon
BJ Nilsson, S Schuierer
Workshop on Computational Geometry, 203-215, 1991
211991
Approximating a shortest watchman route
BJ Nilsson
Fundamenta Informaticae 45 (3), 235-281, 2001
16*2001
Competitive exploration of rectilinear polygons
M Hammar, BJ Nilsson, M Persson
Theoretical computer science 354 (3), 367-378, 2006
152006
The complexity of guarding monotone polygons
E Krohn, BJ Nilsson
Canadian Conference on Computational Geometry, Charlottetown, Prince Edward …, 2012
132012
The system can't perform the operation now. Try again later.
Articles 1–20