Peter Jonsson
Linköpings Universitet
H-index: 32
Europe-Sweden
Top articles of Peter Jonsson
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Algorithms and Complexity of Difference Logic | arXiv preprint arXiv:2402.03273 | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov | 2024/2/5 |
Solving infinite-domain CSPs using the patchwork property | Artificial Intelligence | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov | 2023/4/1 |
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs | Algorithmica | Peter Jonsson Victor Lagerkvist | 2023/1 |
Almost consistent systems of linear equations | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov Magnus Wahlström | 2023 | |
Parameterized Complexity Classification for Interval Constraints | arXiv preprint arXiv:2305.13889 | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov Marcin Pilipczuk | 2023/5/23 |
Planning over integers: Compilations and undecidability | Proceedings of the International Conference on Automated Planning and Scheduling | Daniel Gnad Malte Helmert Peter Jonsson Alexander Shleyfman | 2023/7/1 |
Structurally Restricted Fragments of Numeric Planning–a Complexity Analysis | Proceedings of the AAAI Conference on Artificial Intelligence | Alexander Shleyfman Daniel Gnad Peter Jonsson | 2023/6/26 |
Resolving inconsistencies in simple temporal problems: A parameterized approach | Proceedings of the AAAI Conference on Artificial Intelligence | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov | 2022/6/28 |
New Complexity Results for Structurally Restricted Numeric Planning | Alexander Shleyfman Daniel Gnad Peter Jonsson | 2022/4/11 | |
A framework for analysing state-abstraction methods | Artificial Intelligence | Christer Bäckström Peter Jonsson | 2022/1/1 |
Computational Short Cuts in Infinite Domain Constraint Satisfaction | Journal of Artificial Intelligence Research | Peter Jonsson Victor Lagerkvist Sebastian Ordyniak | 2022/11/16 |
Complexity classification transfer for CSPs via algebraic products | arXiv preprint arXiv:2211.03340 | Manuel Bodirsky Peter Jonsson Barnaby Martin Antoine Mottet Žaneta Semanišinová | 2022/11/7 |
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms | Artificial Intelligence | Peter Jonsson Victor Lagerkvist George Osipov | 2021/7/1 |
Lower bounds and faster algorithms for equality constraints | Peter Jonsson Victor Lagerkvist | 2021/1/7 | |
Disjunctive temporal problems under structural restrictions | Proceedings of the AAAI Conference on Artificial Intelligence | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov | 2021/5/18 |
Computational complexity of computing symmetries in finite-domain planning | Journal of Artificial Intelligence Research | Alexander Shleyfman Peter Jonsson | 2021/3 |
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems | Theoretical Computer Science | Peter Jonsson Victor Lagerkvist Johannes Schmidt Hannes Uppman | 2021/11/12 |
Fine-grained time complexity of constraint satisfaction problems | ACM Transactions on Computation Theory (TOCT) | Peter Jonsson Victor Lagerkvist Biman Roy | 2021/1/21 |
Reasoning short cuts in infinite domain constraint satisfaction: Algorithms and lower bounds for backdoors | Peter Jonsson Victor Lagerkvist Sebastian Ordyniak | 2021/10/15 | |
Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics | Journal of Artificial Intelligence Research | Christer Bäckström Peter Jonsson Sebastian Ordyniak | 2021/1/13 |
Co-Authors
