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 (SWAT, 1990)

Computing the Rectilinear Link Diameter of a Polygon. - Bengt J. Nilsson; Sven Schuierer (Workshop on Computational Geometry, 1991)

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). - Mark de Berg; Marc J. van Kreveld; Bengt J. Nilsson (SCG, 1991)

An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. - Bengt J. Nilsson; Sven Schuierer (WADS, 1991)

Restricted Orientation Computational Geometry. - Bengt J. Nilsson; Thomas Ottmann; Sven Schuierer; Christian Icking (Data Structures and Efficient Algorithms, 1992)

Shortest m-Watchmen Routes for Histograms: The MinMax Case. - Bengt J. Nilsson; Sven Schuierer (ICCI, 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)

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. - Svante Carlsson; Bengt J. Nilsson; Simeon C. Ntafos (Int. J. Comput. Geom. Appl., 1993)

An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. - Bengt J. Nilsson; Sven Schuierer (Comput. Geom., 1996)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (ESA, 1997)

Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. - Mikael Hammar; Bengt J. Nilsson (FCT, 1997)

Computing Vision Points in Polygons. - Svante Carlsson; Bengt J. Nilsson (Algorithmica, 1999)

Finding the Shortest Watchman Route in a Simple Polygon. - Svante Carlsson; Håkan Jonsson 001; Bengt J. Nilsson (Discret. Comput. Geom., 1999)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (Nord. J. Comput., 1999)

Guarding lines and 2-link polygons is apx-hard. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson (CCCG, 2001)

Parallel searching on m rays. - Mikael Hammar; Bengt J. Nilsson; Sven Schuierer (Comput. Geom., 2001)

Approximating a Shortest Watchman Route. - Bengt J. Nilsson (Fundam. Informaticae, 2001)

Approximation Results for Kinetic Variants of TSP. - Mikael Hammar; Bengt J. Nilsson (Discret. Comput. Geom., 2002)

Improved Exploration of Rectilinear Polygons. - Mikael Hammar; Bengt J. Nilsson; Sven Schuierer (Nord. J. Comput., 2002)

Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson (Algorithmica, 2004)

Approximate Guarding of Monotone and Rectilinear Polygons. - Bengt J. Nilsson (ICALP, 2005)

The Online Freeze-Tag Problem. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (LATIN, 2006)

Competitive exploration of rectilinear polygons. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (Theor. Comput. Sci., 2006)

The Complexity of Guarding Monotone Polygons. - Erik Krohn; Bengt J. Nilsson (CCCG, 2012)

Competitive Online Clique Clustering. - Aleksander Fabijan; Bengt J. Nilsson; Mia Persson (CIAC, 2013)

Using maximum coverage to optimize recommendation systems in e-commerce. - Mikael Hammar; Robin Karlsson; Bengt J. Nilsson (RecSys, 2013)

Approximate Guarding of Monotone and Rectilinear Polygons. - Erik Krohn; Bengt J. Nilsson (Algorithmica, 2013)

Clearing Connections by Few Agents. - Christos Levcopoulos; Andrzej Lingas; Bengt J. Nilsson; Pawel Zylinski (FUN, 2014)

Approximation Algorithms for Clique Clustering. - Marek Chrobak; Christoph Dürr; Bengt J. Nilsson (CoRR, 2014)

Competitive Strategies for Online Clique Clustering. - Marek Chrobak; Christoph Dürr; Bengt J. Nilsson (CIAC, 2015)

Comparative Evaluation of Top-N Recommenders in e-Commerce: An Industrial Perspective. - Dimitris Paraschakis; Bengt J. Nilsson; John Hollander (ICMLA, 2015)

Discrete Surveillance Tours in Polygonal Domains. - Elmar Langetepe; Bengt J. Nilsson; Eli Packer (CCCG, 2017)

Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson; Dimitris Paraschakis (RecSys, 2017)

Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson; Dimitris Paraschakis (IUI, 2018)

A Note on Guarding Staircase Polygons. - Matt Gibson 001; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Pawel Zylinski (CCCG, 2019)

The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. - Bengt J. Nilsson; Pawel Zylinski (CCCG, 2019)

Matchmaking Under Fairness Constraints: A Speed Dating Case Study. - Dimitris Paraschakis; Bengt J. Nilsson (BIAS, 2020)

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (COCOON, 2020)

FlowRec: Prototyping Session-Based Recommender Systems in Streaming Mode. - Dimitris Paraschakis; Bengt J. Nilsson (PAKDD (1), 2020)

Online Clique Clustering. - Marek Chrobak; Christoph Dürr; Aleksander Fabijan; Bengt J. Nilsson (Algorithmica, 2020)

How to Keep an Eye on Small Things. - Bengt J. Nilsson; Pawel Zylinski (Int. J. Comput. Geom. Appl., 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)

Online Two-Dimensional Vector Packing With Advice. - Bengt J. Nilsson; Gordana Vujovic (CIAC, 2021)

Illuminating the x-Axis by α-Floodlights. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (ISAAC, 2021)

Opposing Half Guards. - Erik Krohn; Bengt J. Nilsson; Christiane Schmidt 001 (CCCG, 2022)

On Vertex Guarding Staircase Polygons. - Matt Gibson-Lopez; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Sean Soderman; Pawel Zylinski (LATIN, 2022)

Local Routing in Sparse and Lightweight Geometric Graphs. - Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen (Algorithmica, 2022)

APX-Hardness of the Minimum Vision Points Problem. - Mayank Chaturvedi; Bengt J. Nilsson (CoRR, 2022)

k-Transmitter Watchman Routes. - Bengt J. Nilsson; Christiane Schmidt 001 (WALCOM, 2023)

Minimum k-Hop Dominating Sets in Grid Graphs. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (CoRR, 2023)

Improving Online Bin Covering with Little Advice. - Andrej Brodnik; Bengt J. Nilsson; Gordana Vujovic (IWOCA, 2024)

Online Bin Covering with Exact Parameter Advice. - Andrej Brodnik; Bengt J. Nilsson; Gordana Vujovic (Informatica (Slovenia), 2024)

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon. - Bengt J. Nilsson; Eli Packer (Algorithmica, 2024)

Guarding Polyominoes Under k-Hop Visibility. - Omrit Filtser; Erik Krohn; Bengt J. Nilsson; Christian Rieck; Christiane Schmidt 001 (Algorithmica, 2025)

Multiple Watchman Routes in Staircase Polygons. - Anna Brötzner; Bengt J. Nilsson; Christiane Schmidt 001 (CoRR, 2025)