Vasek Chvátal

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 3

Top Topics

Nearest Neighbor Queries

Graph Construction

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Publications

Vasek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó
Metric spaces in which many triangles are degenerate. Discret. Appl. Math. 350 (2024)
Vasek Chvátal, Mark Goldsmith, Nan Yang
McCulloch-Pitts brains and pseudorandom functions. CoRR (2016)
Vasek Chvátal, Mark Goldsmith, Nan Yang
McCulloch-Pitts Brains and Pseudorandom Functions. Neural Comput. 28 (6) (2016)
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22 (1) (2015)
Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao
Number of lines in hypergraphs. Discret. Appl. Math. 171 (2014)
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
Lines in hypergraphs. Comb. 33 (6) (2013)
Victor Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian
Transversals in Trees. J. Graph Theory 73 (1) (2013)
Vasek Chvátal, William J. Cook, Daniel G. Espinoza
Local cuts for mixed-integer programming. Math. Program. Comput. 5 (2) (2013)
Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
Finite Sholander trees, trees, and their betweenness. Discret. Math. 311 (20) (2011)
Ehsan Chiniforooshan, Vasek Chvátal
A de Bruijn - Erdős theorem and metric spaces. Discret. Math. Theor. Comput. Sci. 13 (1) (2011)
Vasek Chvátal
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs Comb. 27 (2) (2011)
Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest
Another Abstraction of the Erdös-Szekeres Happy End Theorem. Electron. J. Comb. 17 (1) (2010)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37 (1) (2009)
Vasek Chvátal
Remembering Leo Khachiyan. Discret. Appl. Math. 156 (11) (2008)
Vasek Chvátal
Antimatroids, Betweenness, Convexity. Bonn Workshop of Combinatorial Optimization (2008)
Xiaomin Chen, Vasek Chvátal
Problems related to a de Bruijn-Erdös theorem. Discret. Appl. Math. 156 (11) (2008)
Vasek Chvátal
Combinatorial algorithms in concorde. IWOCA (2008)
Vasek Chvátal
How To Be Fickle. MFCS (2007)
Vasek Chvátal
Tough graphs and hamiltonian circuits. Discret. Math. 306 (10-11) (2006)
J. Adrian Bondy, Vasek Chvátal
Preface. Discret. Math. 306 (19-20) (2006)
Vasek Chvátal
Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 306 (10-11) (2006)
Vasek Chvátal
Sylvester-Gallai Theorem and Metric Betweenness. Discret. Comput. Geom. 31 (2) (2004)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97 (1-2) (2003)
Vasek Chvátal
Claude Berge: 5.6.1926-30.6.2002. Graphs Comb. 19 (1) (2003)
Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
Recognizing Dart-Free Perfect Graphs. SIAM J. Comput. 31 (5) (2002)
Vasek Chvátal, Irena Rusu, R. Sritharan
Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. 256 (1-2) (2002)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization (2001)
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Cutting planes and the traveling salesman problem (abstract only). SODA (2000)
Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
Recognizing dart-free perfect graphs. SODA (2000)
Vasek Chvátal
Resolution Search. Discret. Appl. Math. 73 (1) (1997)
Vasek Chvátal
In praise of Claude Berge. Discret. Math. (1997)
Vasek Chvátal
Which Claw-Free Graphs are Perfectly Orderable? Discret. Appl. Math. 44 (1-3) (1993)
Vasek Chvátal, Bruce A. Reed
Mick Gets Some (the Odds Are on His Side) FOCS (1992)
Vasek Chvátal, Colin McDiarmid
Small transversals in hypergraphs. Comb. 12 (1) (1992)
Vasek Chvátal
Almost All Graphs with 1.44n Edges are 3-Colorable. Random Struct. Algorithms 2 (1) (1991)
Vasek Chvátal, William J. Lenhart, Najiba Sbihi
Two-colourings that decompose perfect graphs. J. Comb. Theory, Ser. B 49 (1) (1990)
Vasek Chvátal, C. Ebenegger
A note on line digraphs and the directed max-cut problem. Discret. Appl. Math. 29 (2-3) (1990)
Vasek Chvátal
Which line-graphs are perfectly orderable? J. Graph Theory 14 (5) (1990)
Vasek Chvátal, William J. Cook
The discipline number of a graph. Discret. Math. 86 (1-3) (1990)
Jin Akiyama, Vasek Chvátal
Packing paths perfectly. Discret. Math. 85 (3) (1990)
Vasek Chvátal, Endre Szemerédi
Many Hard Examples for Resolution. J. ACM 35 (4) (1988)
Vasek Chvátal, Najiba Sbihi
Recognizing claw-free perfect graphs. J. Comb. Theory, Ser. B 44 (2) (1988)
Egon Balas, Vasek Chvátal, Jaroslav Nesetril
On the Maximum Weight Clique Problem. Math. Oper. Res. 12 (3) (1987)
Vasek Chvátal
-structure of perfect graphs III. Partner decompositions. J. Comb. Theory, Ser. B 43 (3) (1987)
Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra
Four classes of perfectly orderable graphs. J. Graph Theory 11 (4) (1987)
Vasek Chvátal, Najiba Sbihi
Bull-free Berge graphs are perfect. Graphs Comb. 3 (1) (1987)
Vasek Chvátal
Cutting Planes in Combinatorics. Eur. J. Comb. 6 (3) (1985)
Vasek Chvátal, Chính T. Hoàng
-structure of perfect graphs I. Even decompositions. J. Comb. Theory, Ser. B 39 (3) (1985)
Vasek Chvátal
Star-cutsets and perfect graphs. J. Comb. Theory, Ser. B 39 (3) (1985)
Vasek Chvátal
Probabilistic methods in graph theory. Ann. Oper. Res. 1 (3) (1984)
Vasek Chvátal
Recognizing decomposable graphs. J. Graph Theory 8 (1) (1984)
Vasek Chvátal
Mastermind. Comb. 3 (3) (1983)
Vasek Chvátal
On the bicycle problem. Discret. Appl. Math. 5 (2) (1983)
Vasek Chvátal, Endre Szemerédi
Short cycles in directed graphs. J. Comb. Theory, Ser. B 35 (3) (1983)
Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era
Balancing signed graphs. Discret. Appl. Math. 3 (4) (1981)
Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow
Combinatorial properties of polyominoes. Comb. 1 (3) (1981)
Vasek Chvátal
Hard Knapsack Problems. Oper. Res. 28 (6) (1980)
Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen
Three-regular subgraphs of four-regular graphs. J. Graph Theory 3 (4) (1979)
Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides
Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. 26 (2) (1979)
Vasek Chvátal
A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. 4 (3) (1979)
Vasek Chvátal
The tail of the hypergeometric distribution. Discret. Math. 25 (3) (1979)
Vasek Chvátal, Carsten Thomassen
Distances in orientations of graphs. J. Comb. Theory, Ser. B 24 (1) (1978)
Vasek Chvátal
Determining the Stability Number of a Graph. SIAM J. Comput. 6 (4) (1977)
Vasek Chvátal
Tree-complete graph ramsey numbers. J. Graph Theory 1 (1) (1977)
Vasek Chvátal
D. Ray Fulkerson's Contributions to Operations Research. Math. Oper. Res. 1 (4) (1976)
J. Adrian Bondy, Vasek Chvátal
A method in graph theory. Discret. Math. 15 (2) (1976)
Vasek Chvátal
Tough graphs and hamiltonian circuits. Discret. Math. 5 (3) (1973)
Vasek Chvátal
Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4 (4) (1973)
Vasek Chvátal, Paul Erdös, Z. Hedrlín
Ramsey's theorem and self-complementary graphs. Discret. Math. 3 (4) (1972)
Vasek Chvátal, Paul Erdös
A note on Hamiltonian circuits. Discret. Math. 2 (2) (1972)