Bengt J. Nilsson

According to our database1, Bengt J. Nilsson
  • authored at least 38 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract.
Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

: Discrete Surveillance Tours in Polygonal Domains.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2015
Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective.
Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015

Competitive Strategies for Online Clique Clustering.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Approximation Algorithms for Clique Clustering.
CoRR, 2014

Clearing Connections by Few Agents.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Approximate Guarding of Monotone and Rectilinear Polygons.
Algorithmica, 2013

Using maximum coverage to optimize recommendation systems in e-commerce.
Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

Competitive Online Clique Clustering.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
The Complexity of Guarding Monotone Polygons.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2006
Competitive exploration of rectilinear polygons.
Theor. Comput. Sci., 2006

The Online Freeze-Tag Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Approximate Guarding of Monotone and Rectilinear Polygons.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones.
Algorithmica, 2004

2003
Competitive Exploration of Rectilinear Polygons.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Improved Exploration of Rectilinear Polygons.
Nord. J. Comput., 2002

Approximation Results for Kinetic Variants of TSP.
Discrete & Computational Geometry, 2002

2001
Approximating a Shortest Watchman Route.
Fundam. Inform., 2001

Parallel searching on m rays.
Comput. Geom., 2001

Guarding lines and 2-link polygons is apx-hard.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999
Minimum Spanning Trees in d Dimensions.
Nord. J. Comput., 1999

Finding the Shortest Watchman Route in a Simple Polygon.
Discrete & Computational Geometry, 1999

Computing Vision Points in Polygons.
Algorithmica, 1999

Parallel Searching on m Rays.
Proceedings of the STACS 99, 1999

Approximation Results for Kinetic Variants of TSP.
Proceedings of the Automata, 1999

1997
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Minimum Spanning Trees in d Dimensions.
Proceedings of the Algorithms, 1997

1996
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon.
Comput. Geom., 1996

1993
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.
Int. J. Comput. Geometry Appl., 1993

Finding the Shortest Watchman Route in a Simple Polygon.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Shortest path queries in rectilinear worlds.
Int. J. Comput. Geometry Appl., 1992

Shortest m-Watchmen Routes for Histograms: The MinMax Case.
Proceedings of the Computing and Information, 1992

Restricted Orientation Computational Geometry.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.
Proceedings of the Algorithms and Data Structures, 1991

Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
Proceedings of the Algorithms and Data Structures, 1991

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Computing the Rectilinear Link Diameter of a Polygon.
Proceedings of the Computational Geometry, 1991

1990
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.
Proceedings of the SWAT 90, 1990


  Loading...