Johannes Uhlmann

811 total citations
19 papers, 268 citations indexed

About

Johannes Uhlmann is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Johannes Uhlmann has authored 19 papers receiving a total of 268 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Johannes Uhlmann's work include Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (11 papers) and Interconnection Networks and Systems (4 papers). Johannes Uhlmann is often cited by papers focused on Advanced Graph Theory Research (12 papers), Complexity and Algorithms in Graphs (11 papers) and Interconnection Networks and Systems (4 papers). Johannes Uhlmann collaborates with scholars based in Germany, United States and Australia. Johannes Uhlmann's co-authors include Christian Komusiewicz, Rolf Niedermeier, Nadja Betzler, Jiong Guo, Mathias Weller, André Nichterlein, Michael R. Fellows, Robert Bredereck, Falk Hüffner and Erhan Kenar and has published in prestigious journals such as European Journal of Operational Research, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Johannes Uhlmann

18 papers receiving 262 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Johannes Uhlmann Germany 9 175 79 65 40 37 19 268
Manuel Sorge Germany 8 102 0.6× 59 0.7× 32 0.5× 33 0.8× 15 0.4× 36 187
T. Feder United States 7 108 0.6× 67 0.8× 59 0.9× 21 0.5× 29 0.8× 8 209
Neeldhara Misra India 10 211 1.2× 71 0.9× 52 0.8× 7 0.2× 54 1.5× 38 268
Janka Chlebı́ková Slovakia 8 241 1.4× 138 1.7× 32 0.5× 11 0.3× 7 0.2× 25 327
Warren Schudy United States 8 77 0.4× 45 0.6× 94 1.4× 27 0.7× 52 1.4× 12 228
Johan Wästlund Sweden 10 74 0.4× 54 0.7× 57 0.9× 14 0.3× 19 0.5× 31 274
Yushi Uno Japan 8 188 1.1× 70 0.9× 38 0.6× 9 0.2× 6 0.2× 39 246
Martha Sideri Greece 10 169 1.0× 132 1.7× 126 1.9× 49 1.2× 5 0.1× 18 348
Toshihiro Fujito Japan 10 287 1.6× 193 2.4× 45 0.7× 8 0.2× 5 0.1× 25 386
Stephan Kreutzer Germany 15 489 2.8× 139 1.8× 155 2.4× 10 0.3× 9 0.2× 48 588

Countries citing papers authored by Johannes Uhlmann

Since Specialization
Citations

This map shows the geographic impact of Johannes Uhlmann'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 Johannes Uhlmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johannes Uhlmann more than expected).

Fields of papers citing papers by Johannes Uhlmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Johannes Uhlmann. 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 Johannes Uhlmann. The network helps show where Johannes Uhlmann may publish in the future.

Co-authorship network of co-authors of Johannes Uhlmann

This figure shows the co-authorship network connecting the top 25 collaborators of Johannes Uhlmann. A scholar is included among the top collaborators of Johannes Uhlmann 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 Johannes Uhlmann. Johannes Uhlmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Uhlmann, Johannes & Mathias Weller. (2013). Two-Layer Planarization parameterized by feedback edge set. Theoretical Computer Science. 494. 99–111. 3 indexed citations
2.
Nichterlein, André, Rolf Niedermeier, Johannes Uhlmann, & Mathias Weller. (2012). On tractable cases of Target Set Selection. Social Network Analysis and Mining. 3(2). 233–256. 41 indexed citations
3.
Komusiewicz, Christian & Johannes Uhlmann. (2012). Cluster editing with locally bounded modifications. Discrete Applied Mathematics. 160(15). 2259–2270. 44 indexed citations
4.
Betzler, Nadja, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, & Johannes Uhlmann. (2012). On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica. 68(3). 715–738. 5 indexed citations
5.
Uhlmann, Johannes, et al.. (2011). Editors’ Note: ISAAC 2009 Special Section. Algorithmica. 61(4). 923–923.
6.
Dorn, Britta, et al.. (2011). Exploiting bounded signal flow for graph orientation based on cause–effect pairs. Algorithms for Molecular Biology. 6(1). 21–21. 6 indexed citations
7.
Betzler, Nadja, Robert Bredereck, Rolf Niedermeier, & Johannes Uhlmann. (2011). On Bounded-Degree Vertex Deletion parameterized by treewidth. Discrete Applied Mathematics. 160(1-2). 53–60. 17 indexed citations
8.
Weller, Mathias, Christian Komusiewicz, Rolf Niedermeier, & Johannes Uhlmann. (2011). On making directed graphs transitive. Journal of Computer and System Sciences. 78(2). 559–574. 4 indexed citations
9.
Betzler, Nadja, Arkadii Slinko, & Johannes Uhlmann. (2011). On the Computation of Fully Proportional Representation. SSRN Electronic Journal. 3 indexed citations
10.
Guo, Jiong, Iyad Kanj, Christian Komusiewicz, & Johannes Uhlmann. (2011). Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica. 61(4). 949–970. 8 indexed citations
11.
Komusiewicz, Christian, Rolf Niedermeier, & Johannes Uhlmann. (2010). Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring. Journal of Discrete Algorithms. 9(1). 137–151. 13 indexed citations
12.
Fellows, Michael R., Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, & Johannes Uhlmann. (2010). Graph-based data clustering with overlaps. Discrete Optimization. 8(1). 2–17. 32 indexed citations
13.
Guo, Jiong, Christian Komusiewicz, Rolf Niedermeier, & Johannes Uhlmann. (2010). A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM Journal on Discrete Mathematics. 24(4). 1662–1683. 20 indexed citations
14.
Hartung, Sepp, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, & Johannes Uhlmann. (2010). Exact Algorithms and Experiments for Hierarchical Tree Clustering. Proceedings of the AAAI Conference on Artificial Intelligence. 24(1). 457–462. 2 indexed citations
15.
Betzler, Nadja & Johannes Uhlmann. (2009). Parameterized complexity of candidate control in elections and related digraph problems. Theoretical Computer Science. 410(52). 5425–5442. 43 indexed citations
16.
Guo, Jiong & Johannes Uhlmann. (2009). Kernelization and complexity results for connectivity augmentation problems. Networks. NA–NA. 1 indexed citations
17.
Guo, Jiong, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, & Johannes Uhlmann. (2007). Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research. 186(2). 542–553. 19 indexed citations
18.
Betzler, Nadja, Rolf Niedermeier, & Johannes Uhlmann. (2006). Tree decompositions of graphs: Saving memory in dynamic programming. Discrete Optimization. 3(3). 220–229. 6 indexed citations
19.
Heasley, J. N., et al.. (2005). A New Algorithm for Multiple Hypothesis-based Tracking and Discovery of Potentially Hazardous Near Earth Objects. AAS. 207. 1 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 Manuel Sorge Breakdown of academic impact, for papers by T. Feder Breakdown of academic impact, for papers by Neeldhara Misra Breakdown of academic impact, for papers by Janka Chlebı́ková Breakdown of academic impact, for papers by Warren Schudy Breakdown of academic impact, for papers by Johan Wästlund Breakdown of academic impact, for papers by Yushi Uno Breakdown of academic impact, for papers by Martha Sideri Breakdown of academic impact, for papers by Toshihiro Fujito Breakdown of academic impact, for papers by Stephan Kreutzer
Rankless by CCL
2026