Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vasek Chvátal
2010 – today
- 2013
[j38]Victor Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian: Transversals in Trees. Journal of Graph Theory 73(1): 32-43 (2013)- 2011
- [e1]Vasek Chvátal (Ed.): Combinatorial Optimization - Methods and Applications. NATO Science for Peace and Security Series - D: Information and Communication Security 31, IOS Press 2011, ISBN 978-1-60750-717-8
- [j37]Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer: Finite Sholander trees, trees, and their betweenness. Discrete Mathematics 311(20): 2143-2147 (2011)
- [j36]Ehsan Chiniforooshan, Vasek Chvátal: A de Bruijn - Erdős theorem and metric spaces. Discrete Mathematics & Theoretical Computer Science 13(1): 67-74 (2011)
- [j35]Vasek Chvátal: Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs and Combinatorics 27(2): 171-175 (2011)
- 2010
- [j34]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)
2000 – 2009
- 2009
- [j33]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
- [j32]
- [j31]Xiaomin Chen, Vasek Chvátal: Problems related to a de Bruijn-Erdös theorem. Discrete Applied Mathematics 156(11): 2101-2108 (2008)
- [c7]Vasek Chvátal: Antimatroids, Betweenness, Convexity. Bonn Workshop of Combinatorial Optimization 2008: 57-64
- [c6]
- 2007
- [c5]
- 2006
- [j30]Vasek Chvátal: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 306(10-11): 886-904 (2006)
- [j29]Vasek Chvátal: Tough graphs and hamiltonian circuits. Discrete Mathematics 306(10-11): 910-917 (2006)
- [j28]
- 2004
- [j27]Vasek Chvátal: Sylvester-Gallai Theorem and Metric Betweenness. Discrete & Computational Geometry 31(2): 175-195 (2004)
- 2003
- [j26]
- [j25]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
- [j24]Vasek Chvátal, Irena Rusu, R. Sritharan: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics 256(1-2): 445-448 (2002)
- [j23]Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline: Recognizing Dart-Free Perfect Graphs. SIAM J. Comput. 31(5): 1315-1338 (2002)
- 2001
- [c4]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
- [c3]Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline: Recognizing dart-free perfect graphs. SODA 2000: 50-53
- [c2]David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook: Cutting planes and the traveling salesman problem (abstract only). SODA 2000: 429
1990 – 1999
- 1997
- [j22]
- [j21]
- 1993
- [j20]Vasek Chvátal: Which Claw-Free Graphs are Perfectly Orderable? Discrete Applied Mathematics 44(1-3): 39-63 (1993)
- 1992
- [j19]Vasek Chvátal, Colin McDiarmid: Small transversals in hypergraphs. Combinatorica 12(1): 19-26 (1992)
- [c1]
- 1991
- [j18]Vasek Chvátal: Almost All Graphs with 1.44n Edges are 3-Colorable. Random Struct. Algorithms 2(1): 11-28 (1991)
- 1990
- [j17]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)
- [j16]
- [j15]Vasek Chvátal, William J. Cook: The discipline number of a graph. Discrete Mathematics 86(1-3): 191-198 (1990)
- [j14]Vasek Chvátal, William J. Lenhart, Najiba Sbihi: Two-colourings that decompose perfect graphs. J. Comb. Theory, Ser. B 49(1): 1-9 (1990)
- [j13]Vasek Chvátal: Which line-graphs are perfectly orderable? Journal of Graph Theory 14(5): 555-558 (1990)
1980 – 1989
- 1988
- [j12]
- [j11]Vasek Chvátal, Najiba Sbihi: Recognizing claw-free perfect graphs. J. Comb. Theory, Ser. B 44(2): 154-176 (1988)
- 1987
- [j10]Vasek Chvátal, Najiba Sbihi: Bull-free Berge graphs are perfect. Graphs and Combinatorics 3(1): 127-139 (1987)
- [j9]Vasek Chvátal: On the P4-structure of perfect graphs III. Partner decompositions. J. Comb. Theory, Ser. B 43(3): 349-353 (1987)
- [j8]Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra: Four classes of perfectly orderable graphs. Journal of Graph Theory 11(4): 481-495 (1987)
- 1985
- [j7]
- [j6]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
- [j5]
- [j4]Vasek Chvátal, Endre Szemerédi: Short cycles in directed graphs. J. Comb. Theory, Ser. B 35(3): 323-327 (1983)
- 1981
- [j3]Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow: Combinatorial properties of polyominoes. Combinatorica 1(3): 217-224 (1981)
1970 – 1979
- 1978
- [j2]Vasek Chvátal, Carsten Thomassen: Distances in orientations of graphs. J. Comb. Theory, Ser. B 24(1): 61-75 (1978)
- 1977
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-26 22:06 CEST by the dblp team