Four gravity results. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (Discret. Math., 2007)

Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (SIAM J. Discret. Math., 2008)

Monochromatic triangles in two-colored plane. - Vít Jelínek; Jan Kyncl; Rudolf Stolar; Tomás Valla (Comb., 2009)

On Ramsey-type positional games. - Jaroslav Nesetril; Tomás Valla (J. Graph Theory, 2010)

Complexity of the Cop and Robber Guarding Game. - Robert Sámal; Rudolf Stolar; Tomás Valla (IWOCA, 2011)

On the complexity of the guarding game - Robert Sámal; Tomás Valla (CoRR, 2011)

WALTZ: A Strong Tzaar-Playing Program. - Tomás Valla; Pavel Veselý 001 (CGW@IJCAI, 2013)

The Biased Odd Cycle Game. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Hong Liu 010; Cory Palmer; Tomás Valla; Máté Vizer (Electron. J. Comb., 2013)

The guarding game is E-complete. - Robert Sámal; Tomás Valla (Theor. Comput. Sci., 2014)

On the Geometric Ramsey Number of Outerplanar Graphs. - Josef Cibulka; Pu Gao; Marek Krcál; Tomás Valla; Pavel Valtr 001 (Discret. Comput. Geom., 2015)

On the Computational Complexity and Strategies of Online Ramsey Theory. - Pavel Dvorák; Tomás Valla (Electron. Notes Discret. Math., 2015)

LP-Based Covering Games with Low Price of Anarchy. - Georgios Piliouras; Tomás Valla; László A. Végh (Theory Comput. Syst., 2015)

Automorphisms of the Cube n^d. - Pavel Dvorák; Tomás Valla (COCOON, 2016)

A Simpler Bit-parallel Algorithm for Swap Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (CoRR, 2016)

Automorphisms of the Cube nd. - Pavel Dvorák; Tomás Valla (CoRR, 2016)

On the tree search problem with non-uniform costs. - Ferdinando Cicalese; Balázs Keszegh; Bernard Lidický; Dömötör Pálvölgyi; Tomás Valla (Theor. Comput. Sci., 2016)

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (MACIS, 2017)

On Induced Online Ramsey Number of Paths, Cycles, and Trees. - Václav Blazej; Pavel Dvorák; Tomás Valla (CSR, 2019)

On the m-eternal Domination Number of Cactus Graphs. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (RP, 2019)

Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem. - Josef Malík; Ondrej Suchý 001; Tomás Valla (SEA², 2019)

Automorphisms of the cube nd. - Pavel Dvorák; Tomás Valla (Discret. Math., 2021)

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Simon Schierreich; Ondrej Suchý 001; Tomás Valla (ESA, 2022)

Efficient attack sequences in m-eternal domination. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (CoRR, 2022)

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (CoRR, 2023)

Polynomial kernels for tracking shortest paths. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Inf. Process. Lett., 2023)

Constant factor approximation for tracking paths and fault tolerant feedback vertex set. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Discret. Optim., 2023)

On Erdős-Szekeres Maker-Breaker games. - Arun Kumar Das 001; Tomás Valla (CCCG, 2024)

Romeo and Juliet Is EXPTIME-Complete. - Harmender Gahlawat; Jan Matyás Kristan; Tomás Valla (MFCS, 2024)

Erdős-Szekeres Maker-Breaker Games. - Aleksa Dzuklevski; Dömötör Pálvölgyi; Alexey Pokrovskiy; Csaba D. Tóth; Tomás Valla; Lander Verlinde (COCOON (1), 2025)