V
Victor Alvarez
Researcher at Braunschweig University of Technology
Publications - 7
Citations - 131
Victor Alvarez is an academic researcher from Braunschweig University of Technology. The author has contributed to research in topics: Planar graph & Vertex (geometry). The author has an hindex of 6, co-authored 7 publications receiving 107 citations.
Papers
More filters
Journal ArticleDOI
A seven-dimensional analysis of hashing methods and its implications on query processing
TL;DR: It is shown that a right or wrong decision in picking the right hashing scheme and hash function combination may lead to significant difference in performance, and that hashing should be considered a white box before blindly using it in applications, such as query processing.
Proceedings ArticleDOI
Conflict-Free Coloring of Planar Graphs
Zachary Abel,Victor Alvarez,Aman Gour,Adam Hesterberg,Erik D. Demaine,Sándor P. Fekete,Phillip Keldenich,Christian Scheffer +7 more
TL;DR: In this article, the authors studied the conflict-free chromatic number chi_CF(G) (the smallest k for which conflict free k-coloring exists) and showed that the problem is NP-complete for planar graphs, but polynomial for outerplanar graphs.
Journal ArticleDOI
Conflict-Free Coloring of Graphs
Zachary Abel,Victor Alvarez,Erik D. Demaine,Sándor P. Fekete,Aman Gour,Adam Hesterberg,Phillip Keldenich,Christian Scheffer +7 more
TL;DR: A conflict-free $k-coloring of a graph assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v...
Proceedings ArticleDOI
Three colors suffice: conflict-free coloring of planar graphs
Zachary Abel,Victor Alvarez,Erik D. Demaine,Sándor P. Fekete,Aman Gour,Adam Hesterberg,Phillip Keldenich,Christian Scheffer +7 more
TL;DR: In this paper, the authors studied the conflict-free chromatic number χCF(G) (the smallest k for which conflictfree k-colorings exist), with a focus on planar graphs.
Proceedings ArticleDOI
An improved lower bound on the minimum number of triangulations
Oswin Aichholzer,Victor Alvarez,Thomas Hackl,Alexander Pilz,Bettina Speckmann,Birgit Vogtenhuber +5 more
TL;DR: This paper proves that any set of n points in general position in the plane has at least Omega(2.631^n) geometric triangulations, and provides tight lower bounds for the number of triangulation of point sets with up to 15 points, which further support the double circle conjecture.