Search the dblp DataBase
Vasek Chvátal :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David Applegate , Robert E. Bixby , Vasek Chvátal , William Cook TSP Cuts Which Do Not Conform to the Template Paradigm. [Citation Graph (0, 0)][DBLP ] Computational Combinatorial Optimization, 2001, pp:261-304 [Conf ] Vasek Chvátal , B. Reed Mick Gets Some (the Odds Are on His Side) [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:620-627 [Conf ] David Applegate , Robert E. Bixby , Vasek Chvátal , William Cook Cutting planes and the traveling salesman problem (abstract only). [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:429- [Conf ] Vasek Chvátal , Jean Fonlupt , L. Sun , A. Zemirline Recognizing dart-free perfect graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:50-53 [Conf ] C. Berge , C. C. Chen , Vasek Chvátal , C. S. Seow Combinatorial properties of polyominoes. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:3, pp:217-224 [Journal ] Vasek Chvátal , Colin McDiarmid Small transversals in hypergraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1992, v:12, n:1, pp:19-26 [Journal ] Vasek Chvátal Mastermind. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:3, pp:325-329 [Journal ] Vasek Chvátal Which Claw-Free Graphs are Perfectly Orderable? [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:39-63 [Journal ] Vasek Chvátal Resolution Search. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:73, n:1, pp:81-99 [Journal ] Vasek Chvátal Sylvester-Gallai Theorem and Metric Betweenness. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2004, v:31, n:2, pp:175-195 [Journal ] Vasek Chvátal Edmonds polytopes and a hierarchy of combinatorial problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:10-11, pp:886-904 [Journal ] Vasek Chvátal Tough graphs and hamiltonian circuits. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:10-11, pp:910-917 [Journal ] Vasek Chvátal , Irena Rusu , R. Sritharan Dirac-type characterizations of graphs without long chordless cycles. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:256, n:1-2, pp:445-448 [Journal ] Adrian Bondy , Vasek Chvátal Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:19-20, pp:2293-2295 [Journal ] Vasek Chvátal Claude Berge: 5.6.1926-30.6.2002. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2003, v:19, n:1, pp:1-6 [Journal ] Vasek Chvátal , Endre Szemerédi Many Hard Examples for Resolution. [Citation Graph (0, 0)][DBLP ] J. ACM, 1988, v:35, n:4, pp:759-768 [Journal ] Vasek Chvátal Star-cutsets and perfect graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:189-199 [Journal ] Vasek Chvátal On the P 4 -structure of perfect graphs III. Partner decompositions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1987, v:43, n:3, pp:349-353 [Journal ] Vasek Chvátal , C. T. Hoang On the P 4 -structure of perfect graphs I. Even decompositions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:209-219 [Journal ] Vasek Chvátal , William J. Lenhart , Najiba Sbihi Two-colourings that decompose perfect graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:1-9 [Journal ] Vasek Chvátal , Endre Szemerédi Short cycles in directed graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:323-327 [Journal ] Vasek Chvátal , Najiba Sbihi Recognizing claw-free perfect graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1988, v:44, n:2, pp:154-176 [Journal ] Vasek Chvátal , Carsten Thomassen Distances in orientations of graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:24, n:1, pp:61-75 [Journal ] Vasek Chvátal Almost All Graphs with 1.44n Edges are 3-Colorable. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1991, v:2, n:1, pp:11-28 [Journal ] Vasek Chvátal Determining the Stability Number of a Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1977, v:6, n:4, pp:643-662 [Journal ] Vasek Chvátal , Jean Fonlupt , L. Sun , A. Zemirline Recognizing Dart-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2002, v:31, n:5, pp:1315-1338 [Journal ] Vasek Chvátal How To Be Fickle. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:1- [Conf ] Vasek Chvátal In praise of Claude Berge. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:165, n:, pp:3-9 [Journal ] Jin Akiyama , Vasek Chvátal Packing paths perfectly. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:85, n:3, pp:247-255 [Journal ] Vasek Chvátal , William Cook The discipline number of a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:86, n:1-3, pp:191-198 [Journal ] Problems related to a de Bruijn-Erdös theorem. [Citation Graph (, )][DBLP ] Remembering Leo Khachiyan. [Citation Graph (, )][DBLP ] A note on line digraphs and the directed max-cut problem. [Citation Graph (, )][DBLP ] Search in 0.024secs, Finished in 0.025secs