| Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra A Krokhin, P Jeavons, P Jonsson Journal of the ACM (JACM) 50 (5), 591-640, 2003 | 217 | 2003 |
| The complexity of counting homomorphisms seen from the other side V Dalmau, P Jonsson Theoretical Computer Science 329 (1-3), 315-323, 2004 | 152 | 2004 |
| State-variable planning under structural restrictions: Algorithms and complexity P Jonsson, C Bäckström Artificial Intelligence 100 (1-2), 125-176, 1998 | 134 | 1998 |
| Counting models for 2SAT and 3SAT formulae V Dahllöf, P Jonsson, M Wahlström Theoretical Computer Science 332 (1-3), 265-291, 2005 | 114 | 2005 |
| A unifying approach to temporal constraint reasoning P Jonsson, C Bäckström Artificial Intelligence 102 (1), 143-155, 1998 | 105 | 1998 |
| A complete classification of tractability in RCC-5 T Drakengren, P Jonsson Journal of Artificial Intelligence Research 6, 211-221, 1997 | 105 | 1997 |
| Some results on the complexity of planning with incomplete information P Haslum, P Jonsson European Conference on Planning, 308-318, 1999 | 103 | 1999 |
| Building tractable disjunctive constraints D Cohen, P Jeavons, P Jonsson, M Koubarakis Journal of the ACM (JACM) 47 (5), 826-853, 2000 | 92 | 2000 |
| An algorithm for counting maximum weighted independent sets and its applications V Dahllöf, P Jonsson Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002 | 70 | 2002 |
| Planning with Reduced Operator Sets. P Haslum, P Jonsson AIPS, 150-158, 2000 | 63 | 2000 |
| The approximability of three-valued Max CSP P Jonsson, M Klasson, A Krokhin SIAM Journal on Computing 35 (6), 1329-1349, 2006 | 62 | 2006 |
| The complexity of phylogeny constraint satisfaction problems M Bodirsky, P Jonsson, TV Pham ACM Transactions on Computational Logic (TOCL) 18 (3), 1-42, 2017 | 59 | 2017 |
| Eight maximal tractable subclasses of Allen's algebra with metric time T Drakengren, P Jonsson Journal of Artificial Intelligence Research 7, 25-45, 1997 | 59 | 1997 |
| Fast detection of unsolvable planning instances using local consistency C Bäckström, P Jonsson, S Ståhlberg Proceedings of the International Symposium on Combinatorial Search 4 (1), 29-37, 2013 | 57 | 2013 |
| The approximability of Max CSP with fixed-value constraints V Deineko, P Jonsson, M Klasson, A Krokhin Journal of the ACM (JACM) 55 (4), 1-37, 2008 | 54 | 2008 |
| A complete classification of tractability in Allen's algebra relative to subsets of basic relations T Drakengren, P Jonsson Artificial Intelligence 106 (2), 205-219, 1998 | 54 | 1998 |
| Planning with abstraction hierarchies can be exponentially less efficient C Backstrom, P Jonsson Proceedings of the 14th international joint conference on Artificial …, 1995 | 54 | 1995 |
| Point algebras for temporal reasoning: Algorithms and complexity M Broxvall, P Jonsson Artificial Intelligence 149 (2), 179-220, 2003 | 53 | 2003 |
| Incremental planning P Jonsson, C Bäckström New directions in AI planning, 79-90, 1996 | 49 | 1996 |
| Improved algorithms for counting solutions in constraint satisfaction problems O Angelsmark, P Jonsson International Conference on Principles and Practice of Constraint …, 2003 | 47 | 2003 |
Andrei KrokhinProfessor of Computer Science, Durham University, UKVerified email at durham.ac.uk
