Manuel Sorge
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
-
- Complex Network Analysis Techniques
Papers in
-
- Advanced Graph Theory Research 20
- Complexity and Algorithms in Graphs 18
- Graph Labeling and Dimension Problems 5
-
- Interconnection Networks and Systems 4
- Co-authors
- Rolf Niedermeier (12 shared papers)Christian Komusiewicz (8 shared papers)René van Bevern (9 shared papers)Hannes Moser (2 shared papers)Hendrik Molter (7 shared papers)Jiehua Chen (8 shared papers)Toby Walsh (3 shared papers)Ondřej Suchý (5 shared papers)
In The Last Decade
Manuel Sorge
31 papers receiving 184 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 102
- Statistical and Nonlinear Physics 33
- Computer Graphics and Computer-Aided Design 9
- Computer Networks and Communications 59
- Discrete Mathematics and Combinatorics 7
Countries citing papers authored by Manuel Sorge
This map shows the geographic impact of Manuel Sorge'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 Manuel Sorge with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Manuel Sorge more than expected).
Fields of papers citing papers by Manuel Sorge
This network shows the impact of papers produced by Manuel Sorge. 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 Manuel Sorge. The network helps show where Manuel Sorge may publish in the future.
Co-authors
The 25 scholars most cited alongside Manuel Sorge, 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 36 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 34 | |
| 2 | 2016 | 19 | |
| 3 | 2016 | 17 | |
| 4 | 2015 | 17 | |
| 5 | 2012 | 9 | |
| 6 | 2014 | 9 | |
| 7 | 2018 | 8 | |
| 8 | 2014 | 7 | |
| 9 | 2023 | 6 | |
| 10 | 2019 | 6 | |
| 11 | 2021 | 6 | |
| 12 | 2015 | 5 | |
| 13 | 2019 | 5 | |
| 14 | 2015 | 5 | |
| 15 | 2014 | 5 | |
| 16 | 2020 | 4 | |
| 17 | 2018 | 3 | |
| 18 | 2022 | 3 | |
| 19 | 2019 | 3 | |
| 20 | 2018 | 2 |
About Manuel Sorge
Manuel Sorge is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, Artificial Intelligence and Management Science and Operations Research, having authored 36 papers that have together received 187 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (18 papers), Graph Labeling and Dimension Problems (5 papers), graph theory and CDMA systems (4 papers), Game Theory and Voting Systems (4 papers), Data Mining Algorithms and Applications (4 papers), Interconnection Networks and Systems (4 papers) and Auction Theory and Applications (3 papers). The work is most often cited by research in Computational Theory and Mathematics (102 citations), Statistical and Nonlinear Physics (33 citations), Computer Graphics and Computer-Aided Design (9 citations), Computer Networks and Communications (59 citations) and Discrete Mathematics and Combinatorics (7 citations). Manuel Sorge has collaborated with scholars based in Germany, Poland and Austria. Frequent co-authors include Rolf Niedermeier, Christian Komusiewicz, René van Bevern, Hannes Moser, Hendrik Molter, Jiehua Chen, Toby Walsh, Ondřej Suchý, Mathias Weller and Piotr Skowron. Their work appears in journals such as Theory of Computing Systems, Journal of Computer and System Sciences, Artificial Intelligence, SIAM Journal on Discrete Mathematics and Journal of Combinatorial Optimization.
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.