Peter Jonsson

Citeras av

	Alla	Sedan 2020
Citat	3274	667
h-index	32	13
i10-index	78	16

200

100

150

19961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202516 24 44 51 53 49 59 93 76 139 136 153 128 115 96 117 171 141 142 134 166 194 154 103 104 149 117 129 144 23

Offentlig åtkomst

Visa alla

48 artiklar

2 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Andrei KrokhinProfessor of Computer Science, Durham University, UKVerifierad e-postadress på durham.ac.uk
Thomas DrakengrenQrendo ABVerifierad e-postadress på drakengren.com
Victor LagerkvistAssociate professor at Linköping UniversityVerifierad e-postadress på liu.se
Sebastian OrdyniakUniversity of LeedsVerifierad e-postadress på sheffield.ac.uk
Manuel BodirskyTU Dresden, Institut für AlgebraVerifierad e-postadress på tu-dresden.de
Johan ThapperUniversité Paris-Est, Marne-la-ValléeVerifierad e-postadress på u-pem.fr
Peter JeavonsProfessor of Computer Science, University of OxfordVerifierad e-postadress på cs.ox.ac.uk
Magnus WahlströmRoyal Holloway, University of LondonVerifierad e-postadress på rhul.ac.uk
George OsipovPhD Student at Linköping UniversityVerifierad e-postadress på liu.se
Ola AngelsmarkEmbedded security, SBI EngineeringVerifierad e-postadress på sbie.se
Patrik HaslumAustralian National UniversityVerifierad e-postadress på anu.edu.au
Konrad K. DabrowskiNewcastle UniversityVerifierad e-postadress på newcastle.ac.uk
Simon StåhlbergLinköping UniversityVerifierad e-postadress på liu.se
Anders JonssonArtificial Intelligence and Machine Learning group, Universitat Pompeu FabraVerifierad e-postadress på upf.edu
Inger Erlander KleinAssociate professorVerifierad e-postadress på liu.se
Marco KuhlmannLinköping UniversityVerifierad e-postadress på liu.se
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerifierad e-postadress på szeider.net
Timo von OertzenProfessor of Quantitative Psychology, University of the Federal Forces, MunichVerifierad e-postadress på unibw.de
Meysam AghighiRAN Data Scientist, EricssonVerifierad e-postadress på ericsson.com
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu FabraVerifierad e-postadress på upf.edu

Följ

Peter Jonsson

Professor in Computer Science, Linköping University

Verifierad e-postadress på liu.se - Startsida

Computer Science Mathematics


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
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	136	2004
State-variable planning under structural restrictions: Algorithms and complexity P Jonsson, C Bäckström Artificial Intelligence 100 (1-2), 125-176, 1998	127	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	107	2005
A unifying approach to temporal constraint reasoning P Jonsson, C Bäckström Artificial Intelligence 102 (1), 143-155, 1998	103	1998
A complete classification of tractability in RCC-5 T Drakengren, P Jonsson Journal of Artificial Intelligence Research 6, 211-221, 1997	103	1997
Some results on the complexity of planning with incomplete information P Haslum, P Jonsson Recent Advances in AI Planning: 5th European Conference on Planning, ECP’99 …, 2000	101	2000
Building tractable disjunctive constraints D Cohen, P Jeavons, P Jonsson, M Koubarakis Journal of the ACM (JACM) 47 (5), 826-853, 2000	91	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	68	2002
The approximability of three-valued Max CSP P Jonsson, M Klasson, A Krokhin SIAM Journal on Computing 35 (6), 1329-1349, 2006	63	2006
Planning with Reduced Operator Sets. P Haslum, P Jonsson AIPS, 150-158, 2000	61	2000
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	54	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
The complexity of phylogeny constraint satisfaction problems M Bodirsky, P Jonsson, TV Pham ACM Transactions on Computational Logic (TOCL) 18 (3), 1-42, 2017	53	2017
Planning with abstraction hierarchies can be exponentially less efficient C Backstrom, P Jonsson Proceedings of the 14th international joint conference on Artificial …, 1995	51	1995
Point algebras for temporal reasoning: Algorithms and complexity M Broxvall, P Jonsson Artificial Intelligence 149 (2), 179-220, 2003	50	2003
A linear-programming approach to temporal reasoning P Jonsson, C Bäckström Proceedings of the thirteenth national conference on Artificial intelligence …, 1996	48	1996
Incremental planning P Jonsson, C Bäckström New directions in AI planning, 79-90, 1996	48	1996

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare