- Publications
- Influence
Share This Author
The complexity of counting homomorphisms seen from the other side
- V. Dalmau, P. Jonsson
- MathematicsTheor. Comput. Sci.
- 13 December 2004
Some Results on the Complexity of Planning with Incomplete Information
- P. Haslum, P. Jonsson
- MathematicsECP
- 8 September 1999
TLDR
State-Variable Planning Under Structural Restrictions: Algorithms and Complexity
- P. Jonsson, Christer Bäckström
- Computer ScienceArtif. Intell.
- 1 April 1998
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
- A. Krokhin, P. Jeavons, P. Jonsson
- MathematicsJACM
- 1 September 2003
TLDR
A Complete Classification of Tractability in RCC-5
- P. Jonsson, Thomas Drakengren
- MathematicsJ. Artif. Intell. Res.
- 31 May 1997
TLDR
Planning with Reduced Operator Sets
- P. Haslum, P. Jonsson
- MathematicsAIPS
- 14 April 2000
TLDR
Point algebras for temporal reasoning: Algorithms and complexity
- M. Broxvall, P. Jonsson
- Mathematics, Computer ScienceArtif. Intell.
- 1 October 2003
An algorithm for counting maximum weighted independent sets and its applications
- Vilhelm Dahllöf, P. Jonsson
- Mathematics, Computer ScienceSODA '02
- 6 January 2002
We present an O(1.3247n) algorithm for counting the number of independent sets with maximum weight in graphs. We show how this algorithm can be used solving a number of different counting problems:…
Tractable plan existence does not imply tractable plan generation
- P. Jonsson, Christer Bäckström
- Computer Science, EconomicsAnnals of Mathematics and Artificial Intelligence
- 11 January 1998
TLDR
Parsing to Noncrossing Dependency Graphs
- Marco Kuhlmann, P. Jonsson
- Computer ScienceTACL
- 30 November 2015
TLDR
...
...