Research

My area of expertize is algorithms and data structures, in particular geometric ones, and their practical application. My doctorial thesis concerned the Euclidean Traveling Salesman Problem with Neighborhoods and a Connecting Fence, where I showed how additional restrictions (in terms of the shape of neighborhoods and a "fence" as well as the relative position of the neighborhoods) on the classical Travelling Salesman Problem sometimes made it solvable in polynomial time. More recently, I have also be involved in more applied research where we strive to improve the path- and trajectory planning stages for autonomous wheel-loaders at the Swedish mining company LKAB, Luossavaara-Kiirunavaara AB.

Projects

Ongoing projects Duration Amount Funding agencies Partners Comments

Completed projects Duration Amount [SEK] Funding agencies Partners Comments
Scheduling and Resource Optimization 2006 80 000 Process-IT Önnerlövs Pre-study
Algorithms for Shape Matching 2006 80 000 Process-IT Svensk Verktygsteknik Pre-study
Automatic generation of paths (Automatisk framtagning av optimerade körvägar för fjärrlastning) 2005 200 000 LKAB - LTU 323106, LKAB 199553-00MANI
Algorithms for path-planning in transport situations (Algoritmer för vägplanering i transportsituationer) 2004 270 000 Research Council of Norrbotten and LKAB (Norrbottens Forskningsråd och LKAB) - NoFo 04-005, continuation of NoFo 03-006
Algorithms for path-planning for use in transport situations (Algoritmer för vägplanering i transportsituationer) 2003 350 000 Research Council of Norrbotten and LKAB (Norrbottens Forskningsråd och LKAB) - NoFo 03-006
Autonomous Path-Planning for Efficient Transports (Automatisk vägplanering för effektiva transporter) 2001-2002 650 000 Research Council of Norrbotten and LKAB (Norrbottens Forskningsråd och LKAB) - NoFo 01-035
Support for new supervisors (Handledarestöd) 2001-2002 420 000 LTU - -
Support Systems for Autonomous Transports in Mines (Komplexa tekniska system: Ledningssystem för flexibla autonoma transporter i gruvor) 1999-2000 1 300 000 Swedish National Board for Industrial and Technical Development (Närings- och teknikutvecklingsverket NUTEK) With Bengt Lennartsson P10552-1/P10552-2

Scholarships

What
• Travel grant (SEK 20 000) from the Wallenberg Foundation for attending the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993, University of Waterloo.

Review assignments

What
• Program committee for Symposium on Computer Science and Electrical Engineering, Luleå, Sweden, 2002.
• Referee for Information Processing Letters and Discrete Applied Mathematics.
• External reviewer for 5th Scandinavian Workshop on Algorithm Theory (SWAT96) and International Colloquium on Automata, Languages and Programming (ICALP94 and ICALP95).

Assignments at public defences

What
• Faculty opponent at the PhD-defence of Per Carlsson, Uppsala University, Sweden, December 2004. (Opponent vid disputation.)
Thesis: Algorithms for Electronic Power Markets.

Chairman at the defence and supervisor: Prof. Arne Andersson, Uppsala University, Sweden. Examination board: Priv.-Doz. Dr. Sven de Vries, Technischen Universität München, Germany, Ass. Prof.~Anders Lunander, Örebro University, Sweden, and Docent Pierre Elener, Uppsala University, Sweden.
• Discussion leader at the licentiate presentation of Peter Jonsson, Luleå University of Technology, Sweden. June 2008. (Diskutant vid licpresentation.)
Thesis: Positive supercompilation for a higher-order call-by-value language

Chairman at the presentation and supervisor: Assoc. Prof. Johan Nordlander, Luleå University of Technology, Sweden.

Changed: 2010-06-15. 

Is there a need for a correction or an update? Then give specific details (like what page?)in the text field below and click the button.