Science Explorer Back to mapMap
Discussion
Researcher · Charles University · Czechia

Jaroslav Nešetřil

Jaroslav Nešetřil publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, on topics such as Advanced Graph Theory Research, Limits and Structures in Graph Theory and Advanced Topology and Set Theory.

ORCID 0000-0002-5133-5586 OpenAlex
World rank
#995,131
of 7,710,434 ranked researchers
Rank in Czechia
#1,713
of 39,303
Works
551
Citations
9k
Citations per work
16.3
h-index
46
i10-index 152Top 1.3% in Computational Theory and Mathematics
Jaroslav Nešetřil

What does Jaroslav Nešetřil research?

Jaroslav Nešetřil's work is mostly in Computer Science (39%), Mathematics (39%), Engineering (2%).

Physical Sciences: 440 works · 79.9% of their workComputer Science: 214 works · 38.9% of their workComputational Theory and Mathematics: 204 works · 37.0% of their workComputer Networks and Communications: 10 works · 1.9% of their workMathematics: 214 works · 38.9% of their workDiscrete Mathematics and Combinatorics: 98 works · 17.8% of their workGeometry and Topology: 93 works · 16.9% of their workMathematical Physics: 23 works · 4.2% of their workEngineering: 12 works · 2.1% of their workElectrical and Electronic Engineering: 12 works · 2.1% of their workEverything else: 111 works · 20.1% of their workTHEIR WORKJaroslav Nešetřil551works
Physical Sciences80%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science21438.9%
    2. Mathematics21438.9%
    3. Engineering122.1%
  2. Everything else11120.1%
  1. 1Computational Theory and Mathematics37% of their works
  2. 2Discrete Mathematics and Combinatorics18% of their works
  3. 3Geometry and Topology17% of their works
  4. 4Mathematical Physics4% of their works
  5. 5Electrical and Electronic Engineering2% of their works
  6. 6Computer Networks and Communications2% of their works

Research topics

Which keywords describe Jaroslav Nešetřil's research?

The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Graph Limits, Szemerédi's Theorem, Model Theory and Topological Dynamics.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.

All 18 words, with their numbers
  1. Algorithmic Applications2952 topics
  2. Approximation Algorithms2952 topics
  3. Graph Theory2551 topic
  4. Parameterized Complexity2551 topic
  5. Graph Limits2071 topic
  6. Szemerédi's Theorem2071 topic
  7. Model Theory1441 topic
  8. Topological Dynamics1441 topic
  9. Graph Labeling751 topic
  10. Metric Dimension751 topic
  11. Graph Spectra631 topic
  12. Topological Indices631 topic
  13. Combinatorial Optimization401 topic
  14. Complexity Theory401 topic
  15. Algorithmic Information Theory371 topic
  16. Computability371 topic
  17. Persistent Homology301 topic
  18. Topological Methods301 topic

Where does Jaroslav Nešetřil work?

Jaroslav Nešetřil's main affiliation in the publication record is Charles University, Czechia.

How many publications and citations does Jaroslav Nešetřil have?

OpenAlex counts 551 works and 9,004 citations for Jaroslav Nešetřil, an h-index of 46, ranking #995,131 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about Jaroslav Nešetřil. Posts are plain text and can be reported.