Vašek Chvátal

14.3k citations
97 papers · 6.8k indexed · 4 hit papers · h-index 33
Topics
Advanced Graph Theory Research (54 papers)Graph Labeling and Dimension Problems (30 papers)Limits and Structures in Graph Theory (26 papers)

In The Last Decade

Vašek Chvátal

93 papers receiving 6.2k citations

Hit Papers

A Greedy Heuristic for the Set-Covering Problem1972202619902008197919731972197550010001.5k

Peers

Vašek Chvátal
Comparison fields: 5 of 142
  • Computational Theory and Mathematics 3.9k
  • Computer Networks and Communications 1.8k
  • Discrete Mathematics and Combinatorics 1.3k
  • Artificial Intelligence 1.2k
  • Geometry and Topology 1.1k
Replace Jack Edmonds with:
Jack Edmonds Canada
Alexander Schrijver Netherlands
Martin Grötschel Germany
Paul Seymour United States
D. R. Fulkerson United States
S. L. Hakimi United States
Ron Graham United States
Uriel Feige Israel
Gregory Gutin United Kingdom
Reinhard Diestel Germany
Vašek Chvátal relative to Jack Edmonds Canada Jack Edmonds's profile →
Citations per field
00.5×1.5×2.4×
Jack Edmonds · 1×
Citations per year

Countries citing papers authored by Vašek Chvátal

Since Specialization
Citations

This map shows the geographic impact of Vašek Chvátal'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 Vašek Chvátal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vašek Chvátal more than expected).

Fields of papers citing papers by Vašek Chvátal

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vašek Chvátal. 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 Vašek Chvátal. The network helps show where Vašek Chvátal may publish in the future.

Co-authorship network of co-authors of Vašek Chvátal

This figure shows the co-authorship network connecting the top 25 collaborators of Vašek Chvátal. A scholar is included among the top collaborators of Vašek Chvátal 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 Vašek Chvátal. Vašek Chvátal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 208
2 6
3
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
284
4 21
5 1
6
Mick Gets Some (the Odds Are on His Side)
126
7 4
8 52
9 11
10 136
11 3
12 26
13 77
14 35
15 335
16
On certain polytopes associated with graphsbreakdown →
336
17 299
18
Tough graphs and hamiltonian circuitsbreakdown →
388
19 13
20 7

About Vašek Chvátal

Vašek Chvátal is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 97 papers that have together received 6.8k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (54 papers), Graph Labeling and Dimension Problems (30 papers) and Limits and Structures in Graph Theory (26 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.3k citations), Computational Theory and Mathematics (3.9k citations) and Computer Graphics and Computer-Aided Design (661 citations). Vašek Chvátal has collaborated with scholars based in Canada, United States and France. Frequent co-authors include Robert E. Bixby, David Applegate, P. Erdös, William J. Cook, Endre Szemerédi, J. A. Bondy, Bruce A. Reed, Najiba Sbihi, Bruce Reed and Carsten Thomassen. Their work appears in journals such as Operations Research, Journal of the ACM and Neural Computation.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026