IUUK-CE-ITI series 2001

2001-7 R. L. Graham, J. Nešetřil
Ramsey Theory and Paul Erdős (recent results from a historical perspective)
PS
2001-8 Z. Ryjáček, R. H. Schelp
Contractibility Techniques as a Closure Concept
PS
2001-9 B. Banaschewski, A. Pultr
Remarks on Information Systems
PS
2001-10 F. V. Fomin, D. M. Thilikos
On the Monotonicity of Games Generated by Symmetric Submodular Functions
PS
2001-11 M. Caramia, J. Fiala
New Lower Bounds on the Weighted Chromatic Number of a Graph
PS
2001-12 J. Fiala, J. Kratochvíl, A. Proskurowski
Distance Constrained Labeling of Precolored Trees
PS
2001-13 D. Fon-Der-Flaass, A. Kostochka, J. Nešetřil, A. Raspaud, E. Sopena
Nilpotent Families of Endomorphisms of (P(V)+, U)
PS
2001-14 P. Podbrdský
A Bijective Proof of an Identity for Noncrossing Graphs
PS
2001-15 P. Hájek
A New Small Emendation of Gödel's Ontological Proof
PS
2001-16 M. Klazar
Generalized Davenport-Schinzel Sequences: Results, Problems, and Applications
PS
2001-17 F. Cagliari, A. Pultr
A Note on Injective Spaces
PS
2001-18 R. Barták
Dynamic Global Constraints in Constraint Logic Programming
PS
2001-19 J. Šimek ed.
Czech and Slovak Conference on Graph Theory and Combinatorics - Sedmihorky Spa, June 4-8, 2001
PS
2001-20 R. Impagliazzo, J. Krajíček
A Note on Conservativity Relations among Bounded Arithmetic Theories
PS
2001-21 M. Klaza
Extremal Problems (and a Bit of Enumeration) for Hypergraphs with Linearly Ordered Vertex Sets
PS
2001-22 V. Jungic
On a Set of 2-colorings
PS
2001-23 D. Kráľ, J. Kratochvíl, H.-J. Voss
Complexity Note on Mixed Hypergraphs
PS
2001-24 P. Hell, J. Nešetřil
Counting List Homomorphisms and Graphs with Bounded Degrees
PS
2001-25 J. Nešetřil, P. Ossona de Mendez
Colorings and Homomorphisms of Minor Closed Classes
PS
2001-26 R. N. Ball, A. Pultr
Forbidden Forests in Priestley Spaces
PS
2001-27 P. Hájek
Mathematical Fuzzy Logic - State of Art 2001
PS
2001-28 J. Fiala, R. Škrekovski
List Distance Labelings of Graphs
PS
2001-29 P. Kolman, C. Scheideler
Improved Bounds for the Unsplittable Flow Problem
PS
2001-30 T. Erlebach, J. Fiala
Independence and Coloring Problems on Intersection Graphs of Disks
PS
2001-31 J. Nešetřil, C. Tardif
On Maximal Finite Antichains in the Homomorphism Order of Directed Graphs
PS
2001-32 D. Kráľ, J. Kratochvíl, H.-J. Voss
Mixed Hypercacti
PS
2001-33 J. Krajíček
Combinatorics of First Order Structures and Propositional Proof Systems
PS
2001-34 J. Krajíček
Interpolation and Approximate Semantic Derivations
PS
2001-35 J. Nešetřil
Art of Graph Drawing and Art
PS
2001-36 J. Nešetřil, C. Tardif
A Dualistic Approach to Bounding the Chromatic Number of a Graph
PS
2001-37 T. Kaiser
Line Transversals to Unit Disks
PS
2001-38 M. Klazar
Counting Even and Odd Partitions
PS
2001-39 M. Klazar
On non P-recursiveness of Numbers of Matchings (Linear Chord Diagrams) with Many Crossings
PS
2001-40 J. Němeček, M. Klazar
A Bijection between Nonnegative Words and Sparse abba-free Partitions
PS
2001-41 M. Fiedler
Matice a grafy v euklidovské geometrii
2001-42 D. Kráľ, R. Škrekovski
A theorem about the Channel Assignment Problem
PS