IUUK-CE-ITI series 2016

2016-636 Dušan Knop, Tomáš Masařík, Veronika Slívová (ed.)
Spring School 2016
PDF
2016-637 Andrew Goodall, Guus Regts, Lluís Vena
Matroid invariants and counting graph homomorphisms
PDF
2016-638 Dušan Knop, Tomáš Masařík
Computational complexity of distance edge labeling
PDF
2016-639 Jan Hubička, Jaroslav Nešetřil
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
PDF
2016-640 Martin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří Sgall, Pavel Veselý
Online Packet Scheduling with Bounded Delay and Lookahead
PDF
2016-641 Jaroslav Nešetřil, Patrice Ossona de Mendez
Towards a Characterization of Universal Categories
PDF
2016-642 Jaroslav Nešetřil, Patrice Ossona de Mendez
Structural Sparsity
PDF
2016-643 Jaroslav Nešetřil, Patrice Ossona de Mendez
Cluster Analysis of Local Convergent Sequences of Structures
PDF
2016-644 Pavel Dvořák, Dušan Knop
Parameterized Complexity of Length-bounded Cuts and Multicuts
2016-645 Pavel Klavík, Dušan Knop, Peter Zeman
Graph Isomorphism Restricted by Lists
2016-646 Jiří Fiala, Tomáš Gavenčiak, Dušan Knop, Martin Koutecký, Jan Kratochvíl
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems