Vašek Chvátal
About
In The Last Decade
Vašek Chvátal
93 papers receiving 6.2k citations
Hit Papers
Peers
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
Countries citing papers authored by Vašek Chvátal
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
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
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | The Traveling Salesman Problem | Princeton University Press eBooks | William J. Cook, David Applegate et al. | 208 |
| 2 | Finite Sholander trees, trees, and their betweenness | Discrete Mathematics | Vašek Chvátal, Dieter Rautenbach et al. | 6 |
| 3 | The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) | Princeton University Press eBooks | David Applegate, Robert E. Bixby et al. | 284 |
| 4 | Problems related to a de Bruijn–Erdös theorem | Discrete Applied Mathematics | Xiaohong Chen, Vašek Chvátal | 21 |
| 5 | Cutting planes and the traveling salesman problem (abstract only) | Symposium on Discrete Algorithms | David Applegate, Robert E. Bixby et al. | 1 |
| 6 | Mick Gets Some (the Odds Are on His Side) | OpenGrey (Institut de l'Information Scientifique et Technique) | Vašek Chvátal, Bruce A. Reed | 126 |
| 7 | Packing paths perfectly | Discrete Mathematics | Jin Akiyama, Vašek Chvátal | 4 |
| 8 | On cutting-plane proofs in combinatorial optimization | Linear Algebra and its Applications | Vašek Chvátal, William J. Cook et al. | 52 |
| 9 | Cutting Planes in Combinatorics | European Journal of Combinatorics | Vašek Chvátal | 11 |
| 10 | Star-cutsets and perfect graphs | Journal of Combinatorial Theory Series B | Vašek Chvátal | 136 |
| 11 | On the bicycle problem | Discrete Applied Mathematics | Vašek Chvátal | 3 |
| 12 | Short cycles in directed graphs | Journal of Combinatorial Theory Series B | Vašek Chvátal, Endre Szemerédi | 26 |
| 13 | Distances in orientations of graphs | Journal of Combinatorial Theory Series B | Vašek Chvátal, Carsten Thomassen | 77 |
| 14 | Degrees and matchings | Journal of Combinatorial Theory Series B | Vašek Chvátal, D. L. Hanson | 35 |
| 15 | A combinatorial theorem in plane geometry | Journal of Combinatorial Theory Series B | Vašek Chvátal | 335 |
| 16 | On certain polytopes associated with graphs breakdown → | Journal of Combinatorial Theory Series B | Vašek Chvátal | 336 |
| 17 | Edmonds polytopes and a hierarchy of combinatorial problems | Discrete Mathematics | Vašek Chvátal | 299 |
| 18 | Tough graphs and hamiltonian circuits breakdown → | Discrete Mathematics | Vašek Chvátal | 388 |
| 19 | Monochromatic paths in edge-colored graphs | Journal of Combinatorial Theory Series B | Vašek Chvátal | 13 |
| 20 | A note on coefficients of chromatic polynomials | Journal of Combinatorial Theory | Vašek Chvátal | 7 |
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.