Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
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).
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
1.
Cook, William J., David Applegate, Robert E. Bixby, & Vašek Chvátal. (2011). The Traveling Salesman Problem. Princeton University Press eBooks.208 indexed citations
Applegate, David, Robert E. Bixby, Vašek Chvátal, & William J. Cook. (2007). The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press eBooks.284 indexed citations
Chvátal, Vašek & Bruce A. Reed. (1992). Mick Gets Some (the Odds Are on His Side). OpenGrey (Institut de l'Information Scientifique et Technique). 620–627.126 indexed citations
Chvátal, Vašek. (1985). Cutting Planes in Combinatorics. European Journal of Combinatorics. 6(3). 217–226.11 indexed citations
10.
Chvátal, Vašek. (1985). Star-cutsets and perfect graphs. Journal of Combinatorial Theory Series B. 39(3). 189–199.136 indexed citations
11.
Chvátal, Vašek. (1983). On the bicycle problem. Discrete Applied Mathematics. 5(2). 165–173.3 indexed citations
12.
Chvátal, Vašek & Endre Szemerédi. (1983). Short cycles in directed graphs. Journal of Combinatorial Theory Series B. 35(3). 323–327.26 indexed citations
13.
Chvátal, Vašek & Carsten Thomassen. (1978). Distances in orientations of graphs. Journal of Combinatorial Theory Series B. 24(1). 61–75.77 indexed citations
14.
Chvátal, Vašek & D. L. Hanson. (1976). Degrees and matchings. Journal of Combinatorial Theory Series B. 20(2). 128–138.35 indexed citations
Chvátal, Vašek. (1975). On certain polytopes associated with graphs. Journal of Combinatorial Theory Series B. 18(2). 138–154.336 indexed citations breakdown →
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.