Search results for "Vasek Chvátal"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer	Finite Sholander trees, trees, and their betweenness.	Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Ehsan Chiniforooshan, Vasek Chvátal	A de Bruijn - Erdős theorem and metric spaces.	Discrete Mathematics & Theoretical Computer Science	2011	DBLP BibTeX RDF
1	Vasek Chvátal	Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs.	Graphs and Combinatorics	2011	DBLP DOI BibTeX RDF
1	Vasek Chvátal (eds.)	Combinatorial Optimization - Methods and Applications		2011	DBLP DOI BibTeX RDF
1	Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest	Another Abstraction of the Erdös-Szekeres Happy End Theorem.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	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.	2009	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Remembering Leo Khachiyan.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Xiaomin Chen, Vasek Chvátal	Problems related to a de Bruijn-Erdös theorem.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Combinatorial algorithms in concorde.	IWOCA	2008	DBLP BibTeX RDF
1	Vasek Chvátal	How To Be Fickle.	MFCS	2007	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Edmonds polytopes and a hierarchy of combinatorial problems.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Tough graphs and hamiltonian circuits.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Adrian Bondy, Vasek Chvátal	Preface.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Sylvester-Gallai Theorem and Metric Betweenness.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Claude Berge: 5.6.1926-30.6.2002.	Graphs and Combinatorics	2003	DBLP DOI BibTeX RDF
1	David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook	Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems.	Math. Program.	2003	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Irena Rusu, R. Sritharan	Dirac-type characterizations of graphs without long chordless cycles.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline	Recognizing Dart-Free Perfect Graphs.	SIAM J. Comput.	2002	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline	Recognizing dart-free perfect graphs.	SODA	2000	DBLP DOI BibTeX RDF
1	David Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook	Cutting planes and the traveling salesman problem (abstract only).	SODA	2000	DBLP DOI BibTeX RDF
1	Vasek Chvátal	In praise of Claude Berge.	Discrete Mathematics	1997	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Resolution Search.	Discrete Applied Mathematics	1997	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Which Claw-Free Graphs are Perfectly Orderable?	Discrete Applied Mathematics	1993	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Colin McDiarmid	Small transversals in hypergraphs.	Combinatorica	1992	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Bruce A. Reed	Mick Gets Some (the Odds Are on His Side)	FOCS	1992	DBLP DOI BibTeX RDF	unsatisfiability, truth assignment, randomly generated boolean formula, probability, time complexity, satisfiability, conjunctive normal form, linear-time algorithm
1	Vasek Chvátal	Almost All Graphs with 1.44n Edges are 3-Colorable.	Random Struct. Algorithms	1991	DBLP DOI BibTeX RDF
1	Vasek Chvátal, William J. Lenhart, Najiba Sbihi	Two-colourings that decompose perfect graphs.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
1	Jin Akiyama, Vasek Chvátal	Packing paths perfectly.	Discrete Mathematics	1990	DBLP DOI BibTeX RDF
1	Vasek Chvátal, William J. Cook	The discipline number of a graph.	Discrete Mathematics	1990	DBLP DOI BibTeX RDF
1	Vasek Chvátal, C. Ebenegger	A note on line digraphs and the directed max-cut problem.	Discrete Applied Mathematics	1990	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Najiba Sbihi	Recognizing claw-free perfect graphs.	J. Comb. Theory, Ser. B	1988	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Endre Szemerédi	Many Hard Examples for Resolution.	J. ACM	1988	DBLP DOI BibTeX RDF
1	Vasek Chvátal	On the P4-structure of perfect graphs III. Partner decompositions.	J. Comb. Theory, Ser. B	1987	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Najiba Sbihi	Bull-free Berge graphs are perfect.	Graphs and Combinatorics	1987	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Star-cutsets and perfect graphs.	J. Comb. Theory, Ser. B	1985	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Chính T. Hoàng	On the P4-structure of perfect graphs I. Even decompositions.	J. Comb. Theory, Ser. B	1985	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Endre Szemerédi	Short cycles in directed graphs.	J. Comb. Theory, Ser. B	1983	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Mastermind.	Combinatorica	1983	DBLP DOI BibTeX RDF
1	Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow	Combinatorial properties of polyominoes.	Combinatorica	1981	DBLP DOI BibTeX RDF
1	Vasek Chvátal, Carsten Thomassen	Distances in orientations of graphs.	J. Comb. Theory, Ser. B	1978	DBLP DOI BibTeX RDF
1	Vasek Chvátal	Determining the Stability Number of a Graph.	SIAM J. Comput.	1977	DBLP DOI BibTeX RDF

Publications of "Vasek Chvátal" ( http://dblp.L3S.de/Authors/Vasek_Chvátal )