| Publication |
|---|
| A. Brodnik, H. Jonsson, P. G. Rossi, Carlo Tasso. Interoperability and Semantic Filtering. Journal of e-learning and Knowledge Society, vol. 2, pp.165-175, 2006. |
| Gear, 2006. |
| A. Brodnik, H. Jonsson, P. G. Rossi, Carlo Tasso, Interoperability and Semantic Filtering, SIEL Congress, Florens, Italy. November, 2005. |
| T. Berglund, A. Brodnik, H. Jonsson, I. Söderkvist, K. Mrozek, and Mats Staffansson, Planning Smooth Paths among Obstacles using Minimum Curvature Variation B-splines, 2005. Submitted to IEEE Transactions on Automation Science and Engineering. |
| H. Jonsson, A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes, ICCSA (3) 2004: 168-177. |
| T. Berglund, A. Brodnik, H. Jonsson, K. Mrozek, M. Staffanson, and I. Söderkvist, Minimum Curvature Variation B-splines - Validation of a Path-Planning model , Technical report, Institute for Mathematics, Physics and Mechanics, Ljubljana, Slovenia, 2004. TR no. 917 (Vol.42, 2004). |
| H. Jonsson, An approximative solution to the Zookeeper's Problem, Information Processing Letters, 87(6):301-307, 2003. |
| T. Berglund, T. Ströomberg, H. Jonsson, and I. Söderkvist, Epi-Convergence of Minimum Curvature Variation B-splines, Technical report, Department of Computer Science and Electrical Engineering, Luleå University of Technology, Sweden, 2003. TR 2003:14, ISSN 1402-1536. |
| T. Berglund, H. Jonsson and I. Söderkvist, An Obstacle-Avoiding Minimum Variation B-spline, Int. Conf. Geom. Model. and Graphics (GMAG-03), London, England, July, 2003. IEEE Computer Society. |
| H. Jonsson, The traveling salesman problem for lines in the plane, Information Processing Letters, 82(3):137-142, 2002. |
| T. Berglund, U. Eriksson, H. Jonsson, K. Mrozek and I. Söderkvist, Automatic Generation of Smooth Paths Bounded by Polygonal Chains, Proc. IEEE Int. Conf. Comput. Intell. for Model., Control and Autom, ISBN 0858898470, Las Vegas, USA, July 2001. |
| H. Jonsson, The Euclidean Traveling Salesman Problem with Neighborhoods and a Connecting Fence, Doctorial thesis, ISRN: LTU - DT - - - 00/36 - - SE, Luleå University of Technology, 2000. |
| H. Jonsson and O. Marklund, editors. Proceedings of the First Symposium on Computer Science and Electrical Engineering, Luleå, Sweden, May 2000. |
| S. Carlsson, H. Jonsson, and B. J. Nilsson, Finding a shortest watchman route in a simple polygon, Discrete Comput. Geom., 22(3):377-402, 1999. |
| H. Jonsson, On the Zookeeper's Problem, 15th European Workshop on Com- put. Geom., Antibes, Juan Les Pins, France, 141-144, 1999. |
| U. Wiss, D. Carr, and H. Jonsson, Evaluating 3-Dimensional Information Visualization Designs - A Case Study, Proceedings of the 1998 IEEE Conf. Info. Visual., London, England, July 1998. |
(And some older but not really interesting ones.)
