Peter Jonsson
Professor, Head of Unit
Professor in Computer Science
CV
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)
Publications
2026
Maximum Satisfiability of Simple Temporal Problems
Proceedings of the 35th International Joint Conference on Artificial Intelligence
(Conference paper)
Concise representations and complexity results for welfare-maximizing combinatorial assignment
Autonomous Agents and Multi-Agent Systems, Vol. 40, Article 30
(Article in journal)
https://dx.doi.org/10.1007/s10458-026-09753-9
Algorithms and complexity of difference logic
Journal of computer and system sciences (Print), Vol. 159, Article 103780
(Article in journal)
https://dx.doi.org/10.1016/j.jcss.2026.103780
2025
Parameterized Approximability for Modular Linear Equations
33RD ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, ESA 2025, Article 88
(Conference paper)
Parameterized Approximability for Modular Linear Equations
Proc. 33rd Annual European Symposium on Algorithms (ESA-2025), Article 88
(Conference paper)
https://dx.doi.org/10.4230/LIPICS.ESA.2025.88
Almost Consistent Systems of Linear Equations
ACM Transactions on Algorithms, Vol. 21, Article 44
(Article in journal)
https://dx.doi.org/10.1145/3733107
2024
CSPs with Few Alien Constraints
30TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2024, Article 15
(Conference paper)
https://dx.doi.org/10.4230/LIPIcs.CP.2024.15