Publications of Tomáš Valla
- V. Blažej, P. Dvořák, T. Valla:
On Induced Online Ramsey Number of Paths, Cycles, and Trees,
submitted.
- V. Blažej, O. Suchý, T. Valla:
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching (full paper),
submitted.
- P. Dvořák, T. Valla:
Automorphisms of the Cube $n^d$ (full paper),
submitted.
- M. Mareš, T. Valla:
Průvodce labyrintem algoritmů,
CZ.NIC, ISBN: 978-80-88168-19-5 (2017).
- V. Blažej, O. Suchý, T. Valla:
A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching,
In: Blömer J., Kotsireas I., Kutsia T., Simos D. (eds) Mathematical Aspects of
Computer and Information Sciences. MACIS 2017. Lecture Notes in Computer
Science, vol 10693. Springer, Cham.
- F. Cicalese, B. Keszegh, B. Lidický, D. Pálvölgyi, T. Valla:
On the Tree Search Problem with Non-uniform Costs (full paper),
Theoretical Computer Science, Volume 647 (2016), Pages 22–32.
- P. Dvořák, T. Valla:
Automorphisms of the Cube $n^d$,
Computing and Combinatorics,
Volume 9797 of the series Lecture Notes in Computer Science pp 405-416 (2016).
- F. Cicalese, B. Keszegh, B. Lidický, D. Pálvölgyi, T. Valla:
On the Tree Search Problem with Non-uniform Costs,
Proceedings of Graph-Theoretic Concepts in Computer Science - WG 2015,
Lecture Notes in Computer Science 9224 (2016), 90-102.
- P. Dvořák, T. Valla:
On the Computational Complexity and Strategies of Online Ramsey Theory,
Electronic Notes in Discrete Mathematics,
Volume 49, November 2015, pp. 729-736.
- J. Cibulka, P. Gao, M. Krčál, T. Valla, P. Valtr:
Polynomial Bounds on Geometric Ramsey Numbers of Ladder Graphs,
Discrete & Computational Geometry, vol. 53 (2015), Springer, pp. 64-79.
- T. Valla, P. Veselý:
WALTZ: A Strong Tzaar-Playing Program,
Workshop on Computer Games, CGW 2013,
Held in Conjunction with the 23rd International Conference on Artificial Intelligence,
IJCAI 2013, Beijing, China, August 3, 2013, Revised Selected Papers,
Series: Communications in Computer and Information Science, vol. 408 (eds: Cazenave, Winands, Iida),
Springer, ISBN 978-3-319-05427-8, (2014), pp. 81–96.
- J. Cibulka, P. Gao, M. Krčál, T. Valla, P. Valtr:
Polynomial Bounds on Geometric Ramsey Numbers of Ladder Graphs,
(extended abstract),
The Seventh European Conference on Combinatorics, Graph Theory and Applications,
Eurocomb 2013,
Series: Publications of the Scuola Normale Superiore, Vol. 16,
Subseries: CRM Series,
Springer, ISBN 978-88-7642-474-8, pp. 171–176.
- G. Piliouras, T. Valla, L. Végh: LP-based Covering games with low Price of Anarchy,
(full paper), Theory of Computing Systems 2014, Springer US, pp. 1–23.
- A. Ferber, R. Glebov, M. Krivelevich, H. Liu, C. Palmer, T. Valla, M. Vizer:
The biased odd cycle game, Electronic Journal of Combinatorics 20,
Issue 2 (2013).
- R. Šámal, T. Valla: The guarding game is E-complete,
Theoretical Computer Science, Volume 521 (2014), ISSN 0304-3975, pp. 92–106.
- Doctoral thesis Combinatorial Games Theory,
advisor: prof. RNDr. Jaroslav Nešetřil, DrSc.,
defended in August 2012.
- G. Piliouras, T. Valla, L. Végh: LP-based Covering games with low Price of Anarchy,
(extended abstract),
Proceedings of WINE 2012, Lecture Notes in Computer Science 7695 (2012), pp. 184–197.
- R. Šámal, R. Stolař, T. Valla: Complexity of the cop and robber guarding game,
Proceedings of IWOCA 2011, Lecture Notes in Computer Science 7056 (2011), pp. 361–373.
- some chapters in the book Programátorské kuchařky, (eds: Böhm, Lánský, Veselý),
MatfyzPress Praha, 2011, ISBN 978-80-7378-181-1.
- J. Nešetřil, T. Valla: On Ramsey-type Positional Games,
Journal of Graph Theory 64 (2010), Issue 4, pp. 343–354.
- V. Jelínek, J. Kynčl, R. Stolař, T. Valla: Monochromatic triangles in two-colored plane,
Combinatorica 29 (2009), Issue 6, 699–718.
- Z. Dvořák, R. Škrekovski, T. Valla:
Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph,
SIAM Journal on Discrete Mathematics 22 (2008), Issue 2, pp. 568–591.
- Z. Dvořák, R. Škrekovski, T. Valla: Four gravity results,
Discrete Mathematics 307 (2007), Issue 2, pp. 181–190.
- Master thesis Ramsey theory and combinatorial games,
advisor: prof. RNDr. Jaroslav Nešetřil, DrSc.,
defended in May 2006.
- young Czech and Slovak researcher's contest SVOČ 2006: work titled Ramsey theory and combinatorial games,
awarded by 3rd place in category Combinatorics.
- T. Valla, J. Matoušek: Kombinatorika a grafy I., ITI Series (2005).
- D. Král', M. Mareš, T. Valla:
Recepty z programátorské kuchařky Korespondenčního semináře z programování - II. část,
Rozhledy matematicko-fyzikální 80 (2005), Issue 2, pp. 25–35.