Markus Sortland Dregi
-
- Complexity and Algorithms in Graphs 4
- Advanced Graph Theory Research 4
-
- Limits and Structures in Graph Theory 1
-
- Interconnection Networks and Systems 3
Markus Sortland Dregi
3 papers receiving 122 citations
Peers
Comparison fields: 5 of 20
- Computational Theory and Mathematics 104
- Discrete Mathematics and Combinatorics 8
- Computer Networks and Communications 42
- Computer Graphics and Computer-Aided Design 6
- Geometry and Topology 13
Countries citing papers authored by Markus Sortland Dregi
This map shows the geographic impact of Markus Sortland Dregi'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 Markus Sortland Dregi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Sortland Dregi more than expected).
Fields of papers citing papers by Markus Sortland Dregi
This network shows the impact of papers produced by Markus Sortland Dregi. 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 Markus Sortland Dregi. The network helps show where Markus Sortland Dregi may publish in the future.
Co-authorship network
The 6 scholars most cited alongside Markus Sortland Dregi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 70 | |
| 2 | 2016 | 26 | |
| 3 | On the Computational Complexity of Vertex Integrity. | 2014 | 1 |
| 4 | 2013 | 27 |
About Markus Sortland Dregi
Markus Sortland Dregi is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 4 papers that have together received 124 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (4 papers), Advanced Graph Theory Research (4 papers), Interconnection Networks and Systems (3 papers) and Limits and Structures in Graph Theory (1 paper). The work is most often cited by research in Computational Theory and Mathematics (104 citations), Discrete Mathematics and Combinatorics (8 citations) and Computer Networks and Communications (42 citations). Markus Sortland Dregi has collaborated with scholars based in Norway, Netherlands and Poland. Frequent co-authors include Pål Grønås Drange, Daniel Lokshtanov, Hans L. Bodlaender, Fedor V. Fomin, Michał Pilipczuk and Pim van ’t Hof. Their work appears in journals such as SIAM Journal on Computing and Algorithmica.
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.