The following pages link to Bengt J. Nilsson (Q202634):
Displayed 34 items.
- Minimum spanning trees in \(d\) dimensions (Q826104) (← links)
- (Q1293870) (redirect page) (← links)
- Computing vision points in polygons (Q1293871) (← links)
- Approximation results for kinetic variants of TSP (Q1611067) (← links)
- Finding the shortest watchman route in a simple polygon (Q1807612) (← links)
- Online and offline algorithms for the time-dependent TSP with time zones (Q1882408) (← links)
- An optimal algorithm for the rectilinear link center of a rectilinear polygon (Q1917052) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Online clique clustering (Q2300728) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Online two-dimensional vector packing with advice (Q2692736) (← links)
- (Q2711329) (← links)
- Competitive Strategies for Online Clique Clustering (Q2947013) (← links)
- (Q3150180) (← links)
- The Online Freeze-Tag Problem (Q3525792) (← links)
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDS (Q4030352) (← links)
- (Q4035759) (← links)
- (Q4037424) (← links)
- (Q4037433) (← links)
- Competitive Online Clique Clustering (Q4924652) (← links)
- (Q4948733) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
- OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS (Q5289296) (← links)
- Automata, Languages and Programming (Q5716760) (← links)
- Local Routing in Sparse and Lightweight Geometric Graphs (Q5875592) (← links)
- Fundamentals of Computation Theory (Q5900800) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- \(k\)-Transmitter watchman routes (Q6091164) (← links)
- On vertex guarding staircase polygons (Q6164013) (← links)
- (Q6187792) (← links)