Bert Randerath
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 37
- Graph Labeling and Dimension Problems 22
- Complexity and Algorithms in Graphs 11
- Formal Methods in Verification 3
-
- Limits and Structures in Graph Theory 14
- Co-authors
- Ingo Schiermeyer (17 shared papers)Lutz Volkmann (7 shared papers)Van Bang Lê (3 shared papers)Ewald Speckenmeyer (5 shared papers)Preben Dahl Vestergaard (5 shared papers)T. Nießen (1 shared paper)Vadim Lozin (1 shared paper)Martin Kochol (1 shared paper)
- Journals
- Discrete Mathematics (7 papers)Discrete Applied Mathematics (6 papers)Theoretical Computer Science (2 papers)Graphs and Combinatorics (2 papers)Journal of Graph Theory (1 paper)
- Partner nations
- GermanyDenmarkUnited States
In The Last Decade
Bert Randerath
39 papers receiving 571 citations
Peers
Comparison fields: 5 of 33
- Discrete Mathematics and Combinatorics 296
- Computational Theory and Mathematics 567
- Geometry and Topology 86
- Computer Graphics and Computer-Aided Design 25
- Computer Networks and Communications 91
Countries citing papers authored by Bert Randerath
This map shows the geographic impact of Bert Randerath'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 Bert Randerath with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bert Randerath more than expected).
Fields of papers citing papers by Bert Randerath
This network shows the impact of papers produced by Bert Randerath. 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 Bert Randerath. The network helps show where Bert Randerath may publish in the future.
Co-authors
The 21 scholars most cited alongside Bert Randerath, 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 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 109 | |
| 2 | 2003 | 68 | |
| 3 | 2019 | 44 | |
| 4 | 2002 | 41 | |
| 5 | 2007 | 27 | |
| 6 | 2003 | 26 | |
| 7 | 2002 | 24 | |
| 8 | 2018 | 23 | |
| 9 | 1998 | 21 | |
| 10 | 2003 | 20 | |
| 11 | 2003 | 20 | |
| 12 | 1998 | 17 | |
| 13 | 2001 | 16 | |
| 14 | A note on Brooks' theorem for triangle-free graphs | 2002 | 14 |
| 15 | 2010 | 12 | |
| 16 | 1999 | 11 | |
| 17 | 2004 | 10 | |
| 18 | A characterization of well covered block-cactus graphs. | 1994 | 9 |
| 19 | On a conjecture about inverse domination in graphs | 2010 | 9 |
| 20 | 2006 | 7 |
About Bert Randerath
Bert Randerath is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Computer Networks and Communications and Geometry and Topology, having authored 39 papers that have together received 596 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (22 papers), Limits and Structures in Graph Theory (14 papers), Complexity and Algorithms in Graphs (11 papers), graph theory and CDMA systems (8 papers), Graph theory and applications (4 papers), Constraint Satisfaction and Optimization (4 papers) and Formal Methods in Verification (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (296 citations), Computational Theory and Mathematics (567 citations), Geometry and Topology (86 citations), Computer Graphics and Computer-Aided Design (25 citations) and Computer Networks and Communications (91 citations). Bert Randerath has collaborated with scholars based in Germany, Denmark and United States. Frequent co-authors include Ingo Schiermeyer, Lutz Volkmann, Van Bang Lê, Ewald Speckenmeyer, Preben Dahl Vestergaard, T. Nießen, Vadim Lozin, Martin Kochol, Hong Wang and Michael A. Henning. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Theoretical Computer Science, Graphs and Combinatorics and Journal of Graph Theory.
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.