VIAF

Virtual International Authority File

Search

Cover for 0716715872

Chvátal, Vašek (1946- ).National Diet Library (Japan)Deutsche NationalbibliothekSUDOC (France)National Library of the Netherlands-testNUKAT Center (Poland)Bibliothèque nationale de FranceLibrary of Congress/NACO

Chvatal, VaclavWikipedia (en)-test

VIAF ID: 44375023 (Personal)

Permalink: http://viaf.org/viaf/44375023

Open SectionClose Section Preferred Forms

  • National Diet Library (Japan)
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vasek,‏ ‎‡d  1946-
  • Bibliothèque nationale de France
    Internal VIAF record
    200 _ | ‎‡a  Chvátal‏ ‎‡b  Vasek‏ ‎‡f  1946-....
  • NUKAT Center (Poland)
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vašek‏ ‎‡d  (1946- ).
  • Wikipedia (en)-test
    Internal VIAF record
    100 1 _ ‎‡a  Chvatal, Vaclav
  • National Library of the Netherlands-test
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vas̃ek,‏ ‎‡d  1946-
  • SUDOC (France)
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vasek,‏ ‎‡d  1946-....
  • Deutsche Nationalbibliothek
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vašek‏ ‎‡d  1946-
  • Library of Congress/NACO
    Internal VIAF record
    100 1 _ ‎‡a  Chvátal, Vašek,‏ ‎‡d  1946-

 

 

Open SectionClose Section 4xx's: Alternate Name Forms (5)

Open SectionClose Section Selected Titles

  1. Linear programming. ‎(8) NUKAT Center (Poland)National Library of the Netherlands-testNational Diet Library (Japan)Library of Congress/NACOBibliothèque nationale de France
  2. Recognizing dart free perfect graphs ‎(4) Deutsche Nationalbibliothek
  3. Topics on perfect graphs ‎(3) NUKAT Center (Poland)Library of Congress/NACO
  4. 線形計画法. ‎(2) National Diet Library (Japan)
  5. Which line-graphs are perfectly orderable? ‎(2) Deutsche Nationalbibliothek
  6. Small transversals in hypergraphs ‎(2) Deutsche Nationalbibliothek
  7. Senkei keikakuhō. ‎(2) National Diet Library (Japan)
  8. On cutting plane proofs in combinatorial optimization ‎(2) Deutsche Nationalbibliothek
  9. Dealing with hard problems (lecture notes on approximation algorithms and randomized algorithms) ‎(2) Deutsche Nationalbibliothek
  10. A class of perfectly orderable graphs ‎(1) Deutsche Nationalbibliothek

Open SectionClose Section Selected Co-authors

Open SectionClose Section Countries of Publication (4)

Open SectionClose Section Publication Statistics

Open SectionClose Section Selected Publishers (8)

Open SectionClose Section About

Open SectionClose Section History of VIAF ID:44375023 (12)