Klas Markström
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
Papers in ⓘ
-
- Advanced Graph Theory Research 31
- Graph Labeling and Dimension Problems 6
-
- Limits and Structures in Graph Theory 31
- Co-authors
- P. H. Lundow (12 shared papers)Allan Lo (6 shared papers)Andrzej Ruciński (1 shared paper)Anders Rosengren (4 shared papers)Daniel Andrén (6 shared papers)Shmuel Friedland (6 shared papers)Roland Häggkvist (5 shared papers)Anders Behndig (2 shared papers)
- Journals
- Random Structures and Algorithms (5 papers)Discrete Mathematics (5 papers)Nuclear Physics B (4 papers)Combinatorics Probability Computing (4 papers)The Electronic Journal of Combinatorics (4 papers)
- Partner nations
- SwedenUnited KingdomUnited States
In The Last Decade
Klas Markström
64 papers receiving 551 citations
Peers
Comparison fields: 5 of 52
- Discrete Mathematics and Combinatorics 208
- Computational Theory and Mathematics 227
- Condensed Matter Physics 163
- Geometry and Topology 118
- Mathematical Physics 107
Countries citing papers authored by Klas Markström
This map shows the geographic impact of Klas Markströ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 Klas Markström with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klas Markström more than expected).
Fields of papers citing papers by Klas Markström
This network shows the impact of papers produced by Klas Markströ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 Klas Markström. The network helps show where Klas Markström may publish in the future.
Co-authors
The 25 scholars most cited alongside Klas Markström, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 69 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 41 | |
| 2 | 2011 | 40 | |
| 3 | 2014 | 36 | |
| 4 | 2010 | 36 | |
| 5 | 2007 | 26 | |
| 6 | 2009 | 24 | |
| 7 | 2010 | 23 | |
| 8 | 2008 | 21 | |
| 9 | 2005 | 19 | |
| 10 | 2014 | 19 | |
| 11 | 2007 | 18 | |
| 12 | 2012 | 15 | |
| 13 | 2013 | 14 | |
| 14 | 2008 | 14 | |
| 15 | 2004 | 12 | |
| 16 | 2011 | 12 | |
| 17 | 2015 | 12 | |
| 18 | 2022 | 11 | |
| 19 | 2009 | 9 | |
| 20 | 2005 | 9 |
About Klas Markström
Klas Markström is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics and Electrical and Electronic Engineering, having authored 69 papers that have together received 585 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (31 papers), Advanced Graph Theory Research (31 papers), Graph theory and applications (16 papers), graph theory and CDMA systems (15 papers), Stochastic processes and statistical mechanics (12 papers), Theoretical and Computational Physics (11 papers), Markov Chains and Monte Carlo Methods (8 papers) and Graph Labeling and Dimension Problems (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (208 citations), Computational Theory and Mathematics (227 citations), Condensed Matter Physics (163 citations), Geometry and Topology (118 citations) and Mathematical Physics (107 citations). Klas Markström has collaborated with scholars based in Sweden, United Kingdom and United States. Frequent co-authors include P. H. Lundow, Allan Lo, Andrzej Ruciński, Anders Rosengren, Daniel Andrén, Shmuel Friedland, Roland Häggkvist, Anders Behndig, Petras J. Kundrotas and Maria Jönsson. Their work appears in journals such as Random Structures and Algorithms, Discrete Mathematics, Nuclear Physics B, Combinatorics Probability Computing and The Electronic Journal of Combinatorics.
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.