Citations per year, relative to Christer Bäckström Christer Bäckström (= 1×)
peers
Enrico Giunchiglia
Countries citing papers authored by Christer Bäckström
Since
Specialization
Citations
This map shows the geographic impact of Christer Bäckström'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 Christer Bäckström with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christer Bäckström more than expected).
Fields of papers citing papers by Christer Bäckström
This network shows the impact of papers produced by Christer Bäckström. 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 Christer Bäckström. The network helps show where Christer Bäckström may publish in the future.
Co-authorship network of co-authors of Christer Bäckström
This figure shows the co-authorship network connecting the top 25 collaborators of Christer Bäckström.
A scholar is included among the top collaborators of Christer Bäckström 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 Christer Bäckström. Christer Bäckström is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Bäckström, Christer, et al.. (2015). Cost-optimal and net-benefit planning: a parameterised complexity view. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1487–1493.8 indexed citations
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
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
7.
Bäckström, Christer. (1996). Five years of tractable planning. IOS Press eBooks. 19–33.4 indexed citations
8.
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
9.
Jönsson, Peter & Christer Bäckström. (1996). On the size of reactive plans. National Conference on Artificial Intelligence. 1182–1187.1 indexed citations
10.
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
11.
Jönsson, Peter, et al.. (1995). Tractable Planning for an Assembly Line. KTH Publication Database DiVA (KTH Royal Institute of Technology). 313–324.3 indexed citations
12.
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
Bäckström, Christer. (1994). Executing parallel plans faster by adding actions. European Conference on Artificial Intelligence. 615–619.3 indexed citations
15.
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
16.
Bäckström, Christer & Bernhard Nebel. (1993). Complexity Results for SAS+ Planning.. International Joint Conference on Artificial Intelligence. 1430–1435.178 indexed citations
17.
Nebel, Bernhard & Christer Bäckström. (1992). On the computational complexity of temporal projection and plan validation. National Conference on Artificial Intelligence. 748–753.5 indexed citations
Bäckström, Christer. (1988). A Representation of Coordinated Actions Characterized by Interval Valued Conditions.. 220–229.4 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.