Bengt J. Nilsson

Erik Krohn, Bengt J. Nilsson: Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66(3): 564-594 (2013)

Erik Krohn, Bengt J. Nilsson: The Complexity of Guarding Monotone Polygons. CCCG 2012: 167-172

Mikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006)

Mikael Hammar, Bengt J. Nilsson, Mia Persson: The Online Freeze-Tag Problem. LATIN 2006: 569-579

Bengt J. Nilsson: Approximate Guarding of Monotone and Rectilinear Polygons. ICALP 2005: 1362-1373

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

Mikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245

Andrzej Lingas, Bengt J. Nilsson (Eds.): Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Lecture Notes in Computer Science 2751, Springer 2003, isbn 3-540-40543-7

Mikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. Discrete & Computational Geometry 27(4): 635-651 (2002)

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer: Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9(1): 32-53 (2002)

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer: Parallel searching on m rays. Comput. Geom. 18(3): 125-139 (2001)

Bengt J. Nilsson: Approximating a Shortest Watchman Route. Fundam. Inform. 45(3): 253-281 (2001)

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

Svante Carlsson, Bengt J. Nilsson: Computing Vision Points in Polygons. Algorithmica 24(1): 50-75 (1999)

Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson: Finding the Shortest Watchman Route in a Simple Polygon. Discrete & Computational Geometry 22(3): 377-402 (1999)

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999)

Mikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. ICALP 1999: 392-401

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer: Parallel Searching on m Rays. STACS 1999: 132-142

Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349

Mikael Hammar, Bengt J. Nilsson: Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT 1997: 210-221

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

Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos: Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geometry Appl. 3(1): 85-105 (1993)

Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson: Finding the Shortest Watchman Route in a Simple Polygon. ISAAC 1993: 58-67

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl. 2(3): 287-309 (1992)

Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking: Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms 1992: 148-185

Bengt J. Nilsson, Sven Schuierer: Shortest m-Watchmen Routes for Histograms: The MinMax Case. ICCI 1992: 30-33

Bengt J. Nilsson, Sven Schuierer: Computing the Rectilinear Link Diameter of a Polygon. Workshop on Computational Geometry 1991: 203-215

Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson: Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). Symposium on Computational Geometry 1991: 51-60

Bengt J. Nilsson, Sven Schuierer: An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. WADS 1991: 249-260

Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos: Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS 1991: 367-378

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: 213-224