IUUK-CE-ITI series 2015
2015-620 | David Hartman, Milan Hladík, Jaroslav Horáček, Luc Jaulin, Nacim Ramdani (eds.) SWIM 2015: 8th Small Workshop on Interval Methods | |
2015-621 | Zdeněk Dvořák (ed.) Současné trendy teoretické informatiky | |
2015-622 | Pavel Klavík, Peter Zeman Lineární algebra II: Pokročilé cvičení | |
2015-623 | Jaroslav Nešetřil, Patrice Ossona de Mendez A Distributed Low Tree-Depth Decomposition Algorithm for Bounded Expansion Classes | |
2015-624 | Nathanael Ackerman, Cameron Freer, Jaroslav Nešetřil, Rehana Patel Invariant measures via inverse limits of finite structures | |
2015-625 | Jaroslav Nešetřil, Vojtěch Rödl Statistics of Orderings | |
2015-626 | Jan Hubička, Jaroslav Nešetřil Ramsey classes with forbidden homomorphisms and a closure | |
2015-627 | Petr Pančoška, Lubomír Skála, Jaroslav Nešetřil, Brian I. Carr Validation of common typical time of disease duration for HCC patients using the Fisher information processing of tumor imaging results combined with network phenotyping strategy quantification of individual patient clinical profile patterns | |
2015-628 | Pavel Klavík, Peter Zeman Automorphism Groups of Geometrically Represented Graphs | |
2015-629 | Tomáš Brázdil, Andrew Goodall, Antonín Kučera, Petra Milštainová, Jaroslav Nešetřil, Helena Nešetřilová, Jan Obdržálek (eds.) Highlights of Logic, Games, and Automata 2015 | |
2015-630 | Tomáš Masařík (ed.) DIMACS-DIMATIA International REU Research Experience for Undergraduates 2015 | |
2015-631 | Andrew J. Goodall, Jaroslav Nešetřil, Patrice Ossona de Mendez Strongly Polynomial Sequences as Interpretations | |
2015-632 | Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, Pavel Veselý Colored Bin Packing: Online Algorithms and Lower Bounds | |
2015-633 | Tomáš Gavenčiak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl Cops and Robbers on Intersection Graphs | |
2015-634 | Matt DeVos, Edita Rollová, Robert Šámal A new proof of Seymour's 6-flow theorem | |
2015-635 | Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis Universal completability, least eigenvalue frameworks, and vector colorings |