 | 2011 |
|---|
| 42 |       | Vasek Chvátal:
Combinatorial Optimization - Methods and Applications
IOS Press 2011 |
| 41 | | Vasek Chvátal,
Dieter Rautenbach,
Philipp Matthias Schäfer:
Finite Sholander trees, trees, and their betweenness.
Discrete Mathematics 311(20): 2143-2147 (2011) |
| 40 | | Ehsan Chiniforooshan,
Vasek Chvátal:
A de Bruijn - Erdős theorem and metric spaces.
Discrete Mathematics & Theoretical Computer Science 13(1): 67-74 (2011) |
| 39 | | Vasek Chvátal:
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs.
Graphs and Combinatorics 27(2): 171-175 (2011) |
| 2010 |
|---|
| 38 | | Noga Alon,
Ehsan Chiniforooshan,
Vasek Chvátal,
François Genest:
Another Abstraction of the Erdös-Szekeres Happy End Theorem.
Electr. J. Comb. 17(1): (2010) |
| 2009 |
|---|
| 37 | | David 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): 11-15 (2009) |
| 2008 |
|---|
| 36 |  | Vasek Chvátal:
Combinatorial algorithms in concorde.
IWOCA 2008: 3 |
| 35 | | Vasek Chvátal:
Remembering Leo Khachiyan.
Discrete Applied Mathematics 156(11): 1961-1962 (2008) |
| 34 | | Xiaomin Chen,
Vasek Chvátal:
Problems related to a de Bruijn-Erdös theorem.
Discrete Applied Mathematics 156(11): 2101-2108 (2008) |
| 2007 |
|---|
| 33 | | Vasek Chvátal:
How To Be Fickle.
MFCS 2007: 1 |
| 2006 |
|---|
| 32 | | Vasek Chvátal:
Edmonds polytopes and a hierarchy of combinatorial problems.
Discrete Mathematics 306(10-11): 886-904 (2006) |
| 31 | | Vasek Chvátal:
Tough graphs and hamiltonian circuits.
Discrete Mathematics 306(10-11): 910-917 (2006) |
| 30 | | Adrian Bondy,
Vasek Chvátal:
Preface.
Discrete Mathematics 306(19-20): 2293-2295 (2006) |
| 2004 |
|---|
| 29 | | Vasek Chvátal:
Sylvester-Gallai Theorem and Metric Betweenness.
Discrete & Computational Geometry 31(2): 175-195 (2004) |
| 2003 |
|---|
| 28 | | Vasek Chvátal:
Claude Berge: 5.6.1926-30.6.2002.
Graphs and Combinatorics 19(1): 1-6 (2003) |
| 27 | | David 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): 91-153 (2003) |
| 2002 |
|---|
| 26 | | Vasek Chvátal,
Irena Rusu,
R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles.
Discrete Mathematics 256(1-2): 445-448 (2002) |
| 25 | | Vasek Chvátal,
Jean Fonlupt,
L. Sun,
Abdelhamid Zemirline:
Recognizing Dart-Free Perfect Graphs.
SIAM J. Comput. 31(5): 1315-1338 (2002) |
| 2001 |
|---|
| 24 | | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook:
TSP Cuts Which Do Not Conform to the Template Paradigm.
Computational Combinatorial Optimization 2001: 261-304 |
| 2000 |
|---|
| 23 | | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook:
Cutting planes and the traveling salesman problem (abstract only).
SODA 2000: 429 |
| 22 | | Vasek Chvátal,
Jean Fonlupt,
L. Sun,
Abdelhamid Zemirline:
Recognizing dart-free perfect graphs.
SODA 2000: 50-53 |
| 1997 |
|---|
| 21 | | Vasek Chvátal:
Resolution Search.
Discrete Applied Mathematics 73(1): 81-99 (1997) |
| 20 | | Vasek Chvátal:
In praise of Claude Berge.
Discrete Mathematics 165-166: 3-9 (1997) |
| 1993 |
|---|
| 19 | | Vasek Chvátal:
Which Claw-Free Graphs are Perfectly Orderable?
Discrete Applied Mathematics 44(1-3): 39-63 (1993) |
| 1992 |
|---|
| 18 | | Vasek Chvátal,
Bruce A. Reed:
Mick Gets Some (the Odds Are on His Side)
FOCS 1992: 620-627 |
| 17 | | Vasek Chvátal,
Colin McDiarmid:
Small transversals in hypergraphs.
Combinatorica 12(1): 19-26 (1992) |
| 1991 |
|---|
| 16 | | Vasek Chvátal:
Almost All Graphs with 1.44n Edges are 3-Colorable.
Random Struct. Algorithms 2(1): 11-28 (1991) |
| 1990 |
|---|
| 15 | | Vasek Chvátal,
C. Ebenegger:
A note on line digraphs and the directed max-cut problem.
Discrete Applied Mathematics 29(2-3): 165-170 (1990) |
| 14 | | Jin Akiyama,
Vasek Chvátal:
Packing paths perfectly.
Discrete Mathematics 85(3): 247-255 (1990) |
| 13 | | Vasek Chvátal,
William J. Cook:
The discipline number of a graph.
Discrete Mathematics 86(1-3): 191-198 (1990) |
| 12 | | Vasek Chvátal,
William J. Lenhart,
Najiba Sbihi:
Two-colourings that decompose perfect graphs.
J. Comb. Theory, Ser. B 49(1): 1-9 (1990) |
| 1988 |
|---|
| 11 | | Vasek Chvátal,
Endre Szemerédi:
Many Hard Examples for Resolution.
J. ACM 35(4): 759-768 (1988) |
| 10 | | Vasek Chvátal,
Najiba Sbihi:
Recognizing claw-free perfect graphs.
J. Comb. Theory, Ser. B 44(2): 154-176 (1988) |
| 1987 |
|---|
| 9 | | Vasek Chvátal,
Najiba Sbihi:
Bull-free Berge graphs are perfect.
Graphs and Combinatorics 3(1): 127-139 (1987) |
| 8 | | Vasek Chvátal:
On the P4-structure of perfect graphs III. Partner decompositions.
J. Comb. Theory, Ser. B 43(3): 349-353 (1987) |
| 1985 |
|---|
| 7 | | Vasek Chvátal:
Star-cutsets and perfect graphs.
J. Comb. Theory, Ser. B 39(3): 189-199 (1985) |
| 6 | | Vasek Chvátal,
Chính T. Hoàng:
On the P4-structure of perfect graphs I. Even decompositions.
J. Comb. Theory, Ser. B 39(3): 209-219 (1985) |
| 1983 |
|---|
| 5 | | Vasek Chvátal:
Mastermind.
Combinatorica 3(3): 325-329 (1983) |
| 4 | | Vasek Chvátal,
Endre Szemerédi:
Short cycles in directed graphs.
J. Comb. Theory, Ser. B 35(3): 323-327 (1983) |
| 1981 |
|---|
| 3 | | Claude Berge,
C. C. Chen,
Vasek Chvátal,
C. S. Seow:
Combinatorial properties of polyominoes.
Combinatorica 1(3): 217-224 (1981) |
| 1978 |
|---|
| 2 | | Vasek Chvátal,
Carsten Thomassen:
Distances in orientations of graphs.
J. Comb. Theory, Ser. B 24(1): 61-75 (1978) |
| 1977 |
|---|
| 1 | | Vasek Chvátal:
Determining the Stability Number of a Graph.
SIAM J. Comput. 6(4): 643-662 (1977) |
Data released under the ODC-BY 1.0 license — See also our legal information page