Bengt J. Nilsson

Available identifiers

zbMath Open nilsson.bengt-jMaRDI QIDQ202634

List of research outcomes

Publication	Date of Publication	Type
Approximation algorithms for the two-watchman route in a simple polygon	2024-10-07	Paper
Guarding polyominoes under \(k\)-hop visibility	2024-05-31	Paper
https://portal.mardi4nfdi.de/entity/Q6187792	2024-01-15	Paper
\(k\)-Transmitter watchman routes	2023-11-24	Paper
On vertex guarding staircase polygons	2023-07-26	Paper
Online two-dimensional vector packing with advice	2023-03-22	Paper
Local Routing in Sparse and Lightweight Geometric Graphs	2023-02-03	Paper
Concerning the time bounds of existing shortest watchman route algorithms	2022-12-09	Paper
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric	2022-12-09	Paper
Local routing in sparse and lightweight geometric graphs	2022-05-03	Paper
Minimum spanning trees in \(d\) dimensions	2021-12-20	Paper
How to Keep an Eye on Small Things	2021-11-26	Paper
Shortest watchman tours in simple polygons under rotated monotone visibility	2021-04-21	Paper
Online clique clustering	2020-02-28	Paper
Competitive Strategies for Online Clique Clustering	2015-09-21	Paper
Approximate guarding of monotone and rectilinear polygons	2013-06-25	Paper
Competitive Online Clique Clustering	2013-06-07	Paper
Competitive exploration of rectilinear polygons.	2010-04-20	Paper
The Online Freeze-Tag Problem	2008-09-18	Paper
Competitive exploration of rectilinear polygons	2006-04-28	Paper
Automata, Languages and Programming	2006-01-10	Paper
Online and offline algorithms for the time-dependent TSP with time zones	2004-10-01	Paper
Approximation results for kinetic variants of TSP	2002-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q3150180	2002-01-01	Paper
Parallel searching on \(m\) rays	2001-09-27	Paper
Approximating a shortest watchman route	2001-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q4948733	2000-04-26	Paper
Finding the shortest watchman route in a simple polygon	1999-11-23	Paper
Computing vision points in polygons	1999-06-29	Paper
An optimal algorithm for the rectilinear link center of a rectilinear polygon	1996-07-14	Paper
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS	1993-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4035759	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4037433	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4037424	1993-05-18	Paper
SHORTEST PATH QUERIES IN RECTILINEAR WORLDS	1993-04-01	Paper

Research outcomes over time

This page was built for person: Bengt J. Nilsson