Håkan Jonsson

19 papers B 2C 3Misc 2Journal 5Unranked 6
YearRankTypeTitle / Venue / Authors
2015 J jnl
Automated measurement of sintering degree in optical microscopy through image analysis of particle joins.
Pattern Recognit.
Frida Nellros, Matthew J. Thurley, Håkan Jonsson, Charlotte Andersson, Seija P. E. Forsmo
2015 C conf
Using flipped classroom, peer discussion, and just-in-time teaching to increase learning in a programming course.
FIE
Håkan Jonsson
2014 — conf
Structuring and Presenting Lifelogs Based on Location Data.
MindCare
Basel Kikhia, Andrey Boytsov, Josef Hallberg, Zaheer ul Hussain Sani, Håkan Jonsson, Kåre Synnes
2013 Misc conf
Adaptive Morphological Filtering of Incomplete Data.
DICTA
Anders Landström, Matthew J. Thurley, Håkan Jonsson
2013 C conf
Motivating and preparing first-year students in computer and engineering science.
FIE
Håkan Jonsson
2013 Misc conf
Sub-Millimeter Crack Detection in Casted Steel Using Color Photometric Stereo.
DICTA
Anders Landström, Matthew J. Thurley, Håkan Jonsson
2012 — conf
Voronoi-Based ISD and Site Density Characteristics for Mobile Networks.
VTC Fall
Anders Landström, Håkan Jonsson, Arne Simonsson
2011 — conf
Image Reconstruction by Prioritized Incremental Normalized Convolution.
SCIA
Anders Landström, Frida Nellros, Håkan Jonsson, Matthew J. Thurley
2010 J jnl
Planning Smooth and Obstacle-Avoiding B-Spline Paths for Autonomous Mining Vehicles.
IEEE Trans Autom. Sci. Eng.
Tomas Berglund, Andrej Brodnik, Håkan Jonsson, M. Staffanson, Inge Söderkvist
2004 — conf
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes.
ICCSA (3)
Håkan Jonsson
2003 — conf
An Obstacle-Avoiding Minimum Variation B-Spline Problem.
GMAG
Tomas Berglund, Håkan Jonsson, Inge Söderkvist
2003 J jnl
An approximative solution to the Zookeeper's Problem.
Inf. Process. Lett.
Håkan Jonsson
2002 J jnl
The Traveling Salesman Problem for lines in the plane.
Inf. Process. Lett.
Håkan Jonsson
2000 — —
The Euclidean traveling salesman problem with neighborhoods and a connecting fence.
Håkan Jonsson
1999 J jnl
Finding the Shortest Watchman Route in a Simple Polygon.
Discret. Comput. Geom.
Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1998 C conf
Evaluating Three-Dimensional Information Visualization Designs: A Case Study of Three Designs.
IV
Ulrika Wiss, David A. Carr, Håkan Jonsson
1995 B conf
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.
WADS
Svante Carlsson, Håkan Jonsson
1993 B conf
Finding the Shortest Watchman Route in a Simple Polygon.
ISAAC
Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1993 — conf
Guarding a Treasury.
CCCG
Svante Carlsson, Håkan Jonsson