Tomáš Valla
Czech Technical University in Prague
32 Papers
42 Citations
Tomáš Valla is an academic researcher from Czech Technical University in Prague. The author has contributed to research in topics: Ramsey's theorem & Vertex (geometry). The author has an hindex of 4, co-authored 27 publications.
Chat about Author
Papers
On the Geometric Ramsey Number of Outerplanar Graphs
TL;DR: In this article, the authors proved polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases, and also proved that the geometric Ramsey number of the ladder graph on $2n$ vertices are bounded by O(n^{3})$ and O (n^{10})$ in the convex or general case, respectively.
12
LP-Based Covering Games with Low Price of Anarchy
TL;DR: In this paper, a new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs, were designed.
•Posted Content
LP-based Covering Games with Low Price of Anarchy
TL;DR: A new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs, is designed.
6
LP-Based covering games with low price of anarchy
Georgios Piliouras,Tomáš Valla,László A. Végh +2 more
- 10 Dec 2012
TL;DR: A new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs.
On the m-eternal Domination Number of Cactus Graphs
Václav Blažej,Jan Matyáš Křišt’an,Tomáš Valla +2 more
- 11 Sep 2019
TL;DR: In this article, the m-eternal domination number of cactus graphs is studied and an upper bound on the number of guards required to defend a given cactus graph is given, where each vertex lies in at most two biconnected components.
5