Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Complexity of Finding Embeddings in a k-Tree
1987605 citationsStefan Arnborg, Derek G. Corneil et al.SIAM Journal on Algebraic and Discrete Methodsprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Stefan Arnborg
Since
Specialization
Citations
This map shows the geographic impact of Stefan Arnborg'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 Stefan Arnborg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Arnborg more than expected).
This network shows the impact of papers produced by Stefan Arnborg. 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 Stefan Arnborg. The network helps show where Stefan Arnborg may publish in the future.
Co-authorship network of co-authors of Stefan Arnborg
This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Arnborg.
A scholar is included among the top collaborators of Stefan Arnborg 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 Stefan Arnborg. Stefan Arnborg is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Brynielsson, Joel & Stefan Arnborg. (2006). An Information Fusion Game Component. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1(2). 108–121.12 indexed citations
Brynielsson, Joel & Stefan Arnborg. (2004). Bayesian Games for Threat Prediction and Situation Analysis. International Conference on Information Fusion. 1125–1132.32 indexed citations
6.
Arnborg, Stefan. (2004). Robust Bayesianism : Imprecise and Paradoxical Reasoning. International Conference on Information Fusion. 407–414.12 indexed citations
7.
Orre, Roland, et al.. (2003). A Bayesian recurrent neural network approach for finding dependencies in large incomplete data sets. International Journal of Neural Systems.2 indexed citations
8.
Arnborg, Stefan. (2000). Human brain informatics: understanding causes of mental illness.6 indexed citations
9.
Arnborg, Stefan. (1999). Learning in prevision Space.. 8–14.1 indexed citations
10.
Arnborg, Stefan. (1997). Emergency control of power systems in voltage unstable conditions.7 indexed citations
Arnborg, Stefan, Derek G. Corneil, & Andrzej Proskurowski. (1987). Complexity of Finding Embeddings in a k-Tree. SIAM Journal on Algebraic and Discrete Methods. 8(2). 277–284.605 indexed citations breakdown →
17.
Arnborg, Stefan & Andrzej Proskurowski. (1985). Problems on graphs with bounded decomposability.. Bulletin of the European Association for Theoretical Computer Science. 25. 7–10.2 indexed citations
18.
Arnborg, Stefan. (1985). Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey.. BIT Numerical Mathematics. 25. 1–23.12 indexed citations
19.
Palme, Jacob, et al.. (1980). The COM teleconferencing system functional specification. STIN. 82. 21491.1 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.