This map shows the geographic impact of Peter Jönsson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Peter Jönsson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Jönsson more than expected).
This network shows the impact of papers produced by Peter Jönsson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Peter Jönsson. The network helps show where Peter Jönsson may publish in the future.
Co-authorship network of co-authors of Peter Jönsson
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Jönsson.
A scholar is included among the top collaborators of Peter Jönsson based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Peter Jönsson. Peter Jönsson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Svenningsson, Josef, Emil Axelsson, Anders Persson, & Peter Jönsson. (2015). Efficient Monadic Streams. Chalmers Research (Chalmers University of Technology).1 indexed citations
5.
Bäckström, Christer & Peter Jönsson. (2011). Limits for compact representations of plans. International Conference on Automated Planning and Scheduling. 18–25.3 indexed citations
Krokhin, Andrei & Peter Jönsson. (2003). Recognizing Frozen Variables in Constraint Satisfaction Problems. Electronic colloquium on computational complexity.1 indexed citations
Krokhin, Andrei, Peter Jeavons, & Peter Jönsson. (2001). A complete classification of complexity in Allen's algebra in the presence of a non-trivial basic relation. Oxford University Research Archive (ORA) (University of Oxford). 83–88.5 indexed citations
10.
Haslum, Patrik & Peter Jönsson. (2000). Planning with reduced operator sets. 150–158.22 indexed citations
11.
Jönsson, Peter & Paolo Liberatore. (1999). On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction. Electronic colloquium on computational complexity. 6.2 indexed citations
Jönsson, Peter, et al.. (1997). Towards a complete classification of tractability in Allen's algebra. International Joint Conference on Artificial Intelligence. 1466–1471.9 indexed citations
14.
Jönsson, Peter, et al.. (1996). Maximal tractable subclasses of Allen's interval algebra: preliminary report. National Conference on Artificial Intelligence. 389–394.15 indexed citations
15.
Jönsson, Peter & Christer Bäckström. (1996). A linear-programming approach to temporal reasoning. National Conference on Artificial Intelligence. 1235–1240.20 indexed citations
16.
Jönsson, Peter, et al.. (1996). Tractable subclasses of the point-interval algebra: a complete classification. Principles of Knowledge Representation and Reasoning. 352–363.6 indexed citations
17.
Jönsson, Peter & Christer Bäckström. (1996). On the size of reactive plans. National Conference on Artificial Intelligence. 1182–1187.1 indexed citations
18.
Bäckström, Christer & Peter Jönsson. (1995). Planning with abstraction hierarchies can be exponentially less efficient. International Joint Conference on Artificial Intelligence. 1599–1604.21 indexed citations
19.
Jönsson, Peter & Christer Bäckström. (1995). Complexity results for state-variable planning under mixed syntactical and structural restrictions. 205–213.5 indexed citations
20.
Jönsson, Peter & Christer Bäckström. (1994). Tractable planning with state variables by exploiting structural restrictions. National Conference on Artificial Intelligence. 998–1003.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.