| 2026 | ICALP | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables. | Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlstrm |
| 2026 | KR | Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Jorke M. de Vlas |
| 2025 | ESA | Parameterized Approximability for Modular Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2024 | CP | CSPs with Few Alien Constraints. | Peter Jonsson, Victor Lagerkvist, George Osipov |
| 2023 | AAAI | Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. | Alexander Shleyfman, Daniel Gnad, Peter Jonsson |
| 2023 | SODA | Almost Consistent Systems of Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2022 | AAAI | Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2021 | AAAI | Solving Infinite-Domain CSPs Using the Patchwork Property. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2021 | AAAI | Disjunctive Temporal Problems under Structural Restrictions. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2021 | CP | Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. | Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak |
| 2020 | IJCAI | Lower Bounds and Faster Algorithms for Equality Constraints. | Peter Jonsson, Victor Lagerkvist |
| 2020 | KR | Fine-Grained Complexity of Temporal Problems. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2019 | IJCAI | A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2018 | IJCAI | Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2018 | IJCAI | Classification Transfer for Qualitative Reasoning Problems. | Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet |
| 2018 | MFCS | Why are CSPs Based on Partition Schemes Computationally Hard?. | Peter Jonsson, Victor Lagerkvist |
| 2018 | SoCS | A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2017 | MFCS | Time Complexity of Constraint Satisfaction via Universal Algebra. | Peter Jonsson, Victor Lagerkvist, Biman Roy |
| 2016 | CiE | Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. | Christian Glaer, Peter Jonsson, Barnaby Martin |
| 2016 | ECAI | Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. | Meysam Aghighi, Christer Bckstrm, Peter Jonsson, Simon Sthlberg |
| 2016 | ECAI | Upper and Lower Time and Space Bounds for Planning. | Christer Bckstrm, Peter Jonsson |
| 2016 | ECAI | Finite Unary Relations and Qualitative Constraint Satisfaction. | Peter Jonsson |
| 2016 | STACS | The Complexity of Phylogeny Constraint Satisfaction. | Manuel Bodirsky, Peter Jonsson, Van Trung Pham |
| 2015 | AAAI | Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. | Meysam Aghighi, Peter Jonsson, Simon Sthlberg |
| 2015 | CP | Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. | Peter Jonsson, Victor Lagerkvist |
| 2014 | AAAI | Oversubscription Planning: Complexity and Compilability. | Meysam Aghighi, Peter Jonsson |
| 2014 | MFCS | Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman |
| 2014 | MFCS | Affine Consistency and the Complexity of Semilinear Constraints. | Peter Jonsson, Johan Thapper |
| 2013 | CIAC | Parameterized Complexity and Kernel Bounds for Hard Planning Problems. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2013 | CP | Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. | Peter Jonsson, Victor Lagerkvist, Gustav Nordh |
| 2013 | IJCAI | Bridging the Gap Between Refinement and Heuristics in Abstraction. | Christer Bckstrm, Peter Jonsson |
| 2013 | SODA | Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. | Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini |
| 2013 | SoCS | Fast Detection of Unsolvable Planning Instances Using Local Consistency. | Christer Bckstrm, Peter Jonsson, Simon Sthlberg |
| 2012 | AAAI | The Complexity of Planning Revisited - A Parameterized Analysis. | Christer Bckstrm, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2012 | ECAI | Macros, Reactive Plans and Compact Representations. | Christer Bckstrm, Anders Jonsson, Peter Jonsson |
| 2012 | ECAI | From Macro Plans to Automata Plans. | Christer Bckstrm, Anders Jonsson, Peter Jonsson |
| 2012 | KR | Abstracting Abstraction in Search with Applications to Planning. | Christer Bckstrm, Peter Jonsson |
| 2012 | SoCS | Abstracting Abstraction in Search II: Complexity Analysis. | Christer Bckstrm, Peter Jonsson |
| 2011 | CP | Min CSP on Four Elements: Moving beyond Submodularity. | Peter Jonsson, Fredrik Kuivinen, Johan Thapper |
| 2011 | IJCAI | Discrete-Time Temporal Reasoning with Horn DLRs. | Peter Jonsson, Tomas Lw |
| 2011 | SoCS | All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. | Christer Bckstrm, Peter Jonsson |
| 2009 | CSR | Approximability Distance in the Space of | Tommy Frnqvist, Peter Jonsson, Johan Thapper |
| 2009 | CSR | Approximability of the Maximum Solution Problem for Certain Families of Algebras. | Peter Jonsson, Johan Thapper |
| 2009 | ICALP | Semilinear Program Feasibility. | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen |
| 2007 | CSR | Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
| 2007 | ISAAC | Bounded Tree-Width and CSP-Related Problems. | Tommy Frnqvist, Peter Jonsson |
| 2007 | MFCS | The Maximum Solution Problem on Graphs. | Peter Jonsson, Gustav Nordh, Johan Thapper |
| 2006 | CP | Approximability of Integer Programming with Generalised Constraints. | Peter Jonsson, Fredrik Kuivinen, Gustav Nordh |
| 2006 | MFCS | Generalised Integer Programming Based on Logically Defined Relations. | Peter Jonsson, Gustav Nordh |
| 2004 | COCOON | The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. | Gustav Nordh, Peter Jonsson |
| 2004 | LICS | An Algebraic Approach to the Complexity of Propositional Circumscription. | Gustav Nordh, Peter Jonsson |
| 2003 | CP | Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. | Ola Angelsmark, Peter Jonsson |
| 2002 | COCOON | Counting Satisfying Assignments in 2-SAT and 3-SAT. | Vilhelm Dahllf, Peter Jonsson, Magnus Wahlstrm |
| 2002 | CP | Determining the Number of Solutions to Binary CSP Instances. | Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper |
| 2002 | MFCS | Finite Domain Constraint Satisfaction Using Quantum Computation. | Ola Angelsmark, Vilhelm Dahllf, Peter Jonsson |
| 2002 | SODA | An algorithm for counting maximum weighted independent sets and its applications. | Vilhelm Dahllf, Peter Jonsson |
| 2002 | STACS | The Complexity of Constraints on Intervals and Lengths. | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson |
| 2002 | TIME | Extending the Point Algebra into the Qualitative Algebra. | Andrei A. Krokhin, Peter Jonsson |
| 2001 | IJCAI | A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson |
| 2000 | AAAI | Disjunctive Temporal Reasoning in Partially Ordered Models of Time. | Mathias Broxvall, Peter Jonsson |
| 2000 | CP | Some Observations on Durations, Scheduling and Allen's Algebra. | Ola Angelsmark, Peter Jonsson |
| 2000 | CP | Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. | Mathias Broxvall, Peter Jonsson, Jochen Renz |
| 1999 | CP | Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. | Marcus Bjreland, Peter Jonsson |
| 1999 | CP | Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. | Mathias Broxvall, Peter Jonsson |
| 1997 | IJCAI | Towards a Complete Classification of Tractability in Allen's Algebra. | Thomas Drakengren, Peter Jonsson |
| 1996 | AAAI | Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. | Thomas Drakengren, Peter Jonsson |
| 1996 | AAAI | On the Size of Reactive Plans. | Peter Jonsson, Christer Bckstrm |
| 1996 | AAAI | A Linear-Programming Approach to Temporal Reasoning. | Peter Jonsson, Christer Bckstrm |
| 1996 | KR | Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. | Peter Jonsson, Thomas Drakengren, Christer Bckstrm |
| 1995 | IJCAI | Planning with Abstraction Hierarchies can be Exponentially Less Efficient. | Christer Bckstrm, Peter Jonsson |
| 1994 | AAAI | Tractable Planning with State Variables by Exploiting Structural Restrictions. | Peter Jonsson, Christer Bckstrm |