Peter Jonsson

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 62

Top Venues

CoRR

J. Artif. Intell. Res.

Artif. Intell.

AAAI

Publications

Peter Jonsson, Victor Lagerkvist, George Osipov
CSPs with Few Alien Constraints. CP (2024)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Algorithms and Complexity of Difference Logic. CoRR (2024)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. IPEC (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. CoRR (2023)
Alexander Shleyfman, Daniel Gnad, Peter Jonsson
Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. AAAI (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. SODA (2023)
Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman
Planning over Integers: Compilations and Undecidability. ICAPS (2023)
Peter Jonsson, Victor Lagerkvist
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Algorithmica 85 (1) (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving infinite-domain CSPs using the patchwork property. Artif. Intell. 317 (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI (2022)
Christer Bäckström, Peter Jonsson
A framework for analysing state-abstraction methods. Artif. Intell. 302 (2022)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. CoRR (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR (2022)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
Complexity Classification Transfer for CSPs via Algebraic Products. CoRR (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75 (2022)
Alexander Shleyfman, Peter Jonsson
Computational Complexity of Computing Symmetries in Finite-Domain Planning. J. Artif. Intell. Res. 70 (2021)
Peter Jonsson, Victor Lagerkvist, George Osipov
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. 296 (2021)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. 70 (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Disjunctive Temporal Problems under Structural Restrictions. AAAI (2021)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892 (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR (2021)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory 13 (1) (2021)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP (2021)
Peter Jonsson, Victor Lagerkvist
Lower Bounds and Faster Algorithms for Equality Constraints. IJCAI (2020)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Fine-Grained Complexity of Temporal Problems. KR (2020)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI (2019)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI (2018)
Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet
Classification transfer for qualitative reasoning problems. CoRR (2018)
Peter Jonsson, Victor Lagerkvist
Why are CSPs Based on Partition Schemes Computationally Hard?. MFCS (2018)
Peter Jonsson, Johan Thapper
Tractability conditions for numeric CSPs. Theor. Comput. Sci. 715 (2018)
Peter Jonsson
Constants and finite unary relations in qualitative constraint reasoning. Artif. Intell. 257 (2018)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet
Classification Transfer for Qualitative Reasoning Problems. IJCAI (2018)
Marco Kuhlmann, Giorgio Satta, Peter Jonsson
On the Complexity of CCG Parsing. Comput. Linguistics 44 (3) (2018)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS (2018)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Theor. Comput. Sci. 703 (2017)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. 18 (3) (2017)
Peter Jonsson, Victor Lagerkvist
An initial study of time complexity in infinite-domain constraint satisfaction. Artif. Intell. 245 (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. MFCS (2017)
Marco Kuhlmann, Giorgio Satta, Peter Jonsson
On the Complexity of CCG Parsing. CoRR (2017)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84 (2017)
Manuel Bodirsky, Peter Jonsson
A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. 58 (2017)
Christer Bäckström, Peter Jonsson
Time and Space Bounds for Planning. J. Artif. Intell. Res. 60 (2017)
Peter Jonsson, Victor Lagerkvist, Biman Roy
Time Complexity of Constraint Satisfaction via Universal Algebra. CoRR (2017)
Peter Jonsson, Johan Thapper
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. J. Comput. Syst. Sci. 82 (5) (2016)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. 81 (4) (2016)
Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Refining complexity analyses in planning by exploiting the exponential time hypothesis. Ann. Math. Artif. Intell. 78 (2) (2016)
Christer Bäckström, Peter Jonsson
Upper and Lower Time and Space Bounds for Planning. ECAI (2016)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction. STACS (2016)
Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI (2016)
Peter Jonsson
Finite Unary Relations and Qualitative Constraint Satisfaction. ECAI (2016)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. CiE (2016)
Peter Jonsson, Marco Kuhlmann
Maximum Pagenumber-k Subgraph is NP-Complete. CoRR (2015)
Marco Kuhlmann, Peter Jonsson
Parsing to Noncrossing Dependency Graphs. Trans. Assoc. Comput. Linguistics 3 (2015)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction. CoRR (2015)
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
An Approximability-related Parameter on Graphs - Properties and Applications. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81 (7) (2015)
Peter Jonsson, Johan Thapper
Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals. CoRR (2015)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. 581 (2015)
Christian Glaßer, Peter Jonsson, Barnaby Martin
Constraint Satisfaction Problems around Skolem Arithmetic. CoRR (2015)
Meysam Aghighi, Peter Jonsson, Simon Ståhlberg
Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. AAAI (2015)
Peter Jonsson, Victor Lagerkvist
Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. CP (2015)
Peter Jonsson, Johan Thapper
Affine Consistency and the Complexity of Semilinear Constraints. MFCS (2) (2014)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR (2014)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. MFCS (2) (2014)
Christer Bäckström, Peter Jonsson
Algorithms and Limits for Compact Plan Representations. CoRR (2014)
Meysam Aghighi, Peter Jonsson
Oversubscription Planning: Complexity and Compilability. AAAI (2014)
Anders Jonsson, Peter Jonsson, Tomas Lööw
Limitations of acyclic causal graphs for planning. Artif. Intell. 210 (2014)
Christer Bäckström, Peter Jonsson
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. CoRR (2014)
Christer Bäckström, Anders Jonsson, Peter Jonsson
Automaton Plans. J. Artif. Intell. Res. 51 (2014)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP (2013)
Anders Jonsson, Peter Jonsson, Tomas Lööw
When Acyclicity Is Not Enough: Limitations of the Causal Graph. ICAPS (2013)
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA (2013)
Peter Jonsson, Tomas Lööw
Computational complexity of linear constraints over the integers. Artif. Intell. 195 (2013)
Christer Bäckström, Peter Jonsson
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. J. Artif. Intell. Res. 47 (2013)
Christer Bäckström, Peter Jonsson
Bridging the Gap Between Refinement and Heuristics in Abstraction. IJCAI (2013)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR (2013)
Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS (2013)
Christer Bäckström, Anders Jonsson, Peter Jonsson
Macros, Reactive Plans and Compact Representations. ECAI (2012)
Christer Bäckström, Peter Jonsson
Algorithms and Limits for Compact Plan Representations. J. Artif. Intell. Res. 44 (2012)
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. 22 (3) (2012)
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
The Complexity of Planning Revisited - A Parameterized Analysis CoRR (2012)
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Essential Convexity and Complexity of Semi-Algebraic Constraints Log. Methods Comput. Sci. 8 (4) (2012)
Christer Bäckström, Peter Jonsson
Abstracting Abstraction in Search II: Complexity Analysis. SOCS (2012)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity and Kernel Bounds for Hard Planning Problems CoRR (2012)
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
The Complexity of Planning Revisited - A Parameterized Analysis. AAAI (2012)
Christer Bäckström, Anders Jonsson, Peter Jonsson
From Macro Plans to Automata Plans. ECAI (2012)
Christer Bäckström, Peter Jonsson
Abstracting Abstraction in Search with Applications to Planning. KR (2012)
Christer Bäckström, Peter Jonsson
Limits for Compact Representation of Plans. ICAPS (2011)
Peter Jonsson, Fredrik Kuivinen, Johan Thapper
Min CSP on Four Elements: Moving Beyond Submodularity CoRR (2011)
Christer Bäckström, Peter Jonsson
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS (2011)
Peter Jonsson, Tomas Lööw
Discrete-Time Temporal Reasoning with Horn DLRs. IJCAI (2011)
Peter Jonsson, Fredrik Kuivinen, Johan Thapper
Min CSP on Four Elements: Moving beyond Submodularity. CP (2011)
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction CoRR (2010)
Peter Jonsson, Johan Thapper
Approximating integer programs with positive right-hand sides. Inf. Process. Lett. 110 (10) (2010)
Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
Retractions to Pseudoforests. SIAM J. Discret. Math. 24 (1) (2010)
Peter Jonsson, Gustav Nordh
Approximability of Clausal Constraints. Theory Comput. Syst. 46 (2) (2010)
Peter Jonsson, Johan Thapper
Approximability of the Maximum Solution Problem for Certain Families of Algebras. CSR (2009)
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts CoRR (2009)

Peter Jonsson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Jonsson