Ralf Klasing

2.8k citations
149 papers · 2k · h-index 25

Impact in

Papers in

Ralf Klasing

134 papers receiving 1.9k citations

Peers

Ralf Klasing
Comparison fields: 5 of 40
  • Computational Theory and Mathematics 913
  • Computer Networks and Communications 1.2k
  • Statistical and Nonlinear Physics 75
  • Discrete Mathematics and Combinatorics 19
  • Mathematical Physics 41
Replace Arthur L. Liestman with:
Arthur L. Liestman Canada
Satish S. Rao United States
Sandra M. Hedetniemi United States
Amos Israeli Israel
Jittat Fakcharoenphol Thailand
Jukka Suomela Finland
John Michael Robson France
Sergio Rajsbaum Mexico
Bogdan S. Chlebus Poland
Linda Pagli Italy
Ralf Klasing relative to Arthur L. Liestman Canada Arthur L. Liestman's profile →
Citations per field
00.5×5×10×13.2×
Arthur L. Liestman · 1×
Citations per year

Countries citing papers authored by Ralf Klasing

Since Specialization
Citations

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

Fields of papers citing papers by Ralf Klasing

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Ralf Klasing, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ralf Klasing Line = papers co-authored together Ralf Klasing links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 149 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2007146
2 1996109
3 201081
4 200576
5 200358
6
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
200556
7 201449
8 200046
9 200644
10 200642
11 200741
12 200941
13 200438
14
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
200537
15 200436
16 200034
17 200534
18 201433
19 200832
20 200832

About Ralf Klasing

Ralf Klasing is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology, Statistical and Nonlinear Physics and Hardware and Architecture, having authored 149 papers that have together received 2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (78 papers), Optimization and Search Problems (44 papers), Interconnection Networks and Systems (30 papers), Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (13 papers), Mobile Ad Hoc Networks (5 papers), Graph theory and applications (5 papers) and Complex Network Analysis Techniques (4 papers). The work is most often cited by research in Computational Theory and Mathematics (913 citations), Computer Networks and Communications (1.2k citations), Statistical and Nonlinear Physics (75 citations), Discrete Mathematics and Combinatorics (19 citations) and Mathematical Physics (41 citations). Ralf Klasing has collaborated with scholars based in France, Germany and United Kingdom. Frequent co-authors include Juraj Hromkovic̆, Alfredo Navarra B, Andrzej Pelc, Adrian Kosowski, Ευριπίδης Μάρκου, Tomasz Radzik, Stéphane Pérennès, Burkhard Monien, Colin Cooper and Christian Laforest. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences, Discrete Applied Mathematics, Lecture notes in computer science and Networks.

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