The following pages link to Tomáš Valla (Q306703):
Displaying 23 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- On the computational complexity and strategies of online Ramsey theory (Q322363) (← links)
- The guarding game is E-complete (Q389949) (← links)
- LP-based covering games with low price of anarchy (Q493659) (← links)
- (Q591756) (redirect page) (← links)
- Monochromatic triangles in two-colored plane (Q624214) (← links)
- Four gravity results (Q864159) (← links)
- (Q1953484) (redirect page) (← links)
- The biased odd cycle game (Q1953485) (← links)
- Polynomial kernels for tracking shortest paths (Q2094386) (← links)
- Automorphisms of the cube \(n^d\) (Q2222938) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- On induced online Ramsey number of paths, cycles, and trees (Q2330552) (← links)
- On the \(m\)-eternal domination number of cactus graphs (Q2330587) (← links)
- Automorphisms of the Cube $$n^d$$ (Q2817882) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- On Ramsey-type positional games (Q3057062) (← links)
- Complexity of the Cop and Robber Guarding Game (Q3111664) (← links)
- Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph (Q3629463) (← links)
- A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching (Q4628506) (← links)
- (Q5419961) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5918533) (← links)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set (Q5925624) (← links)
