IUUK-CE-ITI series 2003

2003-109 J. Krajíček
Hardness Assumptions in the Foundations of Theoretical Computer Science
PS
2003-110 P. Hell, J. J. Montellano
Polychromatic Cliques
PS
2003-111 T. Kaiser, M. Li, Z. Ryjáček, L. Xiong
Hourglasses and Hamilton Cycles in 4-connected Claw-free Graphs
PS
2003-112 Z. Füredi, A. V. Kostochka, M. Stiebitz, R. Škrekovski, D. B. West
Nordhaus-Gaddum-type Theorems for Decompositions into Many Parts
PS
2003-114 P. Hliněný
Complexity Aspects of Matroid Branch-width
PS
2003-115 V. Jungić, D. Kráĺ, R. Škrekovski
Coloring of Plane Graphs with no Rainbow Faces
PS
2003-116 Z. Dvořák, J. Kára, D. Kráĺ, O. Pangrác
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
PS
2003-117 B. Banaschewski, A. Pultr
On Weak Lattice and Frame Homomorphisms
PS
2003-118 R. Strausz
On Radon's Theorem and Representations of Separoids
PS
2003-119 D. Kráľ
Coloring Powers of Chordal Graphs
PS
2003-120 P. Kolman, J. Matoušek
Crossing Number, Pair-crossing Number, and Expansion
PS
2003-121
Výroční zpráva ITI za rok 2002 / Annual Report of ITI
PS
2003-122 M. Klazar
Irreducible and Connected Permutations
PS
2003-123 R. N. Ball, A. Pultr, J. Sichler
Priestley Configurations and Heyting Varieties
PS
2003-124 R. Barták (ed.)
PLANET Technology Information Day - Prague (Czech Republic), May 26, 2003
PS
2003-125 D. Kráľ (ed.)
Současné trendy teoretické informatiky - 22.-23. května 2003, Praha
PS
2003-126 M. Bodirsky, J. Nešetřil
Constraint Satisfaction with Countable Homogeneous Templates
PS
2003-127 T. Kaiser, D. Kráľ, M. Rosenfeld, Z. Ryjáček, H.-J. Voss
Hamilton Cycles in Prisms over Graphs
PS
2003-128 J. Hubička, J. Nešetřil
Universal Partial Order Represented by Means of Trees and Other Simple Graphs
PS
2003-129 J. Hubička, J. Nešetřil
Finite Paths are Universal
PS
2003-130 T. Łuczak, J. Nešetřil
A Note on Projective Graphs
PS
2003-131 J. Fiala, J. Maxová
Cantor-type Theorem for Locally Constrained Graph Homomorphisms
PS
2003-132 J. Fiala
Introduction to Graph Minors and Treewidth (Lecture notes)
PS
2003-133 P. Gregor
Recursive Fault-Tolerance of Fibonacci Cube in Hypercube
PS
2003-134 P. Holub, T. Kaiser (ed.)
Česko-slovenská konference Grafy 2003 - 2.-6. června 2003, Javorná
PS
2003-135 M. Bálek, J. Nešetřil
Measuring of Aesthetic Invariant of Images
PS
2003-136 D. Kráľ
Locally Satisfable Formulas
PS
2003-137 B. Brešar, S. Klavžar, R. Škrekovski
On Cube-Free Median Graphs
PS
2003-138 P. Hliněný
On High-Degree Crossing-Critical Graphs
PS
2003-139 J. Kratochvíl
Complexity of Hypergraph Coloring and Seidel's Switching
PS
2003-140 H. Broersma, F. V. Fomin, J. Kratochvíl, G. J. Woeginger
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make Things Difficult
PS
2003-141 S. Gravier, R. Škrekovski
Coloring the clique hypergraph of graphs without forbidden structure
PS
2003-142 J. Krajíček
Implicit Proofs
PS
2003-143 V. Jungić, R. Radoičić
Rainbow Arithmetic Progressions
PS
2003-144 V. Douchová (ed.)
Eurocomb 2003 Programme
2003-145 J. Fiala (ed.)
Eurocomb 2003 Abstracts
PS
2003-146 T. Kaiser, D. Kráľ, R. Škrekovski
A Revival of the Girth Conjecture
PS
2003-147 M. Stiebitz, R. Škrekovski
A Map Colour Theorem for the Union of Graphs
PS
2003-148 D. Kráľ, L. Stacho
Closure for the Property of Having a Hamiltonian Prism
PS
2003-149 D. Kráľ
Extending partial 5-colorings and 6-colorings in planar graphs
PS
2003-150 J. Matoušek
Introduction to Discrete Geometry
PS
2003-151 T. Luczak, J. Nešetřil
When is a random graph projective?
PDF
2003-152 T. Luczak, J. Nešetřil
A Probabilistic Approach to the Dychotomy Problem
PS
2003-153 R. Barták, R. Erben
Singleton Arc Consistency Revised
PS
2003-154 M. Loebl, J. Matoušek, O. Pangrác
Triangles in Random Graphs
PS
2003-155 E. Flandrin, T. Kaiser, R. Kužel, H. Li, and Z. Ryjáček
Neighborhood unions and extremal spanning trees
PS
2003-156 D. Král', J. Sgall
Coloring graphs from lists with bounded size of their union
PS
2003-157 W. Hochstättler, J. Nešetřil
Antisymmetric Flows in Matroids
PS
2003-158 J. Nešetřil, O. Serra
The Erdös-Turán Property for a Class of Bases
PS
2003-159 J. Nešetřil
Ramsey Classes and Homogeneous Structures
PS
2003-160 D. Král'
Mixed hypergraphs and other coloring problems
PS
2003-161 M. Klazar
On the least exponential growth admitting uncountably many closed permutation classes
PS
2003-162 T. Madaras, R. Škrekovski
Lightness, heaviness and gravity
PS
2003-163 T. Kaiser, M. Kriesell
A note on the pancyclicity of lexicographic products
PS
2003-164 Z. Dvořák, T. Kaiser, D. Král'
Eulerian colorings and the bipartizing matchings conjecture of Fleischner
PS
2003-165 J. Fiala, D. Král', R. Škrekovski
A Brooks-type theorem for the generalized list T-coloring
PS
2003-166 D. Král'
Group coloring is $\Pi_2^P$-complete
PS
2003-167 M. Kiwi, M. Loebl, J. Matoušek
Expected length of the longest common subsequence for large alphabet
PS
2003-168 M. Loebl
Ground state incongruence in 2D spin glasses revisited
PS
2003-169 E. Jeřábek
A note on Grzegorczyk's logic
PS
2003-170 R. N. Ball, A. Pultr, J. Sichler
Configurations in coproducts of Priestley spaces
PS
2003-171 T. Ebenlendr, J. Sgall
Optimal and online preemptive scheduling on uniformly related machines
PS
2003-172 Y. Bartal, F.Y.L. Chin, M. Chrobak, S.P.Y. Fung, W. Jawor, R. Lavi, J. Sgall, T. Tichý
On-line competitive algorithms for maximizing weighted throughput of unit jobs
PS
2003-173 J. Nešetřil, A. Pultr, C. Tardif
Gaps and dualities in Heyting categories
PS
2003-174 B. Gärtner, J. Solymosi, F. Tschirschnitz, P. Valtr, E. Welzl
One line and n points
PS