Bengt J. Nilsson

From MaRDI portal
Revision as of 12:35, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:202634

Available identifiers

zbMath Open nilsson.bengt-jMaRDI QIDQ202634

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61877922024-01-15Paper
\(k\)-Transmitter watchman routes2023-11-24Paper
On vertex guarding staircase polygons2023-07-26Paper
Online two-dimensional vector packing with advice2023-03-22Paper
Local Routing in Sparse and Lightweight Geometric Graphs2023-02-03Paper
Concerning the time bounds of existing shortest watchman route algorithms2022-12-09Paper
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric2022-12-09Paper
Local routing in sparse and lightweight geometric graphs2022-05-03Paper
Minimum spanning trees in \(d\) dimensions2021-12-20Paper
How to Keep an Eye on Small Things2021-11-26Paper
Shortest watchman tours in simple polygons under rotated monotone visibility2021-04-21Paper
Online clique clustering2020-02-28Paper
Competitive Strategies for Online Clique Clustering2015-09-21Paper
Approximate guarding of monotone and rectilinear polygons2013-06-25Paper
Competitive Online Clique Clustering2013-06-07Paper
Fundamentals of Computation Theory2010-04-20Paper
The Online Freeze-Tag Problem2008-09-18Paper
Competitive exploration of rectilinear polygons2006-04-28Paper
Automata, Languages and Programming2006-01-10Paper
Online and offline algorithms for the time-dependent TSP with time zones2004-10-01Paper
Approximation results for kinetic variants of TSP2002-08-20Paper
https://portal.mardi4nfdi.de/entity/Q31501802002-01-01Paper
Parallel searching on \(m\) rays2001-09-27Paper
https://portal.mardi4nfdi.de/entity/Q27113292001-04-24Paper
https://portal.mardi4nfdi.de/entity/Q49487332000-04-26Paper
Finding the shortest watchman route in a simple polygon1999-11-23Paper
Computing vision points in polygons1999-06-29Paper
An optimal algorithm for the rectilinear link center of a rectilinear polygon1996-07-14Paper
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS1993-08-22Paper
https://portal.mardi4nfdi.de/entity/Q40357591993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374241993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374331993-05-18Paper
SHORTEST PATH QUERIES IN RECTILINEAR WORLDS1993-04-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bengt J. Nilsson