一本道

Platsh氓llare f枚r saknad bild till Peter Jonsson

Peter Jonsson

Professor, Enhetschef

Professor i datavetenskap

CV (in English)

Academic Degrees

  • Professor in Computer Science, 一本道, 2004.
  • PhD in Computer Science, 一本道, 1996. Dissertation title: Studies in Action Planning: Algorithms and Complexity. Advisor:
    Christer Bäckström.
  • MSc in Computer Science, Linköpings University, 1993. Thesis title: Alternative Constructions of Reexive Scott Domains. Advisor: Karl-Johan Bäckström.

Employment

  • Professor in Computer Science, 一本道, 2004.
  • Associate professor (Docent) in Computer Science, 一本道, 1998.
  • Assistant professor (Lektor) in Computer Science, 一本道, 1997.

Teaching


PhD Advising

Main advisor for the following completed PhDs:

  • Biman Roy, Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems (Apr, 2020)
  • Simon St氓hlberg, Methods for Detecting Unsolvable Planning Instances Using Variable Projection (Oct, 2017)
  • Meysam Aghighi, Computational Complexity of Some Optimization Problems in Planning (Jun, 2017)
  • Victor Lagerkvist, Strong Partial Clones and the Complexity of Constraint Satisfaction Problems: Limitations and Applications (Feb, 2016)
  • Hannes Uppman, On Some Combinatorial Optimization Problems: Algorithms and Complexity (May, 2015)
  • Tommy F盲rnqvist, Exploiting Structure in CSP-related Problems (Feb, 2013)
  • Johan Thapper, Aspects of a Constraint Optimisation Problem (Feb, 2010)
  • Fredrik Kuivinen, Algorithms and Hardness Results for Some Valued CSPs (Dec, 2009)
  • Gustav Nordh, Complexity Dichotomies for CSP-related Problems (Jun, 2007)
  • Magnus Wahlstr枚m, Algorithms, Measures, and Upper Bounds for Satisability and Related Problems (Apr, 2007)

 


  • Vilhelm Dahll枚f, Exact Algorithms for Exact Satisability Problems (Jun, 2006)
  • Ola Angelsmark, Constructing Algorithms for Constraint Satisfaction and Related Problems: Methods and Applications (Jun, 2005)
  • Mathias Broxvall, A Study in the Computational Complexity of Temporal Reasoning (Dec, 2002)

Co-advisor for the following completed PhDs:

Niklas Johansson, A Resource for Quantum Computation (Jan, 2022, Dept. of EE, Link枚ping University)

Currently main advisor for George Osipov.

Co-advisor for Leif Eriksson and Christoffer Hindlycke (Dept. of EE, Link枚ping University.)

Postdocs

Supervised postdocs:

  • Victor Lagerkvist (2018 - 2020)
  • Micha艂 Wrona (2012 -2014)
  • Johannes Schmidt (2012- 2013)
  • Stefanie Kosuch (2010- 2012)
  • Rustem Takhanov (2009- 2011)

Publikationer

2026

Johannes Klaus Fichte, Johanna Groven, Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas (2026) Proceedings of the 35th International Joint Conference on Artificial Intelligence (Konferensbidrag)
Fredrik Pr盲ntare, Leif Eriksson, George Osipov, Fredrik Heintz, Peter Jonsson (2026) Autonomous Agents and Multi-Agent Systems, Vol. 40, Artikel 30 (Artikel i tidskrift)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov (2026) Journal of computer and system sciences (Print), Vol. 159, Artikel 103780 (Artikel i tidskrift)

2025

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstr枚m (2025) Proc. 33rd Annual European Symposium on Algorithms (ESA-2025), Artikel 88 (Konferensbidrag)
Konrad k. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrom (2025) ACM Transactions on Algorithms, Vol. 21, Artikel 44 (Artikel i tidskrift)

2024

Peter Jonsson, Victor Lagerkvist, George Osipov (2024) 30TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2024, Artikel 15 (Konferensbidrag)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, 沤aneta Semani拧inov谩 (2024) SIAM journal on computing (Print), Vol. 53, s. 1293-1353 (Artikel i tidskrift)

Om avdelningen

Kollegor vid AIICS

Om institutionen