Jaroslav Nešetřil
About
In The Last Decade
Jaroslav Nešetřil
236 papers receiving 3.7k citations
Peers
Comparison fields: 5 of 126
- Computational Theory and Mathematics 3.2k
- Discrete Mathematics and Combinatorics 1.8k
- Geometry and Topology 1.4k
- Computer Networks and Communications 625
- Artificial Intelligence 435
Countries citing papers authored by Jaroslav Nešetřil
This map shows the geographic impact of Jaroslav Nešetřil'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 Jaroslav Nešetřil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jaroslav Nešetřil more than expected).
Fields of papers citing papers by Jaroslav Nešetřil
This network shows the impact of papers produced by Jaroslav Nešetřil. 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 Jaroslav Nešetřil. The network helps show where Jaroslav Nešetřil may publish in the future.
Co-authorship network of co-authors of Jaroslav Nešetřil
This figure shows the co-authorship network connecting the top 25 collaborators of Jaroslav Nešetřil. A scholar is included among the top collaborators of Jaroslav Nešetřil 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 Jaroslav Nešetřil. Jaroslav Nešetřil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 0 | |
| 4 | 18 | |
| 5 | Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday | 1 |
| 6 | A model theory approach to structural limits | 4 |
| 7 | Physics and Theoretical Computer Science: From Numbers and Languages to (Quantum) Cryptography | 6 |
| 8 | Topics in discrete mathematics : dedicated to Jarik Nešetřil on the occasion of his 60th birthday | 3 |
| 9 | More about subcolorings | 0 |
| 10 | 1 | |
| 11 | $T$-preserving homomorphisms of oriented graphs | 4 |
| 12 | A few remarks on the history of MST-problem | 11 |
| 13 | Combinatorics and quantifiers | 4 |
| 14 | 4 | |
| 15 | On polynomial time decidability of induced-minor-closed classes | 12 |
| 16 | Partite construction and Ramseyan theorems for sets, numbers and spaces | 2 |
| 17 | On the complexity of the subgraph problem | 98 |
| 18 | On Ramsey graphs without cycles of short odd lengths | 8 |
| 19 | Complete and pseudocomplete colourings of a graph | 3 |
| 20 | Either tournaments or algebras? (Preliminary communication) | 1 |
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.