Václav Chvátal (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Václav Chvátal" in English language version.

refsWebsite

Global rank English rank

9doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

4concordia.ca

8,706^th place

5,167^th place

2informs.org

low place

9,066^th place

2wolfram.com

513^th place

537^th place

2sciencenews.org

3,410^th place

2,939^th place

1mathprog.org

low place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1psu.edu

207^th place

136^th place

1nodak.edu

5,218^th place

9,258^th place

1dml.cz

low place

1math-inst.hu

low place

1nps.edu

low place

7,562^nd place

1stanford.edu

179^th place

183^rd place

1uni-bielefeld.de

9,437^th place

low place

1ams.org

451^st place

277^th place

1cut-the-knot.org

low place

1tv.com

509^th place

368^th place

1rutgers.edu

1,999^th place

1,355^th place

1jstor.org

26^th place

20^th place

1maa.org

3,479^th place

2,444^th place

ams.org

Diagonals: Part I 4. Art gallery problems, AMS Feature Column by Joseph Malkevitch

concordia.ca

ctr.concordia.ca

Vasek Chvátal is ‘the travelling professor’, Concordia's Thursday Report, Feb. 10, 2005.
Vasek Chvatal awarded Canada Research Chair, Concordia's Thursday Report, Oct. 23, 2003.

users.encs.concordia.ca

V. Chvátal; David A. Klarner; D.E. Knuth (1972), "Selected combinatorial research problems" (PDF), Computer Science Department, Stanford University, Stan-CS-TR-72-292: Problem 25
Chvátal, Vašek, A conjecture in extremal combinatorics

cut-the-knot.org

Chvatal's Art Gallery Theorem in Alexander Bogomolny's Cut the Knot

dml.cz

Chvátal, Václav (1965), "On finite and countable rigid graphs and tournaments", Commentationes Mathematicae Universitatis Carolinae, 6: 429–438.

doi.org

Avis, D.; Bondy, A.; Cook, W.; Reed, B. (2007). "Vasek Chvatal: A Short Introduction" (PDF). Graphs and Combinatorics. 23: 41–66. CiteSeerX 10.1.1.127.5910. doi:10.1007/s00373-007-0721-4. S2CID 11121944.
Chvátal, Vašek (1997), "In praise of Claude Berge", Discrete Mathematics, 165–166: 3–9, doi:10.1016/s0012-365x(96)00156-2,
V. Chvátal; P. Erdős (1972), "A note on Hamiltonian circuits" (PDF), Discrete Mathematics, 2 (2): 111–113, doi:10.1016/0012-365x(72)90079-9,
Chvátal, V. (1973), "Tough graphs and hamiltonian circuits", Discrete Mathematics, 5 (3): 215–228, doi:10.1016/0012-365x(73)90138-6,
Chvátal, Václav (1973), "Edmonds polytopes and weakly hamiltonian graphs", Mathematical Programming, 5: 29–40, doi:10.1007/BF01580109, S2CID 8140217,
Chvátal, Václav (1973), "Edmonds polytopes and a hierarchy of combinatorial problems", Discrete Mathematics, 4 (4): 305–337, doi:10.1016/0012-365x(73)90167-2,
Chvátal, V. (1975), "On certain polytopes associated with graphs", Journal of Combinatorial Theory, Series B, 18 (2): 138–154, doi:10.1016/0095-8956(75)90041-6.
Chvátal, Václav; Sankoff, David (1975), "Longest common subsequences of two random sequences", Journal of Applied Probability, 12 (2): 306–315, doi:10.2307/3212444, JSTOR 3212444, S2CID 250345191.
Chvátal, Vašek; Szemerédi, Endre (1988), "Many hard examples for resolution", Journal of the ACM, 35 (4): 759–768, doi:10.1145/48014.48016, S2CID 2526816.

informs.org

Frederick W. Lanchester Prize 2007, retrieved 2017-03-19.
John von Neumann Theory Prize 2015, retrieved 2017-03-19.

jstor.org

Chvátal, Václav; Sankoff, David (1975), "Longest common subsequences of two random sequences", Journal of Applied Probability, 12 (2): 306–315, doi:10.2307/3212444, JSTOR 3212444, S2CID 250345191.

maa.org

Borchers, Brian (March 25, 2007). "Review of The Traveling Salesman Problem: A Computational Study". MAA Reviews, Mathematical Association of America.

math-inst.hu

V. Chvátal; P. Erdős (1972), "A note on Hamiltonian circuits" (PDF), Discrete Mathematics, 2 (2): 111–113, doi:10.1016/0012-365x(72)90079-9,

mathprog.org

Past Winners of The Beale-Orchard-Hays Prize.

nodak.edu

genealogy.math.ndsu.nodak.edu

The Mathematics Genealogy Project – Václav Chvátal

nps.edu

faculty.nps.edu

Lesniak, Linda, Chvátal's t₀-tough conjecture (PDF)

psu.edu

citeseerx.ist.psu.edu

Avis, D.; Bondy, A.; Cook, W.; Reed, B. (2007). "Vasek Chvatal: A Short Introduction" (PDF). Graphs and Combinatorics. 23: 41–66. CiteSeerX 10.1.1.127.5910. doi:10.1007/s00373-007-0721-4. S2CID 11121944.

rutgers.edu

dimacs.rutgers.edu

Chvátal, Vašek (1993), "Notes on the Kolakoski Sequence", DIMACS Technical Reports, TR: 93-84

sciencenews.org

Artful Routes, Science News Online, Jan. 1, 2005.
Dangerous Problems, Science News Online, Jul. 13, 2002.

semanticscholar.org

api.semanticscholar.org

Avis, D.; Bondy, A.; Cook, W.; Reed, B. (2007). "Vasek Chvatal: A Short Introduction" (PDF). Graphs and Combinatorics. 23: 41–66. CiteSeerX 10.1.1.127.5910. doi:10.1007/s00373-007-0721-4. S2CID 11121944.
Chvátal, Václav (1973), "Edmonds polytopes and weakly hamiltonian graphs", Mathematical Programming, 5: 29–40, doi:10.1007/BF01580109, S2CID 8140217,
Chvátal, Václav; Sankoff, David (1975), "Longest common subsequences of two random sequences", Journal of Applied Probability, 12 (2): 306–315, doi:10.2307/3212444, JSTOR 3212444, S2CID 250345191.
Chvátal, Vašek; Szemerédi, Endre (1988), "Many hard examples for resolution", Journal of the ACM, 35 (4): 759–768, doi:10.1145/48014.48016, S2CID 2526816.

stanford.edu

i.stanford.edu

Chvátal, Václav (1975), "Some linear programming aspects of combinatorics" (PDF), Congressus Numerantium, 13: 2–30,

tv.com

Obsession, Numb3rs, Episode 3, Season 2

uni-bielefeld.de

math.uni-bielefeld.de

Applegate, David; Bixby, Robert; Chvátal, Vašek; Cook, William (1998), "On the Solution of Traveling Salesman Problems", Documenta Mathematica, Extra Volume ICM III

uwaterloo.ca

math.uwaterloo.ca

Avis, D.; Bondy, A.; Cook, W.; Reed, B. (2007). "Vasek Chvatal: A Short Introduction" (PDF). Graphs and Combinatorics. 23: 41–66. CiteSeerX 10.1.1.127.5910. doi:10.1007/s00373-007-0721-4. S2CID 11121944.

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W. "Chvátal Graph". MathWorld.
Weisstein, Eric W. "Art Gallery Theorem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/ArtGalleryTheorem.html