Stefan Arnborg

4.4k citations
56 papers · 3.2k · 2 hit papers · h-index 21

Impact in

Papers in

Stefan Arnborg

53 papers receiving 2.9k citations

Stefan Arnborg's Hit Papers

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

Peers

Stefan Arnborg
Comparison fields: 5 of 109
  • Computational Theory and Mathematics 2.2k
  • Discrete Mathematics and Combinatorics 231
  • Computer Graphics and Computer-Aided Design 184
  • Computer Networks and Communications 990
  • Geometry and Topology 214
Replace Andrzej Proskurowski with:
Andrzej Proskurowski United States
Larry Stockmeyer United States
Dimitrios M. Thilikos Greece
Dieter Kratsch France
Jan Van Leeuwen Netherlands
Lowell W. Beineke United States
Yossi Shiloach Israel
Rodney G. Downey New Zealand
Saket Saurabh India
Daniel Lokshtanov Norway
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 25 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 56 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 →
1987866
2
Easy problems for tree-decomposable graphs
Hit paper breakdown →
1991594
3 1989391
4 1985292
5 1986135
6 1993109
7 199079
8 199764
9 198855
10 199148
11 200644
12 199340
13 199839
14 198737
15
Bayesian Games for Threat Prediction and Situation Analysis
200433
16 201233
17 200529
18 198828
19 200623
20 200021

About Stefan Arnborg

Stefan Arnborg is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications and Control and Systems Engineering, having authored 56 papers that have together received 3.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Bayesian Modeling and Causal Inference (9 papers), Complexity and Algorithms in Graphs (8 papers), Formal Methods in Verification (7 papers), semigroups and automata theory (7 papers), Graph Labeling and Dimension Problems (4 papers), Optimal Power Flow Distribution (4 papers) and graph theory and CDMA systems (4 papers). The work is most often cited by research in Computational Theory and Mathematics (2.2k citations), Discrete Mathematics and Combinatorics (231 citations), Computer Graphics and Computer-Aided Design (184 citations), Computer Networks and Communications (990 citations) and Geometry and Topology (214 citations). Stefan Arnborg has collaborated with scholars based in Sweden, United States and Germany. Frequent co-authors include Andrzej Proskurowski, Derek G. Corneil, Detlef Seese, Jens Lagergren, Göran Andersson, David J. Hill, Joel Brynielsson, Bruno Courcelle, Ian A. Hiskens and Ingrid Agartz. Their work appears in journals such as BIT Numerical Mathematics, European Psychiatry, International Journal of Neural Systems, IEEE Transactions on Power Systems and International Journal of Electrical Power & Energy Systems.

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