Daniel Král͏̌
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 103
-
- Advanced Graph Theory Research 155
- Graph Labeling and Dimension Problems 66
- Complexity and Algorithms in Graphs 22
- Co-authors
- Zdenĕk Dvořák (35 shared papers)Riste Škrekovski (15 shared papers)Robin B. Thomas (16 shared papers)Jan Kratochvı́l (6 shared papers)Serguei Norine (8 shared papers)Jan Hladký (5 shared papers)Zsolt Tuza (1 shared paper)Gerhard J. Woeginger (2 shared papers)
- Journals
- European Journal of Combinatorics (20 papers)SIAM Journal on Discrete Mathematics (19 papers)Journal of Combinatorial Theory Series B (17 papers)Journal of Graph Theory (11 papers)Discrete Mathematics (8 papers)
- Partner nations
- CzechiaUnited KingdomUnited States
In The Last Decade
Daniel Král͏̌
182 papers receiving 1.8k citations
Peers
Comparison fields: 5 of 67
- Discrete Mathematics and Combinatorics 920
- Computational Theory and Mathematics 1.7k
- Geometry and Topology 434
- Computer Graphics and Computer-Aided Design 143
- Electrical and Electronic Engineering 495
Countries citing papers authored by Daniel Král͏̌
This map shows the geographic impact of Daniel Král͏̌'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 Daniel Král͏̌ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Král͏̌ more than expected).
Fields of papers citing papers by Daniel Král͏̌
This network shows the impact of papers produced by Daniel Král͏̌. 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 Daniel Král͏̌. The network helps show where Daniel Král͏̌ may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel Král͏̌, 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 195 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 135 | |
| 2 | 2003 | 93 | |
| 3 | 2013 | 82 | |
| 4 | 2013 | 63 | |
| 5 | 2008 | 59 | |
| 6 | 2010 | 56 | |
| 7 | 2009 | 45 | |
| 8 | 2011 | 37 | |
| 9 | 2004 | 36 | |
| 10 | 2008 | 35 | |
| 11 | 2011 | 33 | |
| 12 | 2012 | 33 | |
| 13 | 2009 | 29 | |
| 14 | 2004 | 29 | |
| 15 | 2013 | 29 | |
| 16 | 2014 | 26 | |
| 17 | A new lower bound based on Gromov’s method of selecting heavily covered points | 2011 | 26 |
| 18 | 2015 | 25 | |
| 19 | 2004 | 25 | |
| 20 | 2013 | 24 |
About Daniel Král͏̌
Daniel Král͏̌ is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering, having authored 195 papers that have together received 2.0k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (155 papers), Limits and Structures in Graph Theory (103 papers), Graph Labeling and Dimension Problems (66 papers), graph theory and CDMA systems (63 papers), Graph theory and applications (27 papers), Computational Geometry and Mesh Generation (23 papers), Complexity and Algorithms in Graphs (22 papers) and Advanced Topology and Set Theory (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (920 citations), Computational Theory and Mathematics (1.7k citations), Geometry and Topology (434 citations), Computer Graphics and Computer-Aided Design (143 citations) and Electrical and Electronic Engineering (495 citations). Daniel Král͏̌ has collaborated with scholars based in Czechia, United Kingdom and United States. Frequent co-authors include Zdenĕk Dvořák, Riste Škrekovski, Robin B. Thomas, Jan Kratochvı́l, Serguei Norine, Jan Hladký, Zsolt Tuza, Gerhard J. Woeginger, Oriol Serra and Jean‐Sébastien Sereni. Their work appears in journals such as European Journal of Combinatorics, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Graph Theory 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.