Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] (ISNI Number (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
cre
Language material
Text
Two-dimensional nonprojectable graphic
Creation role: 
artist
author
compiler
contributor
editor
redactor
Related names: 
Fiedler, Miroslav (1926-)
Graham, Ronald L. (1935-)
Hell, Pavol
Loebl, Martin
Matousek, Jiri (1963-)
Načeradský, Jiří (1939-2014)
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
Antropogeometrie
Combinatorial Aspects of Davenport-Schinzel Sequences
Combinatorics, graphs, complexity : proceedings of the 4th Czechoslovak symposium on combinatorics, Prachatice June 1990, society of Czechoslovakian mathematicians and physicists
Combinatorics graphs complexity : proceedings of the Fourth Czechoslovak Symposium on Combinatorics : Prachatice - June 1990
Computer science review.
Discrete mathematics
Diskrete Mathematik : eine Entdeckungsreise
Either tournaments or algebras?
ESA'99
Fast and Slow Growning : A Combinatorial Study of Unprovability
Forth Czechoslovakian symposium on combinatorics, graphs nd complexity
Fourth Czechoslovakian Symposium on combinatorics, graphs and complexity : [Prachatice 1990 : sborník referátů]
Grafy
Graphs and homomorphisms
Graphs, morphisms, and statistical physics DIMACS Workshop Graphs, Morphisms and Statistical Physics, March 19-21, 2001, DIMACS Center
Graphs with small asymmetries
Groups and monoids of regular graphs (and of graphs with bounded degrees)
Introduction aux mathématiques discrètes
Invitation to discrete mathematics.
Jan Pelant in memoriam
Jaroslav Nešetřil, Jiří Načeradský
Jiří Načeradský, Jaroslav Nešetřil 1 + 1 nebezpečné známosti, antropogeometrie IV : od 9. prosince 1998 do 7. února 1999 Rabasova galerie v Rakovníku
Jiří Načeradský, Jaroslav Nešetřil, Stanislav Tůma
Kapitoly z diskrétní matematiky
Kdo zavraždil vévodu z Densmoru?
Kombinatorika : určeno pro posl. fak. matematicko-fyz.
mathematics of Paul Erdös, The
Mathematics of Ramsey theory :
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.]
Shadows of coherence
Sparsity graphs, structures, and algorithm
Sparsity : graphs, structures, and algorithms
Stanislav Tůma
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ů
Topics in discrete mathematics, 2006:
Topics in discrete mathematics : dedicated to Jarik Nešetřil on the occasion of his 60th birthday
Topological, algebraical, and combinatorial structures : Frolík's memorial volume
Vysoké funkce
離散数学への招待.
Contributed to or performed: 
DISCRETE APPLIED MATHEMATICS
Notes: 
Sources: 
VIAF BNF LC LNB NDL NKC NTA NUKAT SUDOC WKP
TEL
ZETO