Standout Papers

A Greedy Heuristic for the Set-Covering Problem 1972 2026 1990 2008 1.2k
  1. A Greedy Heuristic for the Set-Covering Problem (1979)
    Vašek Chvátal Mathematics of Operations Research
  2. A note on Hamiltonian circuits (1972)
    Vašek Chvátal, P. Erdös Discrete Mathematics
  3. Tough graphs and hamiltonian circuits (1973)
    Vašek Chvátal Discrete Mathematics

Immediate Impact

2 by Nobel laureates 33 from Science/Nature 77 standout
Sub-graph 1 of 24

Citing Papers

Tumour vasculature at single-cell resolution
2024 StandoutNature
Elucidating the cellular determinants of targeted membrane protein degradation by lysosome-targeting chimeras
2023 StandoutScienceNobel
2 intermediate papers

Works of Vašek Chvátal being referenced

A Greedy Heuristic for the Set-Covering Problem
1979 Standout

Author Peers

Author Last Decade Papers Cites
Vašek Chvátal 3451 1293 1085 1308 89 5.6k
Martin Grötschel 3691 726 496 1490 78 7.2k
Alan Frieze 2898 1597 990 1472 319 6.7k
Alexander Schrijver 5437 1107 889 2185 146 10.2k
Daniel J. Kleitman 1764 1133 694 503 162 3.9k
Paul Seymour 8441 2832 1629 2438 249 10.0k
Hans L. Bodlaender 3766 570 343 1418 205 4.5k
Gregory Gutin 1939 515 331 887 184 3.7k
S. L. Hakimi 1521 237 393 2000 112 6.5k
Jack Edmonds 1849 346 237 1042 33 3.8k
Joel Spencer 2767 2047 1126 831 141 5.7k

All Works

Loading papers...

Rankless by CCL
2026