default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHåkan Jonsson 0001
Person information
- affiliation (PhD 2000): Lulea University of Technology, Sweden
Other persons with the same name
- Håkan Jonsson — disambiguation page
- Håkan Jonsson 0002 — Lund University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j5]Frida Nellros, Matthew J. Thurley
, Håkan Jonsson, Charlotte Andersson, Seija P. E. Forsmo:
Automated measurement of sintering degree in optical microscopy through image analysis of particle joins. Pattern Recognit. 48(11): 3451-3465 (2015)- [c13]Håkan Jonsson:
Using flipped classroom, peer discussion, and just-in-time teaching to increase learning in a programming course. FIE 2015: 1-9 - 2014
- [c12]Basel Kikhia, Andrey Boytsov, Josef Hallberg, Zaheer ul Hussain Sani, Håkan Jonsson, Kåre Synnes:
Structuring and Presenting Lifelogs Based on Location Data. MindCare 2014: 133-144 - 2013
- [c11]Anders Landström, Matthew J. Thurley, Håkan Jonsson:
Adaptive Morphological Filtering of Incomplete Data. DICTA 2013: 1-7 - [c10]Anders Landström, Matthew J. Thurley, Håkan Jonsson:
Sub-Millimeter Crack Detection in Casted Steel Using Color Photometric Stereo. DICTA 2013: 1-7 - [c9]Håkan Jonsson:
Motivating and preparing first-year students in computer and engineering science. FIE 2013: 1096-1102 - 2012
- [c8]Anders Landström, Håkan Jonsson, Arne Simonsson:
Voronoi-Based ISD and Site Density Characteristics for Mobile Networks. VTC Fall 2012: 1-5 - 2011
- [c7]Anders Landström, Frida Nellros, Håkan Jonsson, Matthew J. Thurley:
Image Reconstruction by Prioritized Incremental Normalized Convolution. SCIA 2011: 176-185 - 2010
- [j4]Tomas Berglund, Andrej Brodnik, Håkan Jonsson, M. Staffanson, Inge Söderkvist:
Planning Smooth and Obstacle-Avoiding B-Spline Paths for Autonomous Mining Vehicles. IEEE Trans Autom. Sci. Eng. 7(1): 167-172 (2010)
2000 – 2009
- 2004
- [c6]Håkan Jonsson:
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes. ICCSA (3) 2004: 168-177 - 2003
- [j3]Håkan Jonsson:
An approximative solution to the Zookeeper's Problem. Inf. Process. Lett. 87(6): 301-307 (2003) - [c5]Tomas Berglund, Håkan Jonsson, Inge Söderkvist:
An Obstacle-Avoiding Minimum Variation B-Spline Problem. GMAG 2003: 156-161 - 2002
- [j2]Håkan Jonsson:
The Traveling Salesman Problem for lines in the plane. Inf. Process. Lett. 82(3): 137-142 (2002) - 2000
- [b1]Håkan Jonsson:
The Euclidean traveling salesman problem with neighborhoods and a connecting fence. Lulea University of Technology, Sweden, 2000
1990 – 1999
- 1999
- [j1]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. 22(3): 377-402 (1999) - 1998
- [c4]Ulrika Wiss, David A. Carr, Håkan Jonsson:
Evaluating Three-Dimensional Information Visualization Designs: A Case Study of Three Designs. IV 1998: 137-145 - 1995
- [c3]Svante Carlsson, Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. WADS 1995: 122-134 - 1993
- [c2]Svante Carlsson, Håkan Jonsson:
Guarding a Treasury. CCCG 1993: 85-90 - [c1]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. ISAAC 1993: 58-67
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
