IUUK-CE-ITI series 2011

2011-518 Zdeněk Dvořák
3-choosability of planar graphs wi(<=4)-cycles far apart
PDF
2011-519 Jiří Kosek
XML Prague 2011 - Conference Proceedings
PDF
2011-520 Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander Razborov
On the Number of Pentagons in Triangle-Free Graphs
PDF
2011-521 Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski
Graphs with two crossings are 5-choosable
PDF
2011-522 Daniel Král', Matjaž Krnc, Martin Kupec, Borut Lužar, Jan Volec
Extending fractional precolorings
PDF
2011-523 Julia Böttcher, Jan Foniok
Ramsey Properties of Permutations
PDF
2011-524 Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander Razborov
Non-three-colorable common graphs exist
PDF
2011-525
10th Workshop on Models and Algorithms for Planning and Scheduling Problems
PDF
2011-526 Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski
Bipartizing fullernes
PDF
2011-527 Zdeněk Dvořák (ed.)
Současné trendy teoretické informatiky
PDF
2011-528 Jan Ekstein, Přemysl Holub, Bernard Lidický
Packing Chromatic Number of Distance Graphs
PDF
2011-529 Bernhard Banaschewski, Aleš Pultr
Completion and Samuel compactification of nearness and uniform frames
PDF
2011-530 Zdeněk Dvořák, Daniel Král'
Classes of graphs with small rank decompositions are chi-bounded
PDF
2011-531 Daniel Král', Lukáš Mach, Jean-Sebastien Sereni
A new lower bound based on Gromov's method of selecting heavily covered points
PDF
2011-532 J. Nešetřil, P. Ossona de Mendez, X. Zhu
Colouring Edges with many Colours in Cycles
PDF
2011-533 Daniel Král', Jean-Sebastien Sereni, Ladislav Stacho
Min-max relations for odd cycles in planar graphs
PDF
2011-534 Amos Korman, Jean-Sebastien Sereni, Laurent Viennot
Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge
PDF
2011-535 Tomáš Gavenčiak, Daniel Král', Sang-il Oum
Deciding First Order Logic Properties of Matroids
PDF
2011-536 František Kardoš, Daniel Král', Jan Volec
Maximum edge-cuts in~cubic graphs with large girth and in~random cubic graphs
PDF
2011-537 Pavel Surynek
Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup
PDF
2011-538 Martin Tancer
d-representability of simplicial complexes of fixed dimension
PDF
2011-539 Martin Tancer
Intersection patterns of convex sets via simplicial complexes, a survey
PDF
2011-540 Martin Tancer
Strong d-collapsibility
PDF
2011-541 Jaroslav Nešetřil
Několik poznámek o teoretické informatice
PDF
2011-542 Richard N. Ball, Aleš Pultr
Distributivity of the Normal Completion, and its Priestley Representation
PDF
2011-543 Pavel Surynek, Petr Michalík
An Improved Sub-optimal Algorithm for Solving (N^2-1)-Puzzle
PDF
2011-544 Zdeněk Dvořák
Constant-factor approximation of domination number in sparse graphs
PDF
2011-545 Jan Foniok
On Ramsey properties of classes with forbidden trees
PDF
2011-546 Delia Garijo, Andrew Goodall, Jaroslav Nešetřil
Contractors for flows
PDF
2011-547 Delia Garijo, Andrew Goodall, Jaroslav Nešetřil
On the number of B-flows of a graph
PDF