IUUK-CE-ITI series 2005
| 2005-235 | Z.Dvořák, R.Škrekovski A theorem about a contractible and light edge | |
| 2005-236 | D.Kráľ, R.Škrekovski, M.Tancer Construction of large graphs with no optimal surjective L(2,1)-labeling | |
| 2005-237 | P. Horák, T. Kaiser, M. Rosenfeld, and Z. Ryjáček The prism over the middle-levels graph is hamiltonian | |
| 2005-238 | D. Kráľ, J. Sgall, and T. Tichý Randomized strategies for the plurality problem | |
| 2005-239 | J. Fiala, P. Golovach, and J. Kratochvíl Distance constrained labelings of graphs of bounded treewidth | |
| 2005-240 | M. Bodirsky, D. Kráľ Locally consistent constraint satisfaction problems with binary constraints | |
| 2005-241 | D. Kráľ, L.-D. Tong, X. Zhu Upper Hamiltonian numbers and Hamiltonian spectra of graphs | |
| 2005-242 | J. Nešetřil, R. Šámal Tension continuous maps - their structure and applications | |
| 2005-243 | Z. Dvořák, D. Kráľ, P. Nejedlý, R. Škrekovski Coloring squares of planar graphs with no short cycles | |
| 2005-244 | M. Bodirsky, J. Nešetřil Constraint satisfaction with countable homogeneous templates | |
| 2005-245 | P. Pudlák On explicit Ramsey graphs and estimates of the number of sums and products | |
| 2005-246 | D. Kráľ (ed.) Soucasne trendy teoreticke informatiky | |
| 2005-247 | J. Nešetřil, I. Švejdarová Diameters of duals are linear | |
| 2005-248 | D. Piguet, M. Stein The Loebl conjecture for trees of small diameter | |
| 2005-249 | M. Klazar, F. Luca On the maximal order of numbers in the factorisatio numerorum problem | |
| 2005-250 | T. Chudlarský (ed.) First Czech-Catalan Conference in Mathematics | |
| 2005-251 | M. Klazar On identities concerning the number of crossings and nestings of two edges in matchings | |
| 2005-252 | M. Ghebleh, D. Kráľ, S. Norine, R. Thomas The circular chromatic index of the flower snarks | |
| 2005-253 | J. Nešetřil, P. Ossona de Mendez The grad of a graph and classes with bounded expansion | |
| 2005-254 | V. Janota (ed.) XML Prague - a conference on XML | |
| 2005-255 | Z. Dvořák, R. Škrekovski, M. Tancer List-colouring squares of sparse subcubic graphs | |
| 2005-256 | R. N. Ball, A. Pultr, P. Vojtěchovský Colored graphs without colorful cycles | |
| 2005-257 | J. Kára, J. Kratochvíl, D. R. Wood On the complexity of the balanced vertex ordering problem | |
| 2005-258 | J. Fiala, J. Kratochvíl On the computational complexity of the L(2,1)-labeling problem for regular graphs | |
| 2005-259 | J. Fiala, J. Kratochvíl, A. Pór On the computational complexity of partial covers of Theta graphs | |
| 2005-260 | T. Valla, J. Matoušek Kombinatorika a grafy I. | |
| 2005-261 | B. M. Landman, M. B. Nathanson, J. Nešetřil, C. Pomerance Topics in Combinatorial Number Theory, proceedings of the INTEGERS conference 2003 in honor of Tom Brown | |
| 2005-262 | J. Nešetřil, P. Ossona de Mendez Grad and Classes with Bounded Expansion I. Decompositions | |
| 2005-263 | J. Nešetřil, P. Ossona de Mendez Grad and Classes with Bounded Expansion II. Algorithmic Aspects | |
| 2005-264 | J. Nešetřil, P. Ossona de Mendez Grad and Classes with Bounded Expansion III. Restricted Graph Homomorphism Dualities | |
| 2005-265 | S. Norine, R. Thomas Pfaffian labelings and signs of edge colorings | |
| 2005-266 | S. Norine, R. Thomas Minimal bricks | |
| 2005-267 | M. Bodirsky, J. Kára The complexity of equality constraint languages | |
| 2005-268 | R. Naserasr, Y. Nigussie, R. Škrekovski Homomorphisms of triangle-free graphs without a K[5]-minor | |
| 2005-269 | T. Kaiser A note on interconnecting matchings in graphs | |
| 2005-270 | T. Kaiser Disjoint T-paths in tough graphs | |
| 2005-271 | J. Černý A simple proof for open cups and caps | |
| 2005-272 | T. Kaiser, D. Kráľ, L. Stacho Tough spiders | |
| 2005-273 | T. Kaiser, R. Škrekovski T-joins intersecting small edge-cuts in graphs | |
| 2005-274 | P. Bella, D. Kráľ, B. Mohar, K. Quittnerová Labeling planar graphs with a condition at distance two |
