Tomás Valla

Orcid: 0000-0003-1228-7160

According to our database1, Tomás Valla authored at least 27 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Romeo and Juliet Is EXPTIME-Complete.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Constant factor approximation for tracking paths and fault tolerant feedback vertex set.
Discret. Optim., February, 2023

Polynomial kernels for tracking shortest paths.
Inf. Process. Lett., 2023

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time.
CoRR, 2023

2022
Efficient attack sequences in m-eternal domination.
CoRR, 2022

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Automorphisms of the cube nd.
Discret. Math., 2021

2019
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

On the m-eternal Domination Number of Cactus Graphs.
Proceedings of the Reachability Problems - 13th International Conference, 2019

On Induced Online Ramsey Number of Paths, Cycles, and Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2017
A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
On the tree search problem with non-uniform costs.
Theor. Comput. Sci., 2016

Automorphisms of the Cube n<sup>d</sup>.
CoRR, 2016

A Simpler Bit-parallel Algorithm for Swap Matching.
CoRR, 2016

Automorphisms of the Cube n^d.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
LP-Based Covering Games with Low Price of Anarchy.
Theory Comput. Syst., 2015

On the Computational Complexity and Strategies of Online Ramsey Theory.
Electron. Notes Discret. Math., 2015

On the Geometric Ramsey Number of Outerplanar Graphs.
Discret. Comput. Geom., 2015

2014
The guarding game is E-complete.
Theor. Comput. Sci., 2014

2013
The Biased Odd Cycle Game.
Electron. J. Comb., 2013

WALTZ: A Strong Tzaar-Playing Program.
Proceedings of the Computer Games - Workshop on Computer Games, 2013

2011
On the complexity of the guarding game
CoRR, 2011

Complexity of the Cop and Robber Guarding Game.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
On Ramsey-type positional games.
J. Graph Theory, 2010

2009
Monochromatic triangles in two-colored plane.
Comb., 2009

2008
Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph.
SIAM J. Discret. Math., 2008

2007
Four gravity results.
Discret. Math., 2007


  Loading...