IUUK-CE-ITI series 2002

2002-43 D. Kráľ
On Maximum Face-Constrained Coloring of Plane Graphs of Girth at least 5 		PS
2002-44 J. Krajíček
Dehn Function and Length of Proofs 		PS
2002-45 J. Krajíček
Approximate Euler Characteristic, Dimension, and Weak Pigeonhole Principles 		PS
2002-46 Z. Dvořák, J. Kára, D. Kráľ, O. Pangrác
On Pattern Coloring of Cycle Systems 		PS
2002-47 D. Kráľ
A Counter-Example to Voloshin's Hypergraph Co-perfectness Conjecture 		PS
2002-48 D. Kráľ, J. Kratochvíl, A. Proskurowski, H.-J. Voss
Mixed Hypertrees 		PS
2002-49 M. Mareš
Two Linear Time Algorithms for MST on Minor Closed Graph Classes 		PS
2002-50 J. Černý ed.
The Elbe Sandstone Geometry Workshop - Rynartice, Czech Republic, 23-28 July 2001 		PS
2002-51 D. Kráľ
On Feasible Sets of Mixed Hypergraphs 		PS
2002-52 T. Erlebach, J. Fiala
On-line Coloring of Geometric Intersection Graph 		PS
2002-53 J. Adamec, J. Nešetřil
Towards an Aesthetic Invariant for Graph Drawing 		PS
2002-54 M. Klazar, F. Luca
On Some Arithmetic Properties of Polynomial Expressions Involving Stirling Numbers of the Second Kind 		PS
2002-55 J. Fiala, K. Jansen, V. B. Le, E. Seidel
Graph Subcolorings: Complexity and Algorithms 		PS
2002-56 J. Fiala, P. Heggerner, P. Kristiansen, J. A. Telle
Generalized H-coloring and H-covering of Trees 		PS
2002-57 D. Kráľ, H.-J. Voss
Edge-Disjoint Odd Cycles in Planar Graphs 		PS
2002-58 J. Díaz, J. Nešetřil, M. Serna, D. M. Thilikos
H-colorings of Large Degree Graphs 		PS
2002-59 T. Kaiser, M. Klazar
On Growth Rates of Hereditary Permutation Classes 		PS
2002-60 J. Kára, D. Kráľ
Optimal Free Binary Decision Diagrams for Computation of EAR_a 		PS
2002-61 D. Kráľ, V. Majerech, J. Sgall, T. Tichý, G. Woeginger
It Is Tough To Be a Plumber 		PS
2002-62 J. Maxová, J. Nešetřil
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations 		PS
2002-63 J. Maxová, J. Nešetřil
Compatible Decompositions of Eulerian Graphs and Their Transformations 		PS
2002-64 J. J. Montellano-Ballesteros, R. Strausz
A Characterization of Cocircuit Graphs of Uniform Oriented Matroids 		PS
2002-65 J. Bracho, R. Strausz
Separoids and Characterization of Linear Uniform Oriented Matroids 		PS
2002-66 A. Bagchi, A. Chaudhary, P. Kolman, C. Scheideler
Algorithms for Fault-Tolerant Routing in Circuit Switched Network 		PS
2002-67 M. DeVos, J. Nešetřil, A. Raspaud
On Flow and Tension-Continuous Maps 		PS
2002-68 H. Broersma, F. V. Fomin, J. Nešetřil, G. J. Woeginger
More About Subcolorings 		PS
2002-69 T. Tichý
Multiprocessor Randomized On-Line Scheduling 		PS
2002-70 C. Flintoff (ed. J. Nešetřil)
Commencement Address 2002 		PS
2002-71 J. Nešetřil, X. Zhu
On Sparse Graphs with Given Colorings and Homomorphisms 		PS
2002-72 M. Loebl, J. Vondrák
Towards a Theory of Frustrated Degeneracy 		PS
2002-73 S. Garoufalidis, M. Loebl
Random Walks and the Colored Jones Function 		PS
2002-74 M. Kiwi, M. Loebl
Largest Planar Matching in Random Bipartite Graphs 		PS
2002-75 M. Loebl
A Discrete Non-Pfaffian Approach to the Ising Problem 		PS
2002-76 D. Kráľ
An Exact Algorithm for the Channel Assignment Problem 		PS
2002-77 D. Kráľ, T. Madaras, R. Škrekovski
Cyclic, Diagonal and Facial Colorings 		PS
2002-78 M. Klazar
Bell Numbers, Their Relatives, and Algebraic Differential Equations 		PS
2002-79 J. Alber, J. Fiala
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs 		PS
2002-80 J. Fiala, J. Kratochvíl, A. Proskurowski
Systems of Sets and Their Representatives 		PS
2002-81 E. Bampis, M. Caramia, J. Fiala, A. V. Fishkin, A. Iovanella
Scheduling of Independent Dedicated Multiprocessor Tasks 		PS
2002-82 A. Pultr, W. Tholen
Free Quillen Factorization Systems 		PS
2002-83 F. Luca, M. Klazar
On Integrality and Periodicity of the Motzkin Numbers 		PS
2002-84 D. Kráľ, R. Škrekovski
Borodin's Conjecture on Diagonal Coloring is False 		PS
2002-85 A. Pultr, A. Tozzi
Continuous DCPOs as Complete Information Systems 		PS
2002-86 A. Pultr, A. Tozzi
A Monad for Domains and Other Categories 		PS
2002-87 J. Matoušek, J. Vondrák
The Probabilistic Method (Lecture Notes) 		PS
2002-88 J. Sgall
Probabilistic Proofs and NP-completeness (A Course on the PCP Theorem and its Consequences) 		PS
2002-89 J. Nešetřil, P. Ossona de Mendez
Folding 		PS
2002-90 T. Feder, P. Hell, S. Klein, R. Motwani
List Partitions 		PS
2002-91 T. Madaras, R. Škrekovski, H.-J. Voss
The 7-cycle C7 is light in the familty of plannar graphs with minimum degree 5 		PS
2002-92 Z. Dvořák, D. Kráľ, R. Škrekovski
Coloring Face Hypergraphs on Surfaces 		PS
2002-93 Z. Dvořák, J. Kára, D. Kráľ, O. Pangrác
Feasible Sets of Pattern Hypergraphs 		PS
2002-94 M. Loebl
On Ground State Incongruence in Spin Classes 		PS
2002-95 B. Banaschewski, A. Pultr
A General View of Approximation 		PS
2002-96 V. Jungić, J. Licht, M. Mahdian, J. Nešetřil, R. Radoičić
Rainbow Arithmetic Progressions and Anti-Ramsey Results 		PS
2002-97 J. Nešetřil, P. Ossona de Mendez
Cuts and Bounds 		PS
2002-98 R. Šámal
Antisymmetric Flows and Strong Oriented Coloring of Planar Graphs 		PS
2002-99 R. Šámal
Flows and Colorings of Graphs 		PS
2002-100 C. Berge (ed. J. Nešetřil)
Kdo zavraždil vévodu z Densmoru?
2002-101 J. Krajíček
Dual Weak Pigeonhole Principle, Pseudo-Surjective Functions, and Provability of Circuit Lower Bounds 		PS
2002-102 M. Chrobak, J. Sgall
Analysis of the Harmonic Algorithm for Three Servers 		PS
2002-103 J. Fiala, D. Paulusma
The Computational Complexity of the Role Assignment Problem 		PS
2002-104 A Pór, P. Valtr
On the Partitioned Version of the Erdős-Szekeres Theorem 		PS
2002-105 P. Valtr
A Sufficient Condition for the Existence of Large Empty Convex Polygons 		PS
2002-106 D. Piquetová
A Canonical Ramsey-type Theorem for Finite Subsets of N 		PS
2002-107 T. Kaiser, R. Škrekovski
Planar Graph Colorings without Short Monochromatic Cycles 		PS
2002-108 R. Čada, T. Kaiser, M. Rosenfeld, Z. Ryjáček
Hamiltonian Decompositions of Prisms over Cubic Graphs 		PS