Bengt J. Nilsson

According to our database, Bengt J. Nilsson authored at least 53 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Guarding Polyominoes Under k-Hop Visibility.

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Online Bin Covering with Exact Parameter Advice.

Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic

CoRR, 2023

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon.

Bengt J. Nilsson, Eli Packer

CoRR, 2023

Minimum k-Hop Dominating Sets in Grid Graphs.

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt

CoRR, 2023

k-Transmitter Watchman Routes.

Bengt J. Nilsson, Christiane Schmidt

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

APX-Hardness of the Minimum Vision Points Problem.

Mayank Chaturvedi, Bengt J. Nilsson

CoRR, 2022

Local Routing in Sparse and Lightweight Geometric Graphs.

Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen

Algorithmica, 2022

On Vertex Guarding Staircase Polygons.

Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Opposing Half Guards.

Erik Krohn, Bengt J. Nilsson, Christiane Schmidt

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Illuminating the x-Axis by α-Floodlights.

Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Online Two-Dimensional Vector Packing With Advice.

Bengt J. Nilsson, Gordana Vujovic

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis

ACM Trans. Interact. Intell. Syst., 2020

How to Keep an Eye on Small Things.

Bengt J. Nilsson, Pawel Zylinski

Int. J. Comput. Geom. Appl., 2020

Online Clique Clustering.

Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson

Algorithmica, 2020

FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode.

Dimitris Paraschakis, Bengt J. Nilsson

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2020

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility.

Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Matchmaking Under Fairness Constraints: A Speed Dating Case Study.

Dimitris Paraschakis, Bengt J. Nilsson

Proceedings of the Bias and Social Aspects in Search and Recommendation, 2020

2019

The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains.

Bengt J. Nilsson, Pawel Zylinski

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

A Note on Guarding Staircase Polygons.

Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis

Proceedings of the 23rd International Conference on Intelligent User Interfaces, 2018

2017

Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis

Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

Discrete Surveillance Tours in Polygonal Domains.

Elmar Langetepe, Bengt J. Nilsson, Eli Packer

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2015

Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective.

Dimitris Paraschakis, Bengt J. Nilsson, John Hollander

Proceedings of the 14th IEEE International Conference on Machine Learning and Applications, 2015

Competitive Strategies for Online Clique Clustering.

Marek Chrobak, Christoph Dürr, Bengt J. Nilsson

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Approximation Algorithms for Clique Clustering.

Marek Chrobak, Christoph Dürr, Bengt J. Nilsson

CoRR, 2014

Clearing Connections by Few Agents.

Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Approximate Guarding of Monotone and Rectilinear Polygons.

Erik Krohn, Bengt J. Nilsson

Algorithmica, 2013

Using maximum coverage to optimize recommendation systems in e-commerce.

Mikael Hammar, Robin Karlsson, Bengt J. Nilsson

Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

Competitive Online Clique Clustering.

Aleksander Fabijan, Bengt J. Nilsson, Mia Persson

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

The Complexity of Guarding Monotone Polygons.

Erik Krohn, Bengt J. Nilsson

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2006

Competitive exploration of rectilinear polygons.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Theor. Comput. Sci., 2006

The Online Freeze-Tag Problem.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Approximate Guarding of Monotone and Rectilinear Polygons.

Bengt J. Nilsson

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

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

Björn Brodén, Mikael Hammar, Bengt J. Nilsson

Algorithmica, 2004

2002

Improved Exploration of Rectilinear Polygons.

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer

Nord. J. Comput., 2002

Approximation Results for Kinetic Variants of TSP.

Mikael Hammar, Bengt J. Nilsson

Discret. Comput. Geom., 2002

2001

Approximating a Shortest Watchman Route.

Bengt J. Nilsson

Fundam. Informaticae, 2001

Parallel searching on m rays.

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer

Comput. Geom., 2001

Guarding lines and 2-link polygons is apx-hard.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

1999

Minimum Spanning Trees in d Dimensions.

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson

Nord. J. Comput., 1999

Finding the Shortest Watchman Route in a Simple Polygon.

Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson

Discret. Comput. Geom., 1999

Computing Vision Points in Polygons.

Svante Carlsson, Bengt J. Nilsson

Algorithmica, 1999

1997

Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.

Mikael Hammar, Bengt J. Nilsson

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Minimum Spanning Trees in <i>d</i> Dimensions.

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson

Proceedings of the Algorithms, 1997

1996

An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon.

Bengt J. Nilsson, Sven Schuierer

Comput. Geom., 1996

1993

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.

Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos

Int. J. Comput. Geom. Appl., 1993

1992

Shortest path queries in rectilinear worlds.

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars

Int. J. Comput. Geom. Appl., 1992

Shortest <i>m</i>-Watchmen Routes for Histograms: The MinMax Case.

Bengt J. Nilsson, Sven Schuierer

Proceedings of the Computing and Information, 1992

Restricted Orientation Computational Geometry.

Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.

Bengt J. Nilsson, Sven Schuierer

Proceedings of the Algorithms and Data Structures, 1991

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract).

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Computing the Rectilinear Link Diameter of a Polygon.

Bengt J. Nilsson, Sven Schuierer

Proceedings of the Computational Geometry, 1991

1990

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars

Proceedings of the SWAT 90, 1990