default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasek Chvátal
Person information
- affiliation: Concordia University, Montreal, Canada
- award (2007): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j64]Vasek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó:
Metric spaces in which many triangles are degenerate. Discret. Appl. Math. 350: 97-99 (2024)
2010 – 2019
- 2016
- [j63]Vasek Chvátal, Mark Goldsmith, Nan Yang:
McCulloch-Pitts Brains and Pseudorandom Functions. Neural Comput. 28(6): 1042-1050 (2016) - [i1]Vasek Chvátal, Mark Goldsmith, Nan Yang:
McCulloch-Pitts brains and pseudorandom functions. CoRR abs/1603.01573 (2016) - 2015
- [j62]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky
, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j61]Pierre Aboulker, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vasek Chvátal, Peihan Miao:
Number of lines in hypergraphs. Discret. Appl. Math. 171: 137-140 (2014) - 2013
- [j60]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - [j59]Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian:
Transversals in Trees. J. Graph Theory 73(1): 32-43 (2013) - [j58]Vasek Chvátal, William J. Cook, Daniel G. Espinoza:
Local cuts for mixed-integer programming. Math. Program. Comput. 5(2): 171-200 (2013) - 2011
- [j57]Vasek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer:
Finite Sholander trees, trees, and their betweenness. Discret. Math. 311(20): 2143-2147 (2011) - [j56]Ehsan Chiniforooshan, Vasek Chvátal:
A de Bruijn - Erdős theorem and metric spaces. Discret. Math. Theor. Comput. Sci. 13(1): 67-74 (2011) - [j55]Vasek Chvátal:
Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs Comb. 27(2): 171-175 (2011) - [e1]Vasek Chvátal:
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 [contents] - 2010
- [j54]Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest:
Another Abstraction of the Erdös-Szekeres Happy End Theorem. Electron. J. Comb. 17(1) (2010) - [p1]Vasek Chvátal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson:
Solution of a Large-Scale Traveling-Salesman Problem. 50 Years of Integer Programming 2010: 7-28
2000 – 2009
- 2009
- [j53]David L. 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
- [j52]Vasek Chvátal:
Remembering Leo Khachiyan. Discret. Appl. Math. 156(11): 1961-1962 (2008) - [j51]Xiaomin Chen, Vasek Chvátal:
Problems related to a de Bruijn-Erdös theorem. Discret. Appl. Math. 156(11): 2101-2108 (2008) - [c7]Vasek Chvátal:
Antimatroids, Betweenness, Convexity. Bonn Workshop of Combinatorial Optimization 2008: 57-64 - [c6]Vasek Chvátal:
Combinatorial algorithms in concorde. IWOCA 2008: 3 - 2007
- [c5]Vasek Chvátal:
How To Be Fickle. MFCS 2007: 1 - 2006
- [j50]Vasek Chvátal:
Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 306(10-11): 886-904 (2006) - [j49]Vasek Chvátal:
Tough graphs and hamiltonian circuits. Discret. Math. 306(10-11): 910-917 (2006) - [j48]J. Adrian Bondy, Vasek Chvátal:
Preface. Discret. Math. 306(19-20): 2293-2295 (2006) - 2004
- [j47]Vasek Chvátal:
Sylvester-Gallai Theorem and Metric Betweenness. Discret. Comput. Geom. 31(2): 175-195 (2004) - 2003
- [j46]Vasek Chvátal:
Claude Berge: 5.6.1926-30.6.2002. Graphs Comb. 19(1): 1-6 (2003) - [j45]David L. 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
- [j44]Vasek Chvátal, Irena Rusu, R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. 256(1-2): 445-448 (2002) - [j43]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 L. 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 L. 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
- [j42]Vasek Chvátal:
Resolution Search. Discret. Appl. Math. 73(1): 81-99 (1997) - [j41]Vasek Chvátal:
In praise of Claude Berge. Discret. Math. 165-166: 3-9 (1997) - 1993
- [j40]Vasek Chvátal:
Which Claw-Free Graphs are Perfectly Orderable? Discret. Appl. Math. 44(1-3): 39-63 (1993) - 1992
- [j39]Vasek Chvátal, Colin McDiarmid:
Small transversals in hypergraphs. Comb. 12(1): 19-26 (1992) - [c1]Vasek Chvátal, Bruce A. Reed:
Mick Gets Some (the Odds Are on His Side). FOCS 1992: 620-627 - 1991
- [j38]Vasek Chvátal:
Almost All Graphs with 1.44n Edges are 3-Colorable. Random Struct. Algorithms 2(1): 11-28 (1991) - 1990
- [j37]Vasek Chvátal, C. Ebenegger:
A note on line digraphs and the directed max-cut problem. Discret. Appl. Math. 29(2-3): 165-170 (1990) - [j36]Jin Akiyama, Vasek Chvátal:
Packing paths perfectly. Discret. Math. 85(3): 247-255 (1990) - [j35]Vasek Chvátal, William J. Cook:
The discipline number of a graph. Discret. Math. 86(1-3): 191-198 (1990) - [j34]Vasek Chvátal, William J. Lenhart, Najiba Sbihi:
Two-colourings that decompose perfect graphs. J. Comb. Theory B 49(1): 1-9 (1990) - [j33]Vasek Chvátal:
Which line-graphs are perfectly orderable? J. Graph Theory 14(5): 555-558 (1990)
1980 – 1989
- 1988
- [j32]Vasek Chvátal, Endre Szemerédi:
Many Hard Examples for Resolution. J. ACM 35(4): 759-768 (1988) - [j31]Vasek Chvátal, Najiba Sbihi:
Recognizing claw-free perfect graphs. J. Comb. Theory B 44(2): 154-176 (1988) - 1987
- [j30]Vasek Chvátal, Najiba Sbihi:
Bull-free Berge graphs are perfect. Graphs Comb. 3(1): 127-139 (1987) - [j29]Vasek Chvátal:
On the P4-structure of perfect graphs III. Partner decompositions. J. Comb. Theory B 43(3): 349-353 (1987) - [j28]Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra:
Four classes of perfectly orderable graphs. J. Graph Theory 11(4): 481-495 (1987) - [j27]Egon Balas, Vasek Chvátal, Jaroslav Nesetril:
On the Maximum Weight Clique Problem. Math. Oper. Res. 12(3): 522-535 (1987) - 1985
- [j26]Vasek Chvátal:
Cutting Planes in Combinatorics. Eur. J. Comb. 6(3): 217-226 (1985) - [j25]Vasek Chvátal:
Star-cutsets and perfect graphs. J. Comb. Theory B 39(3): 189-199 (1985) - [j24]Vasek Chvátal, Chính T. Hoàng:
On the P4-structure of perfect graphs I. Even decompositions. J. Comb. Theory B 39(3): 209-219 (1985) - 1984
- [j23]Vasek Chvátal:
Probabilistic methods in graph theory. Ann. Oper. Res. 1(3): 171-182 (1984) - [j22]Vasek Chvátal:
Recognizing decomposable graphs. J. Graph Theory 8(1): 51-53 (1984) - 1983
- [j21]Vasek Chvátal:
Mastermind. Comb. 3(3): 325-329 (1983) - [j20]Vasek Chvátal:
On the bicycle problem. Discret. Appl. Math. 5(2): 165-173 (1983) - [j19]Vasek Chvátal, Endre Szemerédi:
Short cycles in directed graphs. J. Comb. Theory B 35(3): 323-327 (1983) - 1982
- [j18]Václav Chvátal, Endre Szemerédi:
On an Extremal Problem Concerning Intervals. Eur. J. Comb. 3(3): 215-217 (1982) - 1981
- [j17]Claude Berge, C. C. Chen, Vasek Chvátal, C. S. Seow:
Combinatorial properties of polyominoes. Comb. 1(3): 217-224 (1981) - [j16]Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era:
Balancing signed graphs. Discret. Appl. Math. 3(4): 227-233 (1981) - 1980
- [j15]Vasek Chvátal:
Hard Knapsack Problems. Oper. Res. 28(6): 1402-1411 (1980)
1970 – 1979
- 1979
- [j14]Vasek Chvátal:
The tail of the hypergeometric distribution. Discret. Math. 25(3): 285-287 (1979) - [j13]Vasek Chvátal, Ronald L. Graham, André F. Perold, Sue Whitesides:
Combinatorial designs related to the strong perfect graph conjecture. Discret. Math. 26(2): 83-92 (1979) - [j12]Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen:
Three-regular subgraphs of four-regular graphs. J. Graph Theory 3(4): 371-386 (1979) - [j11]Vasek Chvátal:
A Greedy Heuristic for the Set-Covering Problem. Math. Oper. Res. 4(3): 233-235 (1979) - 1978
- [j10]Vasek Chvátal, Carsten Thomassen:
Distances in orientations of graphs. J. Comb. Theory B 24(1): 61-75 (1978) - 1977
- [j9]Vasek Chvátal:
Tree-complete graph ramsey numbers. J. Graph Theory 1(1): 93 (1977) - [j8]Vasek Chvátal:
Determining the Stability Number of a Graph. SIAM J. Comput. 6(4): 643-662 (1977) - 1976
- [j7]J. Adrian Bondy, Vasek Chvátal:
A method in graph theory. Discret. Math. 15(2): 111-135 (1976) - [j6]Vasek Chvátal:
D. Ray Fulkerson's Contributions to Operations Research. Math. Oper. Res. 1(4): 311-320 (1976) - 1973
- [j5]Vasek Chvátal:
Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4(4): 305-337 (1973) - [j4]Vasek Chvátal:
Tough graphs and hamiltonian circuits. Discret. Math. 5(3): 215-228 (1973) - [j3]Václav Chvátal:
Edmonds polytopes and weakly hamiltonian graphs. Math. Program. 5(1): 29-40 (1973) - 1972
- [j2]Vasek Chvátal, Paul Erdös:
A note on Hamiltonian circuits. Discret. Math. 2(2): 111-113 (1972) - [j1]Vasek Chvátal, Paul Erdös, Z. Hedrlín:
Ramsey's theorem and self-complementary graphs. Discret. Math. 3(4): 301-304 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
