| On the tree search problem with non-uniform costs F Cicalese, B Keszegh, B Lidický, D Pálvölgyi, T Valla Theoretical Computer Science 647, 22-32, 2016 | 16 | 2016 |
| Planar graphs of odd-girth at least 9 are homomorphic to the Petersen graph Z Dvořák, R Škrekovski, T Valla SIAM Journal on Discrete Mathematics 22 (2), 568-591, 2008 | 16 | 2008 |
| Monochromatic triangles in two-colored plane V Jelínek, J Kynčl, R Stolař, T Valla Combinatorica 29 (6), 699-718, 2009 | 12 | 2009 |
| On the geometric Ramsey number of outerplanar graphs J Cibulka, P Gao, M Krčál, T Valla, P Valtr Discrete & Computational Geometry 53 (1), 64-79, 2015 | 10 | 2015 |
| Complexity of the cop and robber guarding game R Šámal, R Stolař, T Valla International Workshop on Combinatorial Algorithms, 361-373, 2011 | 8 | 2011 |
| Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set V Blažej, P Choudhary, D Knop, JM Křišt’an, O Suchý, T Valla International Workshop on Approximation and Online Algorithms, 23-38, 2021 | 6 | 2021 |
| On the m-eternal domination number of cactus graphs V Blažej, JM Křišt’an, T Valla International Conference on Reachability Problems, 33-47, 2019 | 6 | 2019 |
| On Induced Online Ramsey Number of Paths, Cycles, and Trees V Blažej, P Dvořák, T Valla International Computer Science Symposium in Russia, 60-69, 2019 | 6 | 2019 |
| LP-based covering games with low price of anarchy G Piliouras, T Valla, LA Végh Theory of Computing Systems 57 (1), 238-260, 2015 | 4 | 2015 |
| The guarding game is E-complete R Šámal, T Valla Theoretical Computer Science 521, 92-106, 2014 | 3 | 2014 |
| Polynomial kernels for tracking shortest paths V Blažej, P Choudhary, D Knop, JM Křišťan, O Suchý, T Valla Information Processing Letters 179, 106315, 2023 | 2 | 2023 |
| Efficient implementation of color coding algorithm for subgraph isomorphism problem J Malík, O Suchý, T Valla International Symposium on Experimental Algorithms, 283-299, 2019 | 2 | 2019 |
| The biased odd cycle game A Ferber, R Glebov, M Krivelevich, H Liu, C Palmer, T Valla, M Vizer the electronic journal of combinatorics 20 (2), P9, 2013 | 2 | 2013 |
| Polynomial bounds on geometric Ramsey numbers of ladder graphs J Cibulka, P Gao, M Krčál, T Valla, P Valtr The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | 2 | 2013 |
| On Ramsey‐type positional games J Nešetřil, T Valla Journal of Graph Theory 64 (4), 343-354, 2010 | 2 | 2010 |
| Automorphisms of the Cube nd P Dvořák, T Valla Discrete Mathematics 344 (3), 112234, 2021 | 1 | 2021 |
| On the Computational Complexity and Strategies of Online Ramsey Theory P Dvořák, T Valla Electronic Notes in Discrete Mathematics 49, 729-736, 2015 | 1 | 2015 |
| WALTZ: a strong Tzaar-playing program T Valla, P Veselý Computer Games, 81-96, 2014 | 1 | 2014 |
| A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching V Blažej, O Suchý, T Valla International Conference on Mathematical Aspects of Computer and Information …, 2017 | | 2017 |
| On the Tree Search Problem with Non-uniform Costs D Pálvölgyi, T Valla Graph-Theoretic Concepts in Computer Science: 41st International Workshop …, 2016 | | 2016 |
