Stefan Arnborg

4.4k citations
49 papers · 3.1k · 2 hit papers · h-index 18

Impact in

Papers in

Stefan Arnborg

46 papers receiving 2.8k citations

Stefan Arnborg's Hit Papers

Easy problems for tree-decomposable graphs 1991 · 635 citations
6350+13+26Years since publication250500750

Peers

Stefan Arnborg
Comparison fields: 5 of 78
  • Computational Theory and Mathematics 2.2k
  • Artificial Intelligence 434
  • Computer Graphics and Computer-Aided Design 43
  • Computer Networks and Communications 201
  • Discrete Mathematics and Combinatorics 27
Replace Andrzej Proskurowski with:
Andrzej Proskurowski United States
Juraj Hromkovic̆ Germany
Mikko Koivisto Finland
Yossi Shiloach Israel
Dieter Kratsch France
Richard Peng United States
Yves Bertot France
Dimitrios M. Thilikos Greece
Donald W. Loveland United States
Michael J. Dinneen New Zealand
Stefan Arnborg relative to Andrzej Proskurowski United States Andrzej Proskurowski's profile →
Citations per field
00.5×1.5×
Andrzej Proskurowski · 1×
Citations per year

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).

Fields of papers citing papers by Stefan Arnborg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authors

The 23 scholars most cited alongside Stefan Arnborg, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Stefan Arnborg Line = papers co-authored together Stefan Arnborg links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 49 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Complexity of Finding Embeddings in a k -Tree
Hit paper breakdown →
1987885
2
Easy problems for tree-decomposable graphs
Hit paper breakdown →
1991635
3 1989400
4 1985279
5 1986131
6 1993107
7 199083
8 198854
9 199150
10 200645
11 198737
12
Bayesian Games for Threat Prediction and Situation Analysis
200431
13 200529
14 198828
15 200623
16 200019
17 197818
18 199118
19 200715
20 198514

About Stefan Arnborg

Stefan Arnborg is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Psychiatry and Mental health, Software and Control and Systems Engineering, having authored 49 papers that have together received 3.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Bayesian Modeling and Causal Inference (10 papers), Logic, programming, and type systems (7 papers), Military Strategy and Technology (4 papers), Schizophrenia research and treatment (4 papers), Complexity and Algorithms in Graphs (4 papers), semigroups and automata theory (3 papers) and Polynomial and algebraic computation (2 papers). The work is most often cited by research in Computational Theory and Mathematics (2.2k citations), Artificial Intelligence (434 citations), Computer Graphics and Computer-Aided Design (43 citations), Computer Networks and Communications (201 citations) and Discrete Mathematics and Combinatorics (27 citations). Stefan Arnborg has collaborated with scholars based in Sweden, United States and Germany. Frequent co-authors include Andrzej Proskurowski, Derek Gordon Corneil, Detlef G. Seese, Jens Lagergren, Joel Brynielsson, Bruno Courcelle, Erik Gunnar Jönsson, Håkan Hall, Ingrid Agartz and Glenn Lawyer. Their work appears in journals such as BIT Numerical Mathematics, International Journal of Neural Systems, The World Journal of Biological Psychiatry, International Journal of Approximate Reasoning and Journal of Algorithms.

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.

Explore authors with similar magnitude of impact