Author

Peter Jönsson

Observed names: Jonsson P, Jonsson Peter, Jonsson, P., Jonsson, Peter, P. Jonsson, PETER JONSSON, Peter Jonsson

Observed institutions: Linköping University, University of Leeds, Universitat Pompeu Fabra, Royal Holloway University of London, Technische Universität Dresden, Newcastle University

ORCID: 0000-0002-5288-3330

Observed ORCID: 0000-0002-5288-3330

OpenAlex ID: A5101920004

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

2003 · Andrei Krokhin, Peter Jeavons, et al. · Journal of the ACM · 146

The complexity of counting homomorphisms seen from the other side

2004 · Víctor Dalmau, Peter Jonsson · Theoretical Computer Science · 135

PDF

Counting models for 2SAT and 3SAT formulae

2004 · Vilhelm Dahllöf, Peter Jonsson, et al. · Theoretical Computer Science · 88

PDF

State-variable planning under structural restrictions: algorithms and complexity

1998 · Peter Jonsson, Christer Bäckström · Artificial Intelligence · 88

A unifying approach to temporal constraint reasoning

1998 · Peter Jonsson, Christer Bäckström · Artificial Intelligence · 87

PDF

Essential Convexity and Complexity of Semi-Algebraic Constraints

2012 · Manuel Bodirsky, Peter Jonsson, et al. · Logical Methods in Computer Science · 77

PDF

Building tractable disjunctive constraints

2000 · David Cohen, Peter Jeavons, et al. · Journal of the ACM · 72

PDF

A Complete Classification of Tractability in RCC-5

1997 · T. Drakengren, P. Jonsson · Journal of Artificial Intelligence Research · 72

PDF

Some Results on the Complexity of Planning with Incomplete Information

2000 · Patrik Haslum, Peter Jonsson · Lecture notes in computer science · 71

Complexity of state-variable planning under structural restrictions

1995 · Peter Jönsson · 52

The Approximability of Three-valued MAX CSP

2006 · Peter Jonsson, Mikael Klasson, et al. · SIAM Journal on Computing · 49

PDF

An algorithm for counting maximum weighted independent sets and its applications

2002 · Vilhelm Dahllöf, Peter Jönsson · 45

The approximability of MAX CSP with fixed-value constraints

2008 · Vladimir Deineko, Peter Jonsson, et al. · Journal of the ACM · 44

PDF

The Complexity of Phylogeny Constraint Satisfaction Problems

2017 · Manuel Bodirsky, Peter Jonsson, et al. · ACM Transactions on Computational Logic · 43

PDF

Planning with reduced operator sets

2000 · Patrik Haslum, Peter Jönsson · 40

A Model-Theoretic View on Qualitative Constraint Reasoning

2017 · Manuel Bodirsky, Peter Jonsson · Journal of Artificial Intelligence Research · 38

PDF

Point algebras for temporal reasoning: Algorithms and complexity

2003 · Mathias Broxvall, Peter Jonsson · Artificial Intelligence · 37

PDF

Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time

1997 · T. Drakengren, P. Jonsson · Journal of Artificial Intelligence Research · 37

PDF

A complete classification of tractability in Allen's algebra relative to subsets of basic relations

1998 · Thomas Drakengren, Peter Jonsson · Artificial Intelligence · 36

PDF

Incremental planning

1996 · Peter Jönsson, Christer Bäckström · 36

Parsing to Noncrossing Dependency Graphs

2015 · Marco Kuhlmann, Peter Jonsson · Transactions of the Association for Computational Linguistics · 35

PDF

Twenty-one large tractable subclasses of Allen's algebra

1997 · Thomas Drakengren, Peter Jonsson · Artificial Intelligence · 34

PDF

Algorithms for four variants of the exact satisfiability problem

2004 · Vilhelm Dahllöf, Peter Jonsson, et al. · Theoretical Computer Science · 33

PDF

Strong partial clones and the time complexity of SAT problems

2016 · Peter Jonsson, Victor Lagerkvist, et al. · Journal of Computer and System Sciences · 32

PDF

Min CSP on Four Elements: Moving beyond Submodularity

2011 · Peter Jonsson, Fredrik Kuivinen, et al. · Lecture notes in computer science · 32

Works count: 175

Citation count: 2,590

H-index: 30

I10-index: 66