Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] ISN:0000000110708684 | 1 hits
Person
ISNI: 
0000 0001 1070 8684
Name: 
Nešetřil, J.
Nešetřil, Jarik
Nešetřil, Jaroslav,
ネシェトリル, J
Dates: 
1946-
Creation class: 
article
Computer file
cre
Language material
Text
Two-dimensional nonprojectable graphic
Creation role: 
artist
author
compiler
contributor
editor
redactor
Related names: 
Butler, Steve
Fiedler, Miroslav (1926-)
Graham, R.L. (1935-)
Graham, Ronald L. (1935- ))
Graham, Ronald Lewis (1935-....))
Graham, Ronald Lewis (1935-)
Hell, Pavol
Matoušek, Jiří (1963-)
Načeradský, Jiří (1939-2014)
Ossona de Mendez, Patrice
Rödl, Vojtěch
Univerzita Karlova
根上, 生也 (1957-)
Titles: 
Algebraické a kombinatorické vlastnosti součinů
Algebraické metody diskrétní matematiky : velmi rychlé násobení, obvody vysoké koncentrace, charakteristické věty, matroidy - netradiční moderní lineární algebra
Algorithms - ESA '99 : 7th annual European symposium, Prague, Czech Republic, July 16-18, 1999 : proceedings
Combinatorial Aspects of Davenport-Schinzel Sequences
Combinatorial number theory : Proceedings of the "Integers Conference 2011" Carrollton, Georgia, October 26-29, 2011
Computer science review.
Diskrete Mathematik : eine Entdeckungsreise
Either tournaments or algebras?
ESA'99
Fast and Slow Growning : A Combinatorial Study of Unprovability
Fourth Czechoslovakian symposium on combinatorics, graphs and complexity
Grafy
Graphs and homomorphisms
Graphs with small asymmetries
Groups and monoids of regular graphs (and of graphs with bounded degrees)
Integers (volume 13)
Invitation to discrete mathematics
Jan Pelant - in memoriam
Kapitoly z diskrétní matematiky
Kombinatorika : Určeno pro posl. fak. matematicko-fyz.
mathematics of Paul Erdös., The
Načeradský, Nešetřil : antropogeometrie
On ordered graphs and graph orderings
On reconstructing of infinite forests
On symmetric and antisymmetric relations
Partitions of subgraphs
Physics and theoretical computer science from numbers and languages to (quantum) cryptography security
Qui a tué le duc de Densmore?
Ramsey graph without triangles exists for any graph without triangles, A
Ramsey property for graphs with forbidden complete subgraphs, The
Ramseyova teorie pro systémy
Risan sūgaku eno shōtai.
Rozklad struktur : [Autoreferát kand. dis.]
Seventh European Conference on Combinatorics, Graph Theory and Applications, The : EuroComb 2013
Sparsity : graphs, structures, and algorithms
Stíny souvislostí : (tvarosloví) : (a vocabulary) : Jiří Načeradský, Jaroslav Nešetřil, Stanislav Tůma
Tension continuous maps—their structure and applications
Teorie grafů
Topological, algebraical, and combinatorial structures : Frolík's memorial volume
Vysoké funkce
離散数学への招待.
Contributed to or performed: 
DISCRETE APPLIED MATHEMATICS
Notes: 
Přehledy lit
Rozmn
Odkazy na lit
datum schválení: 19890427
ČVO: 11-03-9
Doktor. dis
autoreferát - datum: 1987
autoreferát - rozsah: 50 s
datum obhajoby: 19890104
Sources: 
VIAF LC LNB NDL NKC NTA NUKAT SUDOC WKP
TEL
ZETO