91ÊÓÆµ

Peter Jonsson

Professor, Enhetschef

Professor i datavetenskap

CV (in English)

Academic Degrees

  • Professor in Computer Science, Linköping University, 2004.
  • PhD in Computer Science, Linköping University, 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, Linköping University, 2004.
  • Associate professor (Docent) in Computer Science, Linköping University, 1998.
  • Assistant professor (Lektor) in Computer Science, Linköping University, 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

2023

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma (2023) 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), s. 11:1-11:19 (Konferensbidrag)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström (2023) Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), s. 3179-3217 (Konferensbidrag)
Alexander Shleyfman, Daniel Gnad, Peter Jonsson (2023) THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, s. 12112-12119 (Konferensbidrag)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov (2023) Artificial Intelligence, Vol. 317, Artikel 103880 (Artikel i tidskrift)
Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman (2023)
Peter Jonsson, Victor Lagerkvist (2023) Algorithmica, Vol. 85, s. 188-215 (Artikel i tidskrift)

2022

Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak (2022) The journal of artificial intelligence research, Vol. 75, s. 793-831 (Artikel i tidskrift)

Om avdelningen

Kollegor vid AIICS

Om institutionen