The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bengt J. Nilsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Björn Brodén, Mikael Hammar, Bengt J. Nilsson
    Guarding lines and 2-link polygons is apx-hard. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:45-48 [Conf]
  2. Bengt J. Nilsson, Sven Schuierer
    Computing the Rectilinear Link Diameter of a Polygon. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:203-215 [Conf]
  3. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson
    Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:51-60 [Conf]
  4. Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
    Restricted Orientation Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:148-185 [Conf]
  5. Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
    Minimum Spanning Trees in d Dimensions. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:341-349 [Conf]
  6. Mikael Hammar, Bengt J. Nilsson
    Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:210-221 [Conf]
  7. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    Competitive Exploration of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:234-245 [Conf]
  8. Mikael Hammar, Bengt J. Nilsson
    Approximation Results for Kinetic Variants of TSP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:392-401 [Conf]
  9. Bengt J. Nilsson
    Approximate Guarding of Monotone and Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1362-1373 [Conf]
  10. Bengt J. Nilsson, Sven Schuierer
    Shortest m-Watchmen Routes for Histograms: The MinMax Case. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:30-33 [Conf]
  11. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Finding the Shortest Watchman Route in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:58-67 [Conf]
  12. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    The Online Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:569-579 [Conf]
  13. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
    Parallel Searching on m Rays. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:132-142 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:213-224 [Conf]
  15. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
    Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:367-378 [Conf]
  16. Bengt J. Nilsson, Sven Schuierer
    An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:249-260 [Conf]
  17. Björn Brodén, Mikael Hammar, Bengt J. Nilsson
    Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:4, pp:299-319 [Journal]
  18. Svante Carlsson, Bengt J. Nilsson
    Computing Vision Points in Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:1, pp:50-75 [Journal]
  19. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
    Parallel searching on m rays. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:18, n:3, pp:125-139 [Journal]
  20. Bengt J. Nilsson, Sven Schuierer
    An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:169-194 [Journal]
  21. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Finding the Shortest Watchman Route in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:377-402 [Journal]
  22. Mikael Hammar, Bengt J. Nilsson
    Approximation Results for Kinetic Variants of TSP. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:635-651 [Journal]
  23. Bengt J. Nilsson
    Approximating a Shortest Watchman Route. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:253-281 [Journal]
  24. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
    Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:85-105 [Journal]
  25. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Shortest path queries in rectilinear worlds. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:287-309 [Journal]
  26. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
    Improved Exploration of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:32-53 [Journal]
  27. Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
    Minimum Spanning Trees in d Dimensions. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:4, pp:446-461 [Journal]
  28. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    Competitive exploration of rectilinear polygons. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:367-378 [Journal]

Search in 0.090secs, Finished in 0.092secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002