Bichromatic Quadrangulations with Steiner Points. - Victor Alvarez 001; Toshinori Sakai; Jorge Urrutia (Graphs Comb., 2007)

Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. - Victor Alvarez 001; Raimund Seidel (Comput. Geom., 2010)

Can Nearest Neighbor Searching Be Simple and Always Fast? - Victor Alvarez 001; David G. Kirkpatrick; Raimund Seidel (ESA, 2011)

Counting crossing-free structures. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (SCG, 2012)

Colored Quadrangulations with Steiner Points. - Victor Alvarez 001; Atsuhiro Nakamoto (TJJCCGG, 2012)

Counting Triangulations Approximately. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray; Raimund Seidel (CCCG, 2013)

Privacy by Fake Data: A Geometric Approach. - Victor Alvarez 001; Erin W. Chambers; László Kozma 002 (CCCG, 2013)

A simple aggregative algorithm for counting triangulations of planar point sets and related problems. - Victor Alvarez 001; Raimund Seidel (SoCG, 2013)

A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray (CoRR, 2013)

Main memory adaptive indexing for multi-core systems. - Victor Alvarez 001; Felix Martin Schuhknecht; Jens Dittrich; Stefan Richter 007 (DaMoN, 2014)

A comparison of adaptive radix trees and hash tables. - Victor Alvarez 001; Stefan Richter 007; Xiao Chen; Jens Dittrich (ICDE, 2015)

Counting triangulations and other crossing-free structures approximately. - Victor Alvarez 001; Karl Bringmann; Saurabh Ray; Raimund Seidel (Comput. Geom., 2015)

Counting Triangulations and Other Crossing-Free Structures via Onion Layers. - Victor Alvarez 001; Karl Bringmann; Radu Curticapean; Saurabh Ray (Discret. Comput. Geom., 2015)

Parity-Constrained Triangulations with Steiner Points. - Victor Alvarez 001 (Graphs Comb., 2015)

A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing. - Stefan Richter 007; Victor Alvarez 001; Jens Dittrich (Proc. VLDB Endow., 2015)

An Improved Lower Bound on the Minimum Number of Triangulations. - Oswin Aichholzer; Victor Alvarez 001; Thomas Hackl; Alexander Pilz; Bettina Speckmann; Birgit Vogtenhuber (SoCG, 2016)

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SODA, 2017)

Conflict-Free Coloring of Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SIAM J. Discret. Math., 2018)