| 2004 |
|---|
| 9 | EE | Håkan Jonsson:
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes.
ICCSA (3) 2004: 168-177 |
| 2003 |
|---|
| 8 | EE | Tomas Berglund,
Håkan Jonsson,
Inge Söderkvist:
An Obstacle-Avoiding Minimum Variation B-Spline Problem.
GMAG 2003: 156-161 |
| 7 | EE | Håkan Jonsson:
An approximative solution to the Zookeeper's Problem.
Inf. Process. Lett. 87(6): 301-307 (2003) |
| 2002 |
|---|
| 6 | EE | Håkan Jonsson:
The Traveling Salesman Problem for lines in the plane.
Inf. Process. Lett. 82(3): 137-142 (2002) |
| 1999 |
|---|
| 5 | EE | Svante Carlsson,
Håkan Jonsson,
Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon.
Discrete & Computational Geometry 22(3): 377-402 (1999) |
| 1998 |
|---|
| 4 | EE | Ulrika Wiss,
David A. Carr,
Håkan Jonsson:
Evaluating Three-Dimensional Information Visualization Designs: A Case Study of Three Designs.
IV 1998: 137- |
| 1995 |
|---|
| 3 | | Svante Carlsson,
Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.
WADS 1995: 122-134 |
| 1993 |
|---|
| 2 | | Svante Carlsson,
Håkan Jonsson:
Guarding a Treasury.
CCCG 1993: 85-90 |
| 1 | | Svante Carlsson,
Håkan Jonsson,
Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon.
ISAAC 1993: 58-67 |
