V. Rödl
-
- Limits and Structures in Graph Theory 66
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research 54
- Graph Labeling and Dimension Problems 16
- Complexity and Algorithms in Graphs 13
- Geometry and Topology top 0.5%
- Advanced Topology and Set Theory 28
- Graph theory and applications 14
-
- graph theory and CDMA systems 17
-
- Mathematical Dynamics and Fractals 5
- Co-authors
- Péter FranklRichard A. DukeYoshiharu KohayakawaHanno LefmannNoga AlonPéter L. ErdősEndre SzemerédiPavel Pudlák
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Journal of Combinatorial Theory Series B (10 papers)Journal of Combinatorial Theory Series A (9 papers)Combinatorics Probability Computing (8 papers)
- Partner nations
- United StatesCzechiaCanada
In The Last Decade
V. Rödl
83 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 45
- Discrete Mathematics and Combinatorics 1.4k
- Computational Theory and Mathematics 1.5k
- Geometry and Topology 737
- Computer Graphics and Computer-Aided Design 61
- Computational Mathematics 7
Countries citing papers authored by V. Rödl
This map shows the geographic impact of V. Rödl'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 V. Rödl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. Rödl more than expected).
Fields of papers citing papers by V. Rödl
This network shows the impact of papers produced by V. Rödl. 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 V. Rödl. The network helps show where V. Rödl may publish in the future.
Co-authorship network
The 25 scholars most cited alongside V. Rödl, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 1 | |
| 2 | 2006 | 6 | |
| 3 | 2006 | 13 | |
| 4 | 2005 | 30 | |
| 5 | 2002 | 2 | |
| 6 | 1996 | 15 | |
| 7 | 1995 | 30 | |
| 8 | 1993 | 20 | |
| 9 | 1992 | 6 | |
| 10 | 1992 | 9 | |
| 11 | 1990 | 42 | |
| 12 | 1990 | 20 | |
| 13 | 1989 | 21 | |
| 14 | Graph complexity | 1988 | 27 |
| 15 | The number of sub-matrics of a given type in a Hadamard matrix and related results | 1987 | 9 |
| 16 | 1987 | 41 | |
| 17 | 1987 | 1 | |
| 18 | 1987 | 25 | |
| 19 | 1985 | 103 | |
| 20 | 1983 | 87 |
About V. Rödl
V. Rödl is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Mathematical Physics, having authored 89 papers that have together received 1.9k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (66 papers), Advanced Graph Theory Research (54 papers), Advanced Topology and Set Theory (28 papers), graph theory and CDMA systems (17 papers), Graph Labeling and Dimension Problems (16 papers), Graph theory and applications (14 papers), Complexity and Algorithms in Graphs (13 papers) and Mathematical Dynamics and Fractals (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.4k citations), Computational Theory and Mathematics (1.5k citations), Geometry and Topology (737 citations), Computer Graphics and Computer-Aided Design (61 citations) and Computational Mathematics (7 citations). V. Rödl has collaborated with scholars based in United States, Czechia and Canada. Frequent co-authors include Péter Frankl, Richard A. Duke, Yoshiharu Kohayakawa, Hanno Lefmann, Noga Alon, Péter L. Erdős, Endre Szemerédi, Pavel Pudlák, Raphael Yuster and Penny Haxell. Their work appears in journals such as Journal of Combinatorial Theory Series B, Journal of Combinatorial Theory Series A, Combinatorics Probability Computing, COMBINATORICA and Discrete Mathematics.
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.