Vasek Chvátal

According to our database1, Vasek Chvátal authored at least 68 papers between 1972 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
McCulloch-Pitts Brains and Pseudorandom Functions.
Neural Comput., 2016

2015
A De Bruijn-Erdős Theorem for Chordal Graphs.
Electron. J. Comb., 2015

2014
Number of lines in hypergraphs.
Discret. Appl. Math., 2014

2013
Local cuts for mixed-integer programming.
Math. Program. Comput., 2013

Transversals in Trees.
J. Graph Theory, 2013

Lines in hypergraphs.
Comb., 2013

2011
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs.
Graphs Comb., 2011

A de Bruijn - Erdős theorem and metric spaces.
Discret. Math. Theor. Comput. Sci., 2011

Finite Sholander trees, trees, and their betweenness.
Discret. Math., 2011

2010
Another Abstraction of the Erdös-Szekeres Happy End Theorem.
Electron. J. Comb., 2010

Solution of a Large-Scale Traveling-Salesman Problem.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett., 2009

2008
Remembering Leo Khachiyan.
Discret. Appl. Math., 2008

Problems related to a de Bruijn-Erdös theorem.
Discret. Appl. Math., 2008

Combinatorial algorithms in concorde.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Antimatroids, Betweenness, Convexity.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
How To Be Fickle.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Preface.
Discret. Math., 2006

2004
Sylvester-Gallai Theorem and Metric Betweenness.
Discret. Comput. Geom., 2004

2003
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.
Math. Program., 2003

Claude Berge: 5.6.1926-30.6.2002.
Graphs Comb., 2003

2002
Recognizing Dart-Free Perfect Graphs.
SIAM J. Comput., 2002

Dirac-type characterizations of graphs without long chordless cycles.
Discret. Math., 2002

2001
TSP Cuts Which Do Not Conform to the Template Paradigm.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
Cutting planes and the traveling salesman problem (abstract only).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1997
In praise of Claude Berge.
Discret. Math., 1997

Resolution Search.
Discret. Appl. Math., 1997

1993
Which Claw-Free Graphs are Perfectly Orderable?
Discret. Appl. Math., 1993

1992
Small transversals in hypergraphs.
Comb., 1992

Mick Gets Some (the Odds Are on His Side)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Almost All Graphs with 1.44n Edges are 3-Colorable.
Random Struct. Algorithms, 1991

1990
Which line-graphs are perfectly orderable?
J. Graph Theory, 1990

Two-colourings that decompose perfect graphs.
J. Comb. Theory, Ser. B, 1990

The discipline number of a graph.
Discret. Math., 1990

Packing paths perfectly.
Discret. Math., 1990

A note on line digraphs and the directed max-cut problem.
Discret. Appl. Math., 1990

1988
Recognizing claw-free perfect graphs.
J. Comb. Theory, Ser. B, 1988

Many Hard Examples for Resolution.
J. ACM, 1988

1987
On the Maximum Weight Clique Problem.
Math. Oper. Res., 1987

Four classes of perfectly orderable graphs.
J. Graph Theory, 1987

On the <i>P</i><sub>4</sub>-structure of perfect graphs III. Partner decompositions.
J. Comb. Theory, Ser. B, 1987

Bull-free Berge graphs are perfect.
Graphs Comb., 1987

1985
On the <i>P</i><sub>4</sub>-structure of perfect graphs I. Even decompositions.
J. Comb. Theory, Ser. B, 1985

Star-cutsets and perfect graphs.
J. Comb. Theory, Ser. B, 1985

Cutting Planes in Combinatorics.
Eur. J. Comb., 1985

1984
Recognizing decomposable graphs.
J. Graph Theory, 1984

Probabilistic methods in graph theory.
Ann. Oper. Res., 1984

1983
Short cycles in directed graphs.
J. Comb. Theory, Ser. B, 1983

On the bicycle problem.
Discret. Appl. Math., 1983

Mastermind.
Comb., 1983

1982
On an Extremal Problem Concerning Intervals.
Eur. J. Comb., 1982

1981
Balancing signed graphs.
Discret. Appl. Math., 1981

Combinatorial properties of polyominoes.
Comb., 1981

1980
Hard Knapsack Problems.
Oper. Res., 1980

1979
A Greedy Heuristic for the Set-Covering Problem.
Math. Oper. Res., 1979

Three-regular subgraphs of four-regular graphs.
J. Graph Theory, 1979

Combinatorial designs related to the strong perfect graph conjecture.
Discret. Math., 1979

The tail of the hypergeometric distribution.
Discret. Math., 1979

1978
Distances in orientations of graphs.
J. Comb. Theory, Ser. B, 1978

1977
Determining the Stability Number of a Graph.
SIAM J. Comput., 1977

Tree-complete graph ramsey numbers.
J. Graph Theory, 1977

1976
D. Ray Fulkerson's Contributions to Operations Research.
Math. Oper. Res., 1976

A method in graph theory.
Discret. Math., 1976

1973
Edmonds polytopes and weakly hamiltonian graphs.
Math. Program., 1973

Edmonds polytopes and a hierarchy of combinatorial problems.
Discret. Math., 1973

Tough graphs and hamiltonian circuits.
Discret. Math., 1973

1972
Ramsey's theorem and self-complementary graphs.
Discret. Math., 1972

A note on Hamiltonian circuits.
Discret. Math., 1972


  Loading...