Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Nilsson, Bengt J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competitive online clique clustering
Aleksander Fabijan
,
Bengt J. Nilsson
,
Mia Persson
Lecture Notes in Computer Science
7878
, 2013, pp. 221-233
Approximate guarding of monotone and rectilinear polygons
Erik A. Krohn
,
Bengt J. Nilsson
Algorithmica
66
(3), 2013, pp. 564-594
Competitive exploration of rectilinear polygons
Mikael Hammar
,
Bengt J. Nilsson
,
Mia Persson
Theoretical Computer Science
354
(3), 2006, pp. 367-378
Approximate guarding of monotone and rectilinear polygons
Bengt J. Nilsson
Lecture Notes in Computer Science
3580
, 2005, pp. 1362-1373
Online and offline algorithms for the time-dependent TSP with time zones
Björn Brodén
,
Mikael Hammar
,
Bengt J. Nilsson
Algorithmica
39
(4), 2004, pp. 299-319
Parallel searching on
m
rays
Mikael Hammar
,
Bengt J. Nilsson
,
Sven Schuierer
Lecture Notes in Computer Science
1563
, 1999, pp. 132-142
Approximation results for kinetic variants of TSP
Mikael Hammar
,
Bengt J. Nilsson
Lecture Notes in Computer Science
1644
, 1999, pp. 392-401
Concerning the time bounds of existing shortest watchman route algortihms
Mikael Hammar
,
Bengt J. Nilsson
Lecture Notes in Computer Science
1279
, 1997, pp. 210-221
Minimum spanning trees in
d
dimensions
Drago Krznaric
,
Christos Levcopoulos
,
Bengt J. Nilsson
Lecture Notes in Computer Science
1284
, 1997, pp. 341-349
Finding the shortest watchman route in a simple polygon
Svante Carlsson
,
Håkan Jonsson
,
Bengt J. Nilsson
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 58-67
Restricted orientation computational geometry
Bengt J. Nilsson
,
Thomas Ottmann
,
Sven Schuierer
,
Christian Icking
Lecture Notes in Computer Science
594
, 1992, pp. 148-185
Optimum guard covers and
m
-watchmen routes for restricted polygons
Svante Carlsson
,
Bengt J. Nilsson
,
Simeon Ntafos
Lecture Notes in Computer Science
519
, 1991, pp. 367-378
An optimal algorithm for the rectilinear link center of a rectilinear polygon
Bengt J. Nilsson
,
Sven Schuierer
Lecture Notes in Computer Science
519
, 1991, pp. 249-260
Finding shortest paths in the presence of orthogonal obstacles using a combined
L_1
and link metric
Mark de Berg
,
Marc J. van Kreveld
,
Bengt J. Nilsson
,
Mark H. Overmars
Lecture Notes in Computer Science
447
, 1990, pp. 213-224