Vasek Chvátal

72 papers A* 3B 1C 1Journal 63Unranked 2

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Metric spaces in which many triangles are degenerate. Discret. Appl. Math. Vasek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó
2016	J	`jnl`	McCulloch-Pitts Brains and Pseudorandom Functions. Neural Comput. Vasek Chvátal, Mark Goldsmith, Nan Yang
2016	J	`jnl`	McCulloch-Pitts brains and pseudorandom functions. CoRR Vasek Chvátal, Mark Goldsmith, Nan Yang
2015	J	`jnl`	A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
2014	J	`jnl`	Number of lines in hypergraphs. Discret. Appl. Math. Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao
2013	J	`jnl`	Lines in hypergraphs. Comb. Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols
2013	J	`jnl`	Local cuts for mixed-integer programming. Math. Program. Comput. Vasek Chvátal, William J. Cook, Daniel G. Espinoza
2013	J	`jnl`	Transversals in Trees. J. Graph Theory Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian
2011	J	`jnl`	A de Bruijn - Erdős theorem and metric spaces. Discret. Math. Theor. Comput. Sci. Ehsan Chiniforooshan, Vasek Chvátal
2011	—	`book`	Combinatorial Optimization - Methods and Applications Combinatorial Optimization - Methods and Applications Vasek Chvátal
2011	J	`jnl`	Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs Comb. Vasek Chvátal
2011	J	`jnl`	Finite Sholander trees, trees, and their betweenness. Discret. Math. Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
2010	J	`jnl`	Another Abstraction of the Erdös-Szekeres Happy End Theorem. Electron. J. Comb. Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest
2010	—	`ch.`	Solution of a Large-Scale Traveling-Salesman Problem. 50 Years of Integer Programming Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson
2009	J	`jnl`	Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun
2008	—	`conf`	Antimatroids, Betweenness, Convexity. Bonn Workshop of Combinatorial Optimization Vasek Chvátal
2008	C	`conf`	Combinatorial algorithms in concorde. IWOCA Vasek Chvátal
2008	J	`jnl`	Problems related to a de Bruijn-Erdös theorem. Discret. Appl. Math. Xiaomin Chen, Vasek Chvátal
2008	J	`jnl`	Remembering Leo Khachiyan. Discret. Appl. Math. Vasek Chvátal
2007	B	`conf`	How To Be Fickle. MFCS Vasek Chvátal
2006	J	`jnl`	Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. Vasek Chvátal
2006	J	`jnl`	Preface. Discret. Math. J. Adrian Bondy, Vasek Chvátal
2006	J	`jnl`	Tough graphs and hamiltonian circuits. Discret. Math. Vasek Chvátal
2004	J	`jnl`	Sylvester-Gallai Theorem and Metric Betweenness. Discret. Comput. Geom. Vasek Chvátal
2003	J	`jnl`	Claude Berge: 5.6.1926-30.6.2002. Graphs Comb. Vasek Chvátal
2003	J	`jnl`	Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2002	J	`jnl`	Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. Vasek Chvátal, Irena Rusu, R. Sritharan
2002	J	`jnl`	Recognizing Dart-Free Perfect Graphs. SIAM J. Comput. Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
2001	—	`conf`	TSP Cuts Which Do Not Conform to the Template Paradigm. Computational Combinatorial Optimization David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2000	A*	`conf`	Cutting planes and the traveling salesman problem (abstract only). SODA David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
2000	A*	`conf`	Recognizing dart-free perfect graphs. SODA Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
1997	J	`jnl`	In praise of Claude Berge. Discret. Math. Vasek Chvátal
1997	J	`jnl`	Resolution Search. Discret. Appl. Math. Vasek Chvátal
1993	J	`jnl`	Which Claw-Free Graphs are Perfectly Orderable? Discret. Appl. Math. Vasek Chvátal
1992	A*	`conf`	Mick Gets Some (the Odds Are on His Side) FOCS Vasek Chvátal, Bruce A. Reed
1992	J	`jnl`	Small transversals in hypergraphs. Comb. Vasek Chvátal, Colin McDiarmid
1991	J	`jnl`	Almost All Graphs with 1.44n Edges are 3-Colorable. Random Struct. Algorithms Vasek Chvátal
1990	J	`jnl`	A note on line digraphs and the directed max-cut problem. Discret. Appl. Math. Vasek Chvátal, C. Ebenegger
1990	J	`jnl`	Packing paths perfectly. Discret. Math. Jin Akiyama, Vasek Chvátal
1990	J	`jnl`	The discipline number of a graph. Discret. Math. Vasek Chvátal, William J. Cook
1990	J	`jnl`	Two-colourings that decompose perfect graphs. J. Comb. Theory B Vasek Chvátal, William J. Lenhart, Najiba Sbihi
1990	J	`jnl`	Which line-graphs are perfectly orderable? J. Graph Theory Vasek Chvátal
1988	J	`jnl`	Many Hard Examples for Resolution. J. ACM Vasek Chvátal, Endre Szemerédi
1988	J	`jnl`	Recognizing claw-free perfect graphs. J. Comb. Theory B Vasek Chvátal, Najiba Sbihi
1987	J	`jnl`	Bull-free Berge graphs are perfect. Graphs Comb. Vasek Chvátal, Najiba Sbihi
1987	J	`jnl`	Four classes of perfectly orderable graphs. J. Graph Theory Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra
1987	J	`jnl`	On the J. Comb. Theory B Vasek Chvátal
1987	J	`jnl`	On the Maximum Weight Clique Problem. Math. Oper. Res. Egon Balas, Vasek Chvátal, Jaroslav Nesetril
1985	J	`jnl`	Cutting Planes in Combinatorics. Eur. J. Comb. Vasek Chvátal
1985	J	`jnl`	On the J. Comb. Theory B Vasek Chvátal, Chính T. Hoàng
1985	J	`jnl`	Star-cutsets and perfect graphs. J. Comb. Theory B Vasek Chvátal
1984	J	`jnl`	Probabilistic methods in graph theory. Ann. Oper. Res. Vasek Chvátal
1984	J	`jnl`	Recognizing decomposable graphs. J. Graph Theory Vasek Chvátal
1983	J	`jnl`	Mastermind. Comb. Vasek Chvátal
1983	J	`jnl`	On the bicycle problem. Discret. Appl. Math. Vasek Chvátal
1983	J	`jnl`	Short cycles in directed graphs. J. Comb. Theory B Vasek Chvátal, Endre Szemerédi
1981	J	`jnl`	Balancing signed graphs. Discret. Appl. Math. Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era
1981	J	`jnl`	Combinatorial properties of polyominoes. Comb. Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow
1980	J	`jnl`	Hard Knapsack Problems. Oper. Res. Vasek Chvátal
1979	J	`jnl`	A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. Vasek Chvátal
1979	J	`jnl`	Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides
1979	J	`jnl`	The tail of the hypergeometric distribution. Discret. Math. Vasek Chvátal
1979	J	`jnl`	Three-regular subgraphs of four-regular graphs. J. Graph Theory Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen
1978	J	`jnl`	Distances in orientations of graphs. J. Comb. Theory B Vasek Chvátal, Carsten Thomassen
1977	J	`jnl`	Determining the Stability Number of a Graph. SIAM J. Comput. Vasek Chvátal
1977	J	`jnl`	Tree-complete graph ramsey numbers. J. Graph Theory Vasek Chvátal
1976	J	`jnl`	A method in graph theory. Discret. Math. J. Adrian Bondy, Vasek Chvátal
1976	J	`jnl`	D. Ray Fulkerson's Contributions to Operations Research. Math. Oper. Res. Vasek Chvátal
1973	J	`jnl`	Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. Vasek Chvátal
1973	J	`jnl`	Tough graphs and hamiltonian circuits. Discret. Math. Vasek Chvátal
1972	J	`jnl`	A note on Hamiltonian circuits. Discret. Math. Vasek Chvátal, Paul Erdös
1972	J	`jnl`	Ramsey's theorem and self-complementary graphs. Discret. Math. Vasek Chvátal, Paul Erdös, Z. Hedrlín