Manuel Sorge

653 total citations
36 papers, 187 citations indexed

About

Manuel Sorge is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Manuel Sorge has authored 36 papers receiving a total of 187 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 10 papers in Computer Networks and Communications and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Manuel Sorge's work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (18 papers) and Graph Labeling and Dimension Problems (5 papers). Manuel Sorge is often cited by papers focused on Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (18 papers) and Graph Labeling and Dimension Problems (5 papers). Manuel Sorge collaborates with scholars based in Germany, Poland and Austria. Manuel Sorge's 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 and has published in prestigious journals such as Artificial Intelligence, Journal of Computer and System Sciences and Journal of Artificial Intelligence Research.

In The Last Decade

Manuel Sorge

31 papers receiving 184 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Manuel Sorge Germany 8 102 59 33 32 18 36 187
Johannes Uhlmann Germany 9 175 1.7× 79 1.3× 40 1.2× 65 2.0× 7 0.4× 19 268
Yasushi Kawase Japan 8 33 0.3× 64 1.1× 49 1.5× 35 1.1× 15 0.8× 32 186
René van Bevern Germany 8 89 0.9× 52 0.9× 10 0.3× 16 0.5× 11 0.6× 22 173
Tasuku Soma Japan 7 100 1.0× 62 1.1× 21 0.6× 62 1.9× 8 0.4× 15 169
Janka Chlebı́ková Slovakia 8 241 2.4× 138 2.3× 11 0.3× 32 1.0× 14 0.8× 25 327
Rupkumar Mahapatra India 8 59 0.6× 23 0.4× 45 1.4× 58 1.8× 32 1.8× 17 201
Ignasi Sau France 9 222 2.2× 87 1.5× 8 0.2× 31 1.0× 7 0.4× 77 294
Rastislav Kráľovič Slovakia 9 113 1.1× 154 2.6× 38 1.2× 49 1.5× 7 0.4× 32 255
Oren Ben-Zwi Israel 5 72 0.7× 44 0.7× 116 3.5× 19 0.6× 14 0.8× 8 194
Joshua R. Wang United States 9 41 0.4× 37 0.6× 6 0.2× 48 1.5× 24 1.3× 13 131

Countries citing papers authored by Manuel Sorge

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Manuel Sorge

This figure shows the co-authorship network connecting the top 25 collaborators of Manuel Sorge. A scholar is included among the top collaborators of Manuel Sorge based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Manuel Sorge. Manuel Sorge is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kobourov, Stephen, Maarten Löffler, Fabrizio Montecchiani, et al.. (2025). The influence of dimensions on the complexity of computing decision trees. Artificial Intelligence. 343. 104322–104322. 2 indexed citations
2.
Chen, Jiehua, Hendrik Molter, Manuel Sorge, & Ondřej Suchý. (2024). Cluster Editing for Multi-Layer and Temporal Graphs. Theory of Computing Systems. 68(5). 1239–1290.
3.
Chen, Jiehua, et al.. (2023). Game Implementation: What Are the Obstructions?. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5557–5564. 1 indexed citations
4.
Kobourov, Stephen, Maarten Löffler, Fabrizio Montecchiani, et al.. (2023). The Influence of Dimensions on the Complexity of Computing Decision Trees. Proceedings of the AAAI Conference on Artificial Intelligence. 37(7). 8343–8350. 6 indexed citations
5.
Ganian, Robert, et al.. (2022). Threshold Treewidth and Hypertree Width. Journal of Artificial Intelligence Research. 74. 1687–1713. 1 indexed citations
6.
Pilipczuk, Marcin, et al.. (2022). Packing Directed Cycles Quarter- and Half-Integrally. COMBINATORICA. 42(S2). 1409–1438. 1 indexed citations
7.
Kowalik, Łukasz, et al.. (2020). The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
8.
Bevern, René van, Christian Komusiewicz, Hendrik Molter, et al.. (2020). h-Index manipulation by undoing merges. Quantitative Science Studies. 1(4). 1529–1552. 4 indexed citations
9.
Sorge, Manuel, et al.. (2019). The complexity of routing with collision avoidance. Journal of Computer and System Sciences. 102. 69–86. 5 indexed citations
10.
Chen, Jiehua, et al.. (2018). How hard is it to satisfy (almost) all roommates. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 2 indexed citations
11.
Bevern, René van, et al.. (2018). The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discrete Optimization. 30. 20–50. 3 indexed citations
12.
Chen, Jiehua, Hendrik Molter, Manuel Sorge, & Ondřej Suchý. (2018). Cluster Editing in Multi-Layer and Temporal Graphs. arXiv (Cornell University). 8 indexed citations
13.
Bevern, René van, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, & Toby Walsh. (2016). H-index manipulation by merging articles: Models, theory, and experiments. Artificial Intelligence. 240. 19–35. 17 indexed citations
14.
Molter, Hendrik, et al.. (2016). Enumerating maximal cliques in temporal graphs. 337–344. 19 indexed citations
15.
Bevern, René van, et al.. (2015). Exploiting hidden structure in selecting dimensions that distinguish vectors. Journal of Computer and System Sciences. 82(3). 521–535. 5 indexed citations
16.
Komusiewicz, Christian & Manuel Sorge. (2015). An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discrete Applied Mathematics. 193. 145–161. 17 indexed citations
17.
Chen, Jiehua, Christian Komusiewicz, Rolf Niedermeier, et al.. (2015). Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM Journal on Discrete Mathematics. 29(1). 1–25. 5 indexed citations
18.
Kratsch, Stefan & Manuel Sorge. (2015). On Kernelization and Approximation for the Vector Connectivity Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
19.
Bevern, René van, Sepp Hartung, André Nichterlein, & Manuel Sorge. (2014). Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Operations Research Letters. 42(4). 290–292. 9 indexed citations
20.
Sorge, Manuel, René van Bevern, Rolf Niedermeier, & Mathias Weller. (2012). A new view on Rural Postman based on Eulerian Extension and Matching. Journal of Discrete Algorithms. 16. 12–33. 9 indexed citations

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

Breakdown of academic impact, for papers by Johannes Uhlmann Breakdown of academic impact, for papers by Yasushi Kawase Breakdown of academic impact, for papers by René van Bevern Breakdown of academic impact, for papers by Tasuku Soma Breakdown of academic impact, for papers by Janka Chlebı́ková Breakdown of academic impact, for papers by Rupkumar Mahapatra Breakdown of academic impact, for papers by Ignasi Sau Breakdown of academic impact, for papers by Rastislav Kráľovič Breakdown of academic impact, for papers by Oren Ben-Zwi Breakdown of academic impact, for papers by Joshua R. Wang
Rankless by CCL
2026