Bengt J. Nilsson

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 31

Top Topics

Recommender Systems

Comparative Evaluation

Extended Abstract

Top Venues

Publications

Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt
Guarding Polyominoes Under k-Hop Visibility. LATIN (1) (2024)
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
Improving Online Bin Covering with Little Advice. IWOCA (2024)
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
Online Bin Covering with Exact Parameter Advice. CoRR (2023)
Bengt J. Nilsson, Eli Packer
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. CoRR (2023)
Bengt J. Nilsson, Christiane Schmidt
k-Transmitter Watchman Routes. WALCOM (2023)
Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt
Minimum k-Hop Dominating Sets in Grid Graphs. CoRR (2023)
Erik Krohn, Bengt J. Nilsson, Christiane Schmidt
Opposing Half Guards. CCCG (2022)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84 (5) (2022)
Erik Krohn, Bengt J. Nilsson, Christiane Schmidt
Opposing Half Guards. CoRR (2022)
Bengt J. Nilsson, Christiane Schmidt
k-Transmitter Watchman Routes. CoRR (2022)
Bengt J. Nilsson, Gordana Vujovic
Online Two-Dimensional Vector Packing with Advice. CoRR (2022)
Mayank Chaturvedi, Bengt J. Nilsson
APX-Hardness of the Minimum Vision Points Problem. CoRR (2022)
Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski
On Vertex Guarding Staircase Polygons. LATIN (2022)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Illuminating the x-Axis by α-Floodlights. ISAAC (2021)
Bengt J. Nilsson, Gordana Vujovic
Online Two-Dimensional Vector Packing With Advice. CIAC (2021)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. ACM Trans. Interact. Intell. Syst. 10 (1) (2020)
Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson
Online Clique Clustering. Algorithmica 82 (4) (2020)
Dimitris Paraschakis, Bengt J. Nilsson
FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. PAKDD (1) (2020)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON (2020)
Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR (2020)
Dimitris Paraschakis, Bengt J. Nilsson
Matchmaking Under Fairness Constraints: A Speed Dating Case Study. BIAS (2020)
Bengt J. Nilsson, Pawel Zylinski
How to Keep an Eye on Small Things. Int. J. Comput. Geom. Appl. 30 (2) (2020)
Bengt J. Nilsson, Pawel Zylinski
The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. CCCG (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC (2019)
Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski
A Note on Guarding Staircase Polygons. CCCG (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR (2019)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. IUI (2018)
Elmar Langetepe, Bengt J. Nilsson, Eli Packer
Discrete Surveillance Tours in Polygonal Domains. CCCG (2017)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. RecSys (2017)
Dimitris Paraschakis, Bengt J. Nilsson, John Hollander
Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective. ICMLA (2015)
Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
Competitive Strategies for Online Clique Clustering. CIAC (2015)
Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski
Clearing Connections by Few Agents. FUN (2014)
Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
Approximation Algorithms for Clique Clustering. CoRR (2014)
Mikael Hammar, Robin Karlsson, Bengt J. Nilsson
Using maximum coverage to optimize recommendation systems in e-commerce. RecSys (2013)
Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
Competitive Online Clique Clustering. CIAC (2013)
Erik Krohn, Bengt J. Nilsson
Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66 (3) (2013)
Erik Krohn, Bengt J. Nilsson
The Complexity of Guarding Monotone Polygons. CCCG (2012)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354 (3) (2006)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
The Online Freeze-Tag Problem. LATIN (2006)
Bengt J. Nilsson
Approximate Guarding of Monotone and Rectilinear Polygons. ICALP (2005)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39 (4) (2004)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive Exploration of Rectilinear Polygons. FCT (2003)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9 (1) (2002)
Mikael Hammar, Bengt J. Nilsson
Approximation Results for Kinetic Variants of TSP. Discret. Comput. Geom. 27 (4) (2002)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Parallel searching on m rays. Comput. Geom. 18 (3) (2001)
Bengt J. Nilsson
Approximating a Shortest Watchman Route. Fundam. Informaticae 45 (3) (2001)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson
Guarding lines and 2-link polygons is apx-hard. CCCG (2001)
Svante Carlsson, Bengt J. Nilsson
Computing Vision Points in Polygons. Algorithmica 24 (1) (1999)
Mikael Hammar, Bengt J. Nilsson
Approximation Results for Kinetic Variants of TSP. ICALP (1999)
Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. 22 (3) (1999)
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6 (4) (1999)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Parallel Searching on m Rays. STACS (1999)
Mikael Hammar, Bengt J. Nilsson
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT (1997)
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
Dimensions. ESA (1997)
Bengt J. Nilsson, Sven Schuierer
An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. Comput. Geom. 6 (1996)
Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
Finding the Shortest Watchman Route in a Simple Polygon. ISAAC (1993)
Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. 3 (1) (1993)
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. 2 (3) (1992)
Bengt J. Nilsson, Sven Schuierer
-Watchmen Routes for Histograms: The MinMax Case. ICCI (1992)
Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms (1992)
Bengt J. Nilsson, Sven Schuierer
Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry (1991)
Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS (1991)
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG (1991)
Bengt J. Nilsson, Sven Schuierer
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS (1991)
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT (1990)