Roger Labahn

544 total citations
20 papers, 197 citations indexed

About

Roger Labahn is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Roger Labahn has authored 20 papers receiving a total of 197 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 4 papers in Computer Vision and Pattern Recognition. Recurrent topics in Roger Labahn's work include Cellular Automata and Applications (6 papers), Handwritten Text Recognition Techniques (4 papers) and Optimization and Search Problems (3 papers). Roger Labahn is often cited by papers focused on Cellular Automata and Applications (6 papers), Handwritten Text Recognition Techniques (4 papers) and Optimization and Search Problems (3 papers). Roger Labahn collaborates with scholars based in Germany, Austria and France. Roger Labahn's co-authors include Tobias Strauß, Guillaume Fertin, Renu Laskar, Stephen T. Hedetniemi, M. Blatzheim, H. Hölbe, T. S. Pedersen, D. Böckenhoff, F. Pisano and H. Niemann and has published in prestigious journals such as Neural Computation, Neural Networks and Nuclear Fusion.

In The Last Decade

Roger Labahn

19 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
Roger Labahn Germany 9 73 61 60 46 28 20 197
Kei Ohnishi Japan 7 52 0.7× 19 0.3× 53 0.9× 36 0.8× 27 1.0× 55 162
S. Sarwar Pakistan 9 33 0.5× 101 1.7× 217 3.6× 7 0.2× 9 0.3× 51 355
Guillermo Marcus Germany 8 34 0.5× 65 1.1× 33 0.6× 14 0.3× 16 0.6× 16 171
A. Sutherland United Kingdom 5 134 1.8× 28 0.5× 9 0.1× 42 0.9× 17 0.6× 11 246
Kartik Hegde United States 3 77 1.1× 64 1.0× 89 1.5× 80 1.7× 14 0.5× 5 234
X. Vilasís-Cardona Spain 6 40 0.5× 37 0.6× 41 0.7× 4 0.1× 15 0.5× 40 133
Hartmut Koenig Germany 9 106 1.5× 35 0.6× 103 1.7× 142 3.1× 13 0.5× 33 288
William Hasenplaugh United States 9 56 0.8× 47 0.8× 277 4.6× 60 1.3× 33 1.2× 11 380
Prateek Yadav India 10 122 1.7× 51 0.8× 34 0.6× 50 1.1× 12 0.4× 26 220
José M. Badía Spain 8 27 0.4× 49 0.8× 31 0.5× 27 0.6× 16 0.6× 40 175

Countries citing papers authored by Roger Labahn

Since Specialization
Citations

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

Fields of papers citing papers by Roger Labahn

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Roger Labahn

This figure shows the co-authorship network connecting the top 25 collaborators of Roger Labahn. A scholar is included among the top collaborators of Roger Labahn 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 Roger Labahn. Roger Labahn 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.
2.
Labahn, Roger, et al.. (2020). Two Semi-Supervised Training Approaches for Automated Text Recognition. 145–150. 2 indexed citations
3.
Böckenhoff, D., M. Blatzheim, H. Hölbe, et al.. (2018). Reconstruction of magnetic configurations in W7-X using artificial neural networks. Nuclear Fusion. 58(5). 56009–56009. 17 indexed citations
4.
Strauß, Tobias, et al.. (2018). ICFHR2018 Competition on Automated Text Recognition on a READ Dataset. 477–482. 14 indexed citations
5.
Blatzheim, M., et al.. (2018). Neural network performance enhancement for limited nuclear fusion experiment observations supported by simulations. Nuclear Fusion. 59(1). 16012–16012. 5 indexed citations
6.
Strauß, Tobias, et al.. (2017). A Robust and Binarization-Free Approach for Text Line Detection in Historical Documents. 236–241. 20 indexed citations
7.
Strauß, Tobias, et al.. (2016). CITlab ARGUS for Keyword Search in Historical Handwritten Documents - Description of CITlab's System for the ImageCLEF 2016 Handwritten Scanned Document Retrieval Task.. CLEF (Working Notes). 399–412. 2 indexed citations
8.
Strauß, Tobias, et al.. (2016). Regular expressions for decoding of neural network outputs. Neural Networks. 79. 1–11. 5 indexed citations
9.
Strauß, Tobias, et al.. (2012). Design Strategies for Weight Matrices of Echo State Networks. Neural Computation. 24(12). 3246–3276. 52 indexed citations
10.
Fertin, Guillaume & Roger Labahn. (2000). Compounding of gossip graphs. Networks. 36(2). 126–137. 7 indexed citations
11.
Labahn, Roger & André Raspaud. (1997). Periodic gossiping in back-to-back trees. Discrete Applied Mathematics. 75(2). 157–168. 1 indexed citations
12.
Labahn, Roger. (1995). Kernels of minimum size gossip schemes. Discrete Mathematics. 143(1-3). 99–139. 8 indexed citations
13.
Labahn, Roger, Stephen T. Hedetniemi, & Renu Laskar. (1994). Periodic gossiping on trees. Discrete Applied Mathematics. 53(1-3). 235–245. 10 indexed citations
14.
Labahn, Roger, et al.. (1994). Quick gossiping by telegraphs. Discrete Mathematics. 126(1-3). 421–424. 5 indexed citations
15.
Labahn, Roger. (1994). A minimum broadcast graph on 63 vertices. Discrete Applied Mathematics. 53(1-3). 247–250. 10 indexed citations
16.
Labahn, Roger. (1993). Information flows on hypergraphs. Discrete Mathematics. 113(1-3). 71–97. 5 indexed citations
17.
Labahn, Roger. (1993). Some minimum gossip graphs. Networks. 23(4). 333–341. 17 indexed citations
18.
Labahn, Roger. (1989). Extremal broadcasting problems. Discrete Applied Mathematics. 23(2). 139–155. 4 indexed citations
19.
Labahn, Roger. (1986). The telephone problem for trees. Journal of automata, languages and combinatorics. 22(9). 475–485. 9 indexed citations
20.
Labahn, Roger, et al.. (1984). The Telephone Problem for Connected Graphs.. Journal of automata, languages and combinatorics. 20. 557–573. 4 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 Kei Ohnishi Breakdown of academic impact, for papers by S. Sarwar Breakdown of academic impact, for papers by Guillermo Marcus Breakdown of academic impact, for papers by A. Sutherland Breakdown of academic impact, for papers by Kartik Hegde Breakdown of academic impact, for papers by X. Vilasís-Cardona Breakdown of academic impact, for papers by Hartmut Koenig Breakdown of academic impact, for papers by William Hasenplaugh Breakdown of academic impact, for papers by Prateek Yadav Breakdown of academic impact, for papers by José M. Badía
Rankless by CCL
2026