Peter Jonsson - RankMe

184 papers A* 26A 20B 11C 3Misc 5Journal 107Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms and complexity of difference logic. J. Comput. Syst. Sci. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2025	J	`jnl`	Almost Consistent Systems of Linear Equations. ACM Trans. Algorithms Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	J	`jnl`	Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables. CoRR Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlström
2025	A	`conf`	Parameterized Approximability for Modular Linear Equations. ESA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	J	`jnl`	Parameterized Approximability for Modular Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2024	J	`jnl`	Algorithms and Complexity of Difference Logic. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2024	A	`conf`	CSPs with Few Alien Constraints. CP Peter Jonsson, Victor Lagerkvist, George Osipov
2024	J	`jnl`	CSPs with Few Alien Constraints. CoRR Peter Jonsson, Victor Lagerkvist, George Osipov
2024	J	`jnl`	Complexity Classification Transfer for CSPs via Algebraic Products. SIAM J. Comput. Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
2024	J	`jnl`	Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	A*	`conf`	Almost Consistent Systems of Linear Equations. SODA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	J	`jnl`	General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs. Algorithmica Peter Jonsson, Victor Lagerkvist
2023	B	`conf`	Parameterized Complexity Classification for Interval Constraints. IPEC Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023	J	`jnl`	Parameterized Complexity Classification for Interval Constraints. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023	A*	`conf`	Planning over Integers: Compilations and Undecidability. ICAPS Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman
2023	J	`jnl`	Solving infinite-domain CSPs using the patchwork property. Artif. Intell. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2023	A*	`conf`	Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. AAAI Alexander Shleyfman, Daniel Gnad, Peter Jonsson
2022	J	`jnl`	A framework for analysing state-abstraction methods. Artif. Intell. Christer Bäckström, Peter Jonsson
2022	J	`jnl`	Almost Consistent Systems of Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2022	J	`jnl`	Complexity Classification Transfer for CSPs via Algebraic Products. CoRR Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
2022	J	`jnl`	Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022	J	`jnl`	Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022	A*	`conf`	Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms. Artif. Intell. Peter Jonsson, Victor Lagerkvist, George Osipov
2021	J	`jnl`	Computational Complexity of Computing Symmetries in Finite-Domain Planning. J. Artif. Intell. Res. Alexander Shleyfman, Peter Jonsson
2021	J	`jnl`	Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2021	A*	`conf`	Disjunctive Temporal Problems under Structural Restrictions. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory Peter Jonsson, Victor Lagerkvist, Biman Roy
2021	A	`conf`	Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2021	A*	`conf`	Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021	J	`jnl`	The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2020	A*	`conf`	Fine-Grained Complexity of Temporal Problems. KR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2020	A*	`conf`	Lower Bounds and Faster Algorithms for Equality Constraints. IJCAI Peter Jonsson, Victor Lagerkvist
2019	A*	`conf`	A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2018	B	`conf`	A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2018	A*	`conf`	Classification Transfer for Qualitative Reasoning Problems. IJCAI Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet
2018	J	`jnl`	Classification transfer for qualitative reasoning problems. CoRR Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet
2018	J	`jnl`	Constants and finite unary relations in qualitative constraint reasoning. Artif. Intell. Peter Jonsson
2018	A*	`conf`	Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2018	J	`jnl`	On the Complexity of CCG Parsing. Comput. Linguistics Marco Kuhlmann, Giorgio Satta, Peter Jonsson
2018	J	`jnl`	Tractability conditions for numeric CSPs. Theor. Comput. Sci. Peter Jonsson, Johan Thapper
2018	B	`conf`	Why are CSPs Based on Partition Schemes Computationally Hard?. MFCS Peter Jonsson, Victor Lagerkvist
2017	J	`jnl`	A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. Manuel Bodirsky, Peter Jonsson
2017	J	`jnl`	An initial study of time complexity in infinite-domain constraint satisfaction. Artif. Intell. Peter Jonsson, Victor Lagerkvist
2017	J	`jnl`	Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. Theor. Comput. Sci. Christian Glaßer, Peter Jonsson, Barnaby Martin
2017	J	`jnl`	On the Complexity of CCG Parsing. CoRR Marco Kuhlmann, Giorgio Satta, Peter Jonsson
2017	J	`jnl`	Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2017	J	`jnl`	The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2017	B	`conf`	Time Complexity of Constraint Satisfaction via Universal Algebra. MFCS Peter Jonsson, Victor Lagerkvist, Biman Roy
2017	J	`jnl`	Time Complexity of Constraint Satisfaction via Universal Algebra. CoRR Peter Jonsson, Victor Lagerkvist, Biman Roy
2017	J	`jnl`	Time and Space Bounds for Planning. J. Artif. Intell. Res. Christer Bäckström, Peter Jonsson
2016	A	`conf`	Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
2016	C	`conf`	Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. CiE Christian Glaßer, Peter Jonsson, Barnaby Martin
2016	J	`jnl`	Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. J. Comput. Syst. Sci. Peter Jonsson, Johan Thapper
2016	A	`conf`	Finite Unary Relations and Qualitative Constraint Satisfaction. ECAI Peter Jonsson
2016	J	`jnl`	Refining complexity analyses in planning by exploiting the exponential time hypothesis. Ann. Math. Artif. Intell. Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
2016	A	`conf`	The Complexity of Phylogeny Constraint Satisfaction. STACS Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2016	J	`jnl`	The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2016	A	`conf`	Upper and Lower Time and Space Bounds for Planning. ECAI Christer Bäckström, Peter Jonsson
2015	J	`jnl`	A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2015	J	`jnl`	An Approximability-related Parameter on Graphs - Properties and Applications. Discret. Math. Theor. Comput. Sci. Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2015	J	`jnl`	Constraint Satisfaction Problems around Skolem Arithmetic. CoRR Christian Glaßer, Peter Jonsson, Barnaby Martin
2015	J	`jnl`	Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals. CoRR Peter Jonsson, Johan Thapper
2015	J	`jnl`	Constructing NP-intermediate problems by blowing holes with parameters of various properties. Theor. Comput. Sci. Peter Jonsson, Victor Lagerkvist, Gustav Nordh
2015	J	`jnl`	Maximum Pagenumber-k Subgraph is NP-Complete. CoRR Peter Jonsson, Marco Kuhlmann
2015	J	`jnl`	Parsing to Noncrossing Dependency Graphs. Trans. Assoc. Comput. Linguistics Marco Kuhlmann, Peter Jonsson
2015	J	`jnl`	The Complexity of Phylogeny Constraint Satisfaction. CoRR Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2015	A*	`conf`	Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. AAAI Meysam Aghighi, Peter Jonsson, Simon Ståhlberg
2015	A	`conf`	Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. CP Peter Jonsson, Victor Lagerkvist
2014	J	`jnl`	A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. CoRR Christer Bäckström, Peter Jonsson
2014	—	`conf`	Affine Consistency and the Complexity of Semilinear Constraints. MFCS (2) Peter Jonsson, Johan Thapper
2014	J	`jnl`	Algorithms and Limits for Compact Plan Representations. CoRR Christer Bäckström, Peter Jonsson
2014	J	`jnl`	Automaton Plans. J. Artif. Intell. Res. Christer Bäckström, Anders Jonsson, Peter Jonsson
2014	J	`jnl`	Limitations of acyclic causal graphs for planning. Artif. Intell. Anders Jonsson, Peter Jonsson, Tomas Lööw
2014	A*	`conf`	Oversubscription Planning: Complexity and Compilability. AAAI Meysam Aghighi, Peter Jonsson
2014	—	`conf`	Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. MFCS (2) Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2014	J	`jnl`	Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2013	J	`jnl`	A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013	J	`jnl`	A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. J. Artif. Intell. Res. Christer Bäckström, Peter Jonsson
2013	A	`conf`	Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction. CP Peter Jonsson, Victor Lagerkvist, Gustav Nordh
2013	A*	`conf`	Bridging the Gap Between Refinement and Heuristics in Abstraction. IJCAI Christer Bäckström, Peter Jonsson
2013	A*	`conf`	Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis. SODA Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini
2013	J	`jnl`	Computational complexity of linear constraints over the integers. Artif. Intell. Peter Jonsson, Tomas Lööw
2013	B	`conf`	Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS Christer Bäckström, Peter Jonsson, Simon Ståhlberg
2013	C	`conf`	Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013	A*	`conf`	When Acyclicity Is Not Enough: Limitations of the Causal Graph. ICAPS Anders Jonsson, Peter Jonsson, Tomas Lööw
2012	B	`conf`	Abstracting Abstraction in Search II: Complexity Analysis. SOCS Christer Bäckström, Peter Jonsson
2012	A*	`conf`	Abstracting Abstraction in Search with Applications to Planning. KR Christer Bäckström, Peter Jonsson
2012	J	`jnl`	Algorithms and Limits for Compact Plan Representations. J. Artif. Intell. Res. Christer Bäckström, Peter Jonsson
2012	J	`jnl`	Essential Convexity and Complexity of Semi-Algebraic Constraints Log. Methods Comput. Sci. Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2012	A	`conf`	From Macro Plans to Automata Plans. ECAI Christer Bäckström, Anders Jonsson, Peter Jonsson
2012	J	`jnl`	Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2012	A	`conf`	Macros, Reactive Plans and Compact Representations. ECAI Christer Bäckström, Anders Jonsson, Peter Jonsson
2012	J	`jnl`	Parameterized Complexity and Kernel Bounds for Hard Planning Problems CoRR Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012	J	`jnl`	The Complexity of Planning Revisited - A Parameterized Analysis CoRR Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012	A*	`conf`	The Complexity of Planning Revisited - A Parameterized Analysis. AAAI Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2011	B	`conf`	All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS Christer Bäckström, Peter Jonsson
2011	A*	`conf`	Discrete-Time Temporal Reasoning with Horn DLRs. IJCAI Peter Jonsson, Tomas Lööw
2011	A*	`conf`	Limits for Compact Representation of Plans. ICAPS Christer Bäckström, Peter Jonsson
2011	J	`jnl`	Min CSP on Four Elements: Moving Beyond Submodularity CoRR Peter Jonsson, Fredrik Kuivinen, Johan Thapper
2011	A	`conf`	Min CSP on Four Elements: Moving beyond Submodularity. CP Peter Jonsson, Fredrik Kuivinen, Johan Thapper
2010	J	`jnl`	Approximability of Clausal Constraints. Theory Comput. Syst. Peter Jonsson, Gustav Nordh
2010	J	`jnl`	Approximating integer programs with positive right-hand sides. Inf. Process. Lett. Peter Jonsson, Johan Thapper
2010	J	`jnl`	Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction CoRR Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2010	J	`jnl`	Retractions to Pseudoforests. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
2009	Misc	`conf`	Approximability Distance in the Space of CSR Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009	Misc	`conf`	Approximability of the Maximum Solution Problem for Certain Families of Algebras. CSR Peter Jonsson, Johan Thapper
2009	J	`jnl`	Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts CoRR Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009	J	`jnl`	Hard constraint satisfaction problems have hard gaps at location 1. Theor. Comput. Sci. Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
2009	J	`jnl`	Properties of an Approximability-related Parameter on Circular Complete Graphs. Electron. Notes Discret. Math. Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009	—	`conf`	Semilinear Program Feasibility. ICALP (2) Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2008	J	`jnl`	Approximability Distance in the Space of H-Colourability Problems CoRR Tommy Färnqvist, Peter Jonsson, Johan Thapper
2008	J	`jnl`	Computational complexity of auditing finite attributes in statistical databases. J. Comput. Syst. Sci. Peter Jonsson, Andrei A. Krokhin
2008	—	`conf`	Introduction to the Maximum SolutionProblem. Complexity of Constraints Peter Jonsson, Gustav Nordh
2008	J	`jnl`	MAX ONES Generalized to Larger Domains. SIAM J. Comput. Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2008	J	`jnl`	The approximability of MAX CSP with fixed-value constraints. J. ACM Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2007	B	`conf`	Bounded Tree-Width and CSP-Related Problems. ISAAC Tommy Färnqvist, Peter Jonsson
2007	J	`jnl`	Hard constraint satisfaction problems have hard gaps at location 1 CoRR Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
2007	J	`jnl`	Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. J. Comput. Syst. Sci. Peter Jonsson, Andrei A. Krokhin
2007	Misc	`conf`	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. CSR Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
2007	B	`conf`	The Maximum Solution Problem on Graphs. MFCS Peter Jonsson, Gustav Nordh, Johan Thapper
2006	J	`jnl`	Approximability of Integer Programming with Generalised Constraints CoRR Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2006	A	`conf`	Approximability of Integer Programming with Generalised Constraints. CP Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
2006	B	`conf`	Generalised Integer Programming Based on Logically Defined Relations. MFCS Peter Jonsson, Gustav Nordh
2006	J	`jnl`	The Approximability of Three-valued MAX CSP. SIAM J. Comput. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2006	J	`jnl`	The approximability of MAX CSP with fixed-value constraints CoRR Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2005	J	`jnl`	Adding clauses to poor man's logic (without increasing the complexity). J. Appl. Non Class. Logics Peter Jonsson
2005	—	`ch.`	Computational Complexity of Temporal Constraint Problems. Handbook of Temporal Reasoning in Artificial Intelligence Thomas Drakengren, Peter Jonsson
2005	J	`jnl`	Counting models for 2SAT and 3SAT formulae. Theor. Comput. Sci. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
2004	J	`jnl`	Algorithms for four variants of the exact satisfiability problem. Theor. Comput. Sci. Vilhelm Dahllöf, Peter Jonsson, Richard Beigel
2004	A*	`conf`	An Algebraic Approach to the Complexity of Propositional Circumscription. LICS Gustav Nordh, Peter Jonsson
2004	J	`jnl`	Complexity classification in qualitative temporal constraint reasoning. Artif. Intell. Peter Jonsson, Andrei A. Krokhin
2004	J	`jnl`	Constraint Satisfaction Problems on Intervals and Length. SIAM J. Discret. Math. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
2004	J	`jnl`	Recognizing frozen variables in constraint satisfaction problems. Theor. Comput. Sci. Peter Jonsson, Andrei A. Krokhin
2004	Misc	`conf`	The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups. COCOON Gustav Nordh, Peter Jonsson
2004	J	`jnl`	The approximability of three-valued MAX CSP CoRR Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
2004	J	`jnl`	The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci. Víctor Dalmau, Peter Jonsson
2003	A	`conf`	Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. CP Ola Angelsmark, Peter Jonsson
2003	J	`jnl`	Point algebras for temporal reasoning: Algorithms and complexity. Artif. Intell. Mathias Broxvall, Peter Jonsson
2003	J	`jnl`	Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. J. ACM Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
2003	J	`jnl`	Recognizing Frozen Variables in Constraint Satisfaction Problems Electron. Colloquium Comput. Complex. Andrei A. Krokhin, Peter Jonsson
2002	A*	`conf`	An algorithm for counting maximum weighted independent sets and its applications. SODA Vilhelm Dahllöf, Peter Jonsson
2002	Misc	`conf`	Counting Satisfying Assignments in 2-SAT and 3-SAT. COCOON Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
2002	A	`conf`	Determining the Number of Solutions to Binary CSP Instances. CP Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper
2002	J	`jnl`	Disjunctions, independence, refinements. Artif. Intell. Mathias Broxvall, Peter Jonsson, Jochen Renz
2002	C	`conf`	Extending the Point Algebra into the Qualitative Algebra. TIME Andrei A. Krokhin, Peter Jonsson
2002	B	`conf`	Finite Domain Constraint Satisfaction Using Quantum Computation. MFCS Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson
2002	A	`conf`	The Complexity of Constraints on Intervals and Lengths. STACS Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
2001	A*	`conf`	A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. IJCAI Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
2001	J	`jnl`	The complexity of constraints on intervals and lengths Electron. Colloquium Comput. Complex. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
2000	J	`jnl`	Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. Theor. Comput. Sci. Peter Jonsson
2000	J	`jnl`	Building tractable disjunctive constraints. J. ACM David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis
2000	—	`conf`	Disjunctive Temporal Reasoning in Partially Ordered Models of Time. AAAI/IAAI Mathias Broxvall, Peter Jonsson
2000	—	`conf`	Planning with Reduced Operator Sets. AIPS Patrik Haslum, Peter Jonsson
2000	A	`conf`	Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. CP Mathias Broxvall, Peter Jonsson, Jochen Renz
2000	A	`conf`	Some Observations on Durations, Scheduling and Allen's Algebra. CP Ola Angelsmark, Peter Jonsson
2000	J	`jnl`	Towards efficient universal planning: A randomized approach. Artif. Intell. Peter Jonsson, Patrik Haslum, Christer Bäckström
1999	J	`jnl`	Computational Complexity of Relating Time Points with Intervals. Artif. Intell. Peter Jonsson, Thomas Drakengren, Christer Bäckström
1999	J	`jnl`	Efficient planning for a miniature assembly line. Artif. Intell. Eng. Inger Klein, Peter Jonsson, Christer Bäckström
1999	A	`conf`	Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. CP Marcus Bjäreland, Peter Jonsson
1999	J	`jnl`	On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction Electron. Colloquium Comput. Complex. Peter Jonsson, Paolo Liberatore
1999	—	`conf`	Some Results on the Complexity of Planning with Incomplete Information. ECP Patrik Haslum, Peter Jonsson
1999	J	`jnl`	Strong bounds on the approximability of two Pspace-hard problems in propositional planning. Ann. Math. Artif. Intell. Peter Jonsson
1999	A	`conf`	Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. CP Mathias Broxvall, Peter Jonsson
1998	J	`jnl`	A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. Artif. Intell. Thomas Drakengren, Peter Jonsson
1998	J	`jnl`	A Unifying Approach to Temporal Constraint Reasoning. Artif. Intell. Peter Jonsson, Christer Bäckström
1998	J	`jnl`	Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. Inf. Process. Lett. Peter Jonsson
1998	J	`jnl`	Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. J. Log. Comput. Thomas Drakengren, Peter Jonsson
1998	J	`jnl`	State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. Artif. Intell. Peter Jonsson, Christer Bäckström
1998	J	`jnl`	Tractable Plan Existence Does Not Imply Tractable Plan Generation. Ann. Math. Artif. Intell. Peter Jonsson, Christer Bäckström
1997	J	`jnl`	A Complete Classification of Tractability in RCC-5 CoRR Peter Jonsson, Thomas Drakengren
1997	J	`jnl`	A Complete Classification of Tractability in RCC-5. J. Artif. Intell. Res. Peter Jonsson, Thomas Drakengren
1997	J	`jnl`	A Nonapproximability Result for Finite Function Generation. Inf. Process. Lett. Peter Jonsson
1997	J	`jnl`	Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time CoRR Thomas Drakengren, Peter Jonsson
1997	J	`jnl`	Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. J. Artif. Intell. Res. Thomas Drakengren, Peter Jonsson
1997	—	`conf`	Towards a Complete Classification of Tractability in Allen's Algebra. IJCAI Thomas Drakengren, Peter Jonsson
1997	J	`jnl`	Twenty-One Large Tractable Subclasses of Allen's Algebra. Artif. Intell. Thomas Drakengren, Peter Jonsson
1996	—	`conf`	A Linear-Programming Approach to Temporal Reasoning. AAAI/IAAI, Vol. 2 Peter Jonsson, Christer Bäckström
1996	—	`conf`	Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. AAAI/IAAI, Vol. 1 Thomas Drakengren, Peter Jonsson
1996	—	`conf`	On the Size of Reactive Plans. AAAI/IAAI, Vol. 2 Peter Jonsson, Christer Bäckström
1996	A*	`conf`	Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. KR Peter Jonsson, Thomas Drakengren, Christer Bäckström
1995	A*	`conf`	Planning with Abstraction Hierarchies can be Exponentially Less Efficient. IJCAI Christer Bäckström, Peter Jonsson
1994	A*	`conf`	Tractable Planning with State Variables by Exploiting Structural Restrictions. AAAI Peter Jonsson, Christer Bäckström