Peter Jonsson 个人学术档案

引用次数

	总计	2019 年至今
引用	3171	682
h 指数	32	13
i10 指数	76	17

200

100

150

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320248 16 24 43 51 53 46 61 89 81 136 133 151 128 115 95 113 172 140 143 134 170 191 152 103 104 144 117 129 84

开放获取的出版物数量

查看全部

49 篇文章

2 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Andrei KrokhinProfessor of Computer Science, Durham University, UK在 durham.ac.uk 的电子邮件经过验证
Thomas DrakengrenQrendo AB在 drakengren.com 的电子邮件经过验证
Victor LagerkvistAssociate professor at Linköping University在 liu.se 的电子邮件经过验证
Sebastian OrdyniakUniversity of Leeds在 sheffield.ac.uk 的电子邮件经过验证
Manuel BodirskyTU Dresden, Institut für Algebra在 tu-dresden.de 的电子邮件经过验证
Johan ThapperUniversité Paris-Est, Marne-la-Vallée在 u-pem.fr 的电子邮件经过验证
Peter JeavonsProfessor of Computer Science, University of Oxford在 cs.ox.ac.uk 的电子邮件经过验证
George OsipovPhD Student at Linköping University在 liu.se 的电子邮件经过验证
Patrik HaslumAustralian National University在 anu.edu.au 的电子邮件经过验证
Ola AngelsmarkArchitect, Cross Doman Solutions, Advenica在 advenica.com 的电子邮件经过验证
Magnus WahlströmRoyal Holloway, University of London在 rhul.ac.uk 的电子邮件经过验证
Konrad K. DabrowskiNewcastle University在 newcastle.ac.uk 的电子邮件经过验证
Simon StåhlbergLinköping University在 liu.se 的电子邮件经过验证
Anders JonssonArtificial Intelligence and Machine Learning group, Universitat Pompeu Fabra在 upf.edu 的电子邮件经过验证
Inger Erlander KleinAssociate professor在 liu.se 的电子邮件经过验证
Marco KuhlmannLinköping University在 liu.se 的电子邮件经过验证
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austria在 szeider.net 的电子邮件经过验证
Timo von OertzenProfessor of Quantitative Psychology, University of the Federal Forces, Munich在 unibw.de 的电子邮件经过验证
Meysam AghighiRAN Data Scientist, Ericsson在 ericsson.com 的电子邮件经过验证
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu Fabra在 upf.edu 的电子邮件经过验证

关注

Peter Jonsson

Professor in Computer Science, Linköping University

在 liu.se 的电子邮件经过验证 - 首页

Computer Science Mathematics


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	213	2003
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
The complexity of counting homomorphisms seen from the other side V Dalmau, P Jonsson Theoretical Computer Science 329 (1-3), 315-323, 2004	124	2004
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
A unifying approach to temporal constraint reasoning P Jonsson, C Bäckström Artificial Intelligence 102 (1), 143-155, 1998	101	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	100	2005
A complete classification of tractability in RCC-5 T Drakengren, P Jonsson Journal of Artificial Intelligence Research 6, 211-221, 1997	100	1997
Building tractable disjunctive constraints D Cohen, P Jeavons, P Jonsson, M Koubarakis Journal of the ACM (JACM) 47 (5), 826-853, 2000	90	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
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	62	2002
Planning with Reduced Operator Sets. P Haslum, P Jonsson AIPS, 150-158, 2000	60	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
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	55	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
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	52	2013
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
Incremental planning P Jonsson, C Bäckström New directions in AI planning, 79-90, 1996	50	1996
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
The complexity of phylogeny constraint satisfaction problems M Bodirsky, P Jonsson, TV Pham ACM Transactions on Computational Logic (TOCL) 18 (3), 1-42, 2017	45	2017

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用