Vasek Chvátal

According to our database, Vasek Chvátal authored at least 69 papers between 1972 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2024

Metric spaces in which many triangles are degenerate.

Vasek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó

Discret. Appl. Math., 2024

2016

McCulloch-Pitts Brains and Pseudorandom Functions.

Vasek Chvátal, Mark Goldsmith, Nan Yang

Neural Comput., 2016

2015

A De Bruijn-Erdős Theorem for Chordal Graphs.

Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols

Electron. J. Comb., 2015

2014

Number of lines in hypergraphs.

Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao

Discret. Appl. Math., 2014

2013

Local cuts for mixed-integer programming.

Vasek Chvátal, William J. Cook, Daniel G. Espinoza

Math. Program. Comput., 2013

Transversals in Trees.

Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian

J. Graph Theory, 2013

Lines in hypergraphs.

Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols

Comb., 2013

2011

Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs.

Vasek Chvátal

Graphs Comb., 2011

A de Bruijn - Erdős theorem and metric spaces.

Ehsan Chiniforooshan, Vasek Chvátal

Discret. Math. Theor. Comput. Sci., 2011

Finite Sholander trees, trees, and their betweenness.

Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer

Discret. Math., 2011

2010

Another Abstraction of the Erdös-Szekeres Happy End Theorem.

Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest

Electron. J. Comb., 2010

Solution of a Large-Scale Traveling-Salesman Problem.

Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Certification of an optimal TSP tour through 85, 900 cities.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun

Oper. Res. Lett., 2009

2008

Remembering Leo Khachiyan.

Vasek Chvátal

Discret. Appl. Math., 2008

Problems related to a de Bruijn-Erdös theorem.

Xiaomin Chen, Vasek Chvátal

Discret. Appl. Math., 2008

Combinatorial algorithms in concorde.

Vasek Chvátal

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Antimatroids, Betweenness, Convexity.

Vasek Chvátal

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

How To Be Fickle.

Vasek Chvátal

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Tough graphs and hamiltonian circuits.

Vasek Chvátal

Discret. Math., 2006

Edmonds polytopes and a hierarchy of combinatorial problems.

Vasek Chvátal

Discret. Math., 2006

Preface.

J. Adrian Bondy, Vasek Chvátal

Discret. Math., 2006

2004

Sylvester-Gallai Theorem and Metric Betweenness.

Vasek Chvátal

Discret. Comput. Geom., 2004

2003

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Math. Program., 2003

Claude Berge: 5.6.1926-30.6.2002.

Vasek Chvátal

Graphs Comb., 2003

2002

Recognizing Dart-Free Perfect Graphs.

Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline

SIAM J. Comput., 2002

Dirac-type characterizations of graphs without long chordless cycles.

Vasek Chvátal, Irena Rusu, R. Sritharan

Discret. Math., 2002

2001

TSP Cuts Which Do Not Conform to the Template Paradigm.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Proceedings of the Computational Combinatorial Optimization, 2001

2000

Cutting planes and the traveling salesman problem (abstract only).

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1997

In praise of Claude Berge.

Vasek Chvátal

Discret. Math., 1997

Resolution Search.

Vasek Chvátal

Discret. Appl. Math., 1997

1993

Which Claw-Free Graphs are Perfectly Orderable?

Vasek Chvátal

Discret. Appl. Math., 1993

1992

Small transversals in hypergraphs.

Vasek Chvátal, Colin McDiarmid

Comb., 1992

Mick Gets Some (the Odds Are on His Side)

Vasek Chvátal, Bruce A. Reed

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Almost All Graphs with 1.44n Edges are 3-Colorable.

Vasek Chvátal

Random Struct. Algorithms, 1991

1990

Which line-graphs are perfectly orderable?

Vasek Chvátal

J. Graph Theory, 1990

Two-colourings that decompose perfect graphs.

Vasek Chvátal, William J. Lenhart, Najiba Sbihi

J. Comb. Theory B, 1990

The discipline number of a graph.

Vasek Chvátal, William J. Cook

Discret. Math., 1990

Packing paths perfectly.

Jin Akiyama, Vasek Chvátal

Discret. Math., 1990

A note on line digraphs and the directed max-cut problem.

Vasek Chvátal, C. Ebenegger

Discret. Appl. Math., 1990

1988

Recognizing claw-free perfect graphs.

Vasek Chvátal, Najiba Sbihi

J. Comb. Theory B, 1988

Many Hard Examples for Resolution.

Vasek Chvátal, Endre Szemerédi

J. ACM, 1988

1987

On the Maximum Weight Clique Problem.

Egon Balas, Vasek Chvátal, Jaroslav Nesetril

Math. Oper. Res., 1987

Four classes of perfectly orderable graphs.

Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra

J. Graph Theory, 1987

On the <i>P</i>₄-structure of perfect graphs III. Partner decompositions.

Vasek Chvátal

J. Comb. Theory B, 1987

Bull-free Berge graphs are perfect.

Vasek Chvátal, Najiba Sbihi

Graphs Comb., 1987

1985

On the <i>P</i>₄-structure of perfect graphs I. Even decompositions.

Vasek Chvátal, Chính T. Hoàng

J. Comb. Theory B, 1985

Star-cutsets and perfect graphs.

Vasek Chvátal

J. Comb. Theory B, 1985

Cutting Planes in Combinatorics.

Vasek Chvátal

Eur. J. Comb., 1985

1984

Recognizing decomposable graphs.

Vasek Chvátal

J. Graph Theory, 1984

Probabilistic methods in graph theory.

Vasek Chvátal

Ann. Oper. Res., 1984

1983

Short cycles in directed graphs.

Vasek Chvátal, Endre Szemerédi

J. Comb. Theory B, 1983

On the bicycle problem.

Vasek Chvátal

Discret. Appl. Math., 1983

Mastermind.

Vasek Chvátal

Comb., 1983

1982

On an Extremal Problem Concerning Intervals.

Václav Chvátal, Endre Szemerédi

Eur. J. Comb., 1982

1981

Balancing signed graphs.

Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era

Discret. Appl. Math., 1981

Combinatorial properties of polyominoes.

Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow

Comb., 1981

1980

Hard Knapsack Problems.

Vasek Chvátal

Oper. Res., 1980

1979

A Greedy Heuristic for the Set-Covering Problem.

Vasek Chvátal

Math. Oper. Res., 1979

Three-regular subgraphs of four-regular graphs.

Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen

J. Graph Theory, 1979

Combinatorial designs related to the strong perfect graph conjecture.

Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides

Discret. Math., 1979

The tail of the hypergeometric distribution.

Vasek Chvátal

Discret. Math., 1979

1978

Distances in orientations of graphs.

Vasek Chvátal, Carsten Thomassen

J. Comb. Theory B, 1978

1977

Determining the Stability Number of a Graph.

Vasek Chvátal

SIAM J. Comput., 1977

Tree-complete graph ramsey numbers.

Vasek Chvátal

J. Graph Theory, 1977

1976

D. Ray Fulkerson's Contributions to Operations Research.

Vasek Chvátal

Math. Oper. Res., 1976

A method in graph theory.

J. Adrian Bondy, Vasek Chvátal

Discret. Math., 1976

1973

Edmonds polytopes and weakly hamiltonian graphs.

Václav Chvátal

Math. Program., 1973

1972

Ramsey's theorem and self-complementary graphs.

Vasek Chvátal, Paul Erdös, Z. Hedrlín

Discret. Math., 1972

A note on Hamiltonian circuits.

Vasek Chvátal, Paul Erdös

Discret. Math., 1972