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