Václav Chvátal | Academic Influence

Václav Chvátal's AcademicInfluence.com Rankings

Václav Chvátal

Mathematics

#577

World Rank

#1092

Historical Rank

Graph Theory

#11

World Rank

#16

Historical Rank

Combinatorics

#19

World Rank

#23

Historical Rank

Measure Theory

#454

World Rank

#649

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Václav Chvátal's Degrees

PhD Mathematics Charles University

Why Is Václav Chvátal Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Václav Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

(See a Problem?)

Václav Chvátal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Greedy Heuristic for the Set-Covering Problem (1979) (2624)
Solution of a Large-Scale Traveling-Salesman Problem (1954) (1838)
The Traveling Salesman Problem: A Computational Study (2007) (1760)
Edmonds polytopes and a hierarchy of combinatorial problems (1973) (639)
A combinatorial theorem in plane geometry (1975) (628)
A note on Hamiltonian circuits (1972) (614)
On certain polytopes associated with graphs (1975) (602)
Tough graphs and hamiltonian circuits (1973) (579)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) (2007) (522)
Many hard examples for resolution (1988) (519)
Aggregation of inequalities in integer programming. (1975) (458)
A method in graph theory (1976) (414)
Mick gets some (the odds are on his side) (satisfiability) (1992) (373)
Crossing-Free Subgraphs (1982) (336)
On Hamilton's ideals (1972) (299)
Longest common subsequences of two random sequences (1975) (253)
The tail of the hypergeometric distribution (1979) (238)
Star-cutsets and perfect graphs (1985) (208)
Finding Cuts in the TSP (A preliminary report) (1995) (189)
Perfectly Ordered Graphs (1984) (177)
Topics on perfect graphs (1984) (176)
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (2003) (172)
Tree-complete graph ramsey numbers (1977) (170)
Generalized Ramsey theory for graphs (1972) (170)
Generalized Ramsey theory for graphs. III. Small off-diagonal numbers. (1972) (164)
Biased Positional Games (1978) (161)
Edmonds polytopes and weakly hamiltonian graphs (1973) (160)
Certification of an optimal TSP tour through 85, 900 cities (2009) (150)
Mastermind (1983) (148)
TSP Cuts Which Do Not Conform to the Template Paradigm (2000) (137)
On cutting-plane proofs in combinatorial optimization (1989) (126)
Four classes of perfectly orderable graphs (1987) (126)
Distances in orientations of graphs (1975) (116)
Small transversals in hypergraphs (1992) (115)
Notes on Bland’s pivoting rule (1978) (113)
Selected combinatorial research problems. (1972) (103)
Generalized Ramsey theory for graphs. II. Small diagonal numbers (1972) (102)
Bull-free Berge graphs are perfect (1987) (99)
Hard Knapsack Problems (1980) (94)
Recognizing claw-free perfect graphs (1987) (91)
A Note on Well-Covered Graphs (1993) (91)
Finding Tours in the TSP (1999) (86)
Recognizing decomposable graphs (1984) (73)
Almost All Graphs with 1.44n Edges are 3-Colorable (1991) (64)
Flip-Flops in Hypohamiltonian Graphs (1973) (62)
The minimality of the mycielski graph (1974) (60)
Every directed graph has a semi-kernel (1974) (57)
Determining the Stability Number of a Graph (1976) (56)
Degrees and matchings (1976) (55)
Intersecting families of edges in hypergraphs having the hereditary property (1974) (53)
Problems related to a de Bruijn-Erdös theorem (2006) (50)
On the Maximum Weight Clique Problem (1987) (48)
Sylvester–Gallai Theorem and Metric Betweenness (2004) (47)
A Semi-Strong Perfect Graph Conjecture (1984) (45)
An Extremal Set‐Intersection Theorem (1974) (44)
Combinatorial designs related to the strong perfect graph conjecture (1979) (41)
Combinatorial properties of polyominoes (1981) (41)
On the strong perfect graph conjecture (1976) (39)
Balancing signed graphs (1981) (38)
On the ErdÖS-Stone Theorem (1981) (36)
The smallest triangle-free 4-chromatic 4-regular graph (1970) (35)
Lecture Notes on the New AKS Sorting Network (1992) (35)
Combinatorial Designs Related to the Perfect Graph Conjecture (1984) (33)
A remark on a problem of Harary (1970) (32)
Generalized ramsey theory for graphs, I. Diagonal numbers (1973) (31)
Resolution Search (1995) (29)
A de Bruijn-Erdős theorem for 1–2 metric spaces (2012) (28)
A de Bruijn - Erdős theorem and metric spaces (2009) (26)
A De Bruijn-Erdős Theorem for Chordal Graphs (2012) (23)
Monochromatic paths in edge-colored graphs (1972) (23)
Antimatroids, Betweenness, Convexity (2008) (21)
Probabilistic methods in graph theory (1984) (20)
On the P4-structure of perfect graphs I. Even decompositions (1985) (20)
Hypergraphs and Ramseyian theorems (1971) (20)
Local cuts for mixed-integer programming (2013) (19)
Cook. The Traveling Salesman Problem: A Computational Study. (18)
Lines in hypergraphs (2011) (18)
Two-colourings that decompose perfect graphs (1990) (17)
Every finite graph is a full subgraph of a rigid graph (1971) (16)
Cutting Planes in Combinatorics (1985) (16)
A note on coefficients of chromatic polynomials (1970) (16)
Which Claw-Free Graphs are Perfectly Orderable? (1993) (16)
A note on line digraphs and the directed max-cut problem (1990) (15)
Recognizing dart-free perfect graphs (2000) (15)
Three-regular subgraphs of four-regular graphs (1979) (15)
On the P4-structure of perfect graphs III. Partner decompositions (1986) (15)
Short cycles in directed graphs (1983) (15)
Number of lines in hypergraphs (2013) (14)
Dirac-type characterizations of graphs without long chordless cycles (2002) (14)
Transversals in Trees (2007) (13)
Finite Sholander trees, trees, and their betweenness (2011) (12)
On finite and countable rigid graphs and tournaments (1965) (12)
An Equivalent Version of the Strong Perfect Graph Conjecture (1984) (11)
A De Bruijn-Erdős Theorem in Graphs? (2018) (9)
Ramsey's theorem and self-complementary graphs (1972) (9)
Chromatic automorphisms of graphs (1973) (9)
Packing paths perfectly (1990) (8)
The discipline number of a graph (1991) (8)
Notes on the erdös-stone theorem (1983) (7)
On finite δ-systems of Erdős and Rado (1970) (7)
On the ramsey number of the five-spoked wheel (1974) (7)
Notes on Perfect Graphs (1984) (6)
Variations on a theorem of Ryser (1997) (6)
D. Ray Fulkerson's Contributions to Operations Research (1976) (5)
A note on the traveling salesman problem (1989) (5)
On a conjecture of Fejes Tóth (1975) (5)
Planar tilings and the search for an aperiodic prototile (2003) (4)
Another Abstraction of the Erdös-Szekeres Happy End Theorem (2010) (4)
On Reichenbach’s Causal Betweenness (2009) (4)
Implementations of the dpll algorithm (1999) (3)
There are 2ℵα Friendship Graphs of Cardinal ℵα (1976) (3)
Some Linear Programming Aspects of Combinatorics. (1975) (3)
Correction to: A De Bruijn-Erdős Theorem in Graphs? (2018) (3)
Cheap, Middling or Dear (1981) (2)
AKS Sorting Network (2011) (2)
Cutting planes and the traveling salesman problem (abstract only) (2000) (2)
On the bicycle problem (1983) (2)
There are $2sp{aleph sb{alpha }}$ friendship graphs of cardinal $aleph sb{alpha }$ (1976) (2)
A de Bruijn - Erd\H{o}s theorem and metric spaces (2009) (2)
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs (2009) (2)
The Discrete Mathematical Charms of Paul Erdős (2021) (1)
In praise of Claude Berge (1997) (1)
Židovské památky Tachovska, Plánska a Stříbrska : Jüdische Denkmäler im Tachauer, Planer und Mieser Land (2008) (1)
Which claw-free graphs are strongly perfect graphs? (1996) (1)
Two new classes of perfect graphs (1990) (1)
Edmonds Polyhedra and Weakly Hamiltonian Graphs. (1972) (1)
McCulloch-Pitts Brains and Pseudorandom Functions (2016) (1)
Computational geometry and graph theory : the Akiyama-Chvátal Festschrift (2007) (0)
Extremal Graph Theory (2021) (0)
Problems in discrete geometry (2006) (0)
On an Extremal Problem Concerning Intervals (1982) (0)
How To Be Fickle (2007) (0)
Local cuts for mixed-integer programming (2013) (0)
Lines in hypergraphs (2013) (0)
More on Erdős (2021) (0)
EXPECTED PERFORMANCE OF BRANCHING RULES (2006) (0)
Some Linear Programming Aspects of Combinator Ks Some Linear Programming Aspects of Combinatorics Some Linear Programming Aspects of Combinatorics (1975) (0)
3 Sylvester-Gallai theorem in metric spaces ? (0)
On Reichenbach’s Causal Betweenness (2011) (0)
Elementary Problems: E2298,E2307-E2312 (1971) (0)
Combinatorial algorithms in concorde (2008) (0)
Remembering Leo Khachiyan (2008) (0)
Assessment 978-1108-83183-3 — The Discrete Mathematical Charms of Paul Erdos (0)
ON THE NEW AKS SORTING NETWORK (1992) (0)
A de Bruijn-Erdős theorem for 1–2 metric spaces (2014) (0)
Thresholds of Graph Properties (2021) (0)
Discrete Geometry and Spinoffs (2021) (0)
A Few Tricks of the Trade (2021) (0)
Definitions, Terminology, Notation (2021) (0)

This paper list is powered by the following services:

Other Resources About Václav Chvátal

en.wikipedia.org

What Schools Are Affiliated With Václav Chvátal?

Václav Chvátal is affiliated with the following schools:

Image Attributions

Image Source for Václav Chvátal