ITI series

The ITI Series were founded in 2000. They serve as a prepublication medium for the scientific output of the Institute for Theoretical Computer Science (shortly ITI = Institut Teoreticke Informatiky in Czech). ITI-Series are distributed to all CS departments in the Czech Republic and associated departments abroad. They are available on web as well.

The current editor of ITI Series is Zuzana Safernová. Contributions can be sent to itiserie (at) kam.mff.cuni.cz.

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

Institut teoretické informatiky (ITI) Universita Karlova v Praze	Institute for Theoretical Computer Science Charles University, Prague