Victor Alvarez

Affiliations:
  • Huawei Technologies, Munich Research Center, Germany
  • TU Braunschweig, Department of Computer Science, Germany
  • Saarland University, Department of Computer Science


According to our database1, Victor Alvarez authored at least 18 papers between 2007 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math., 2018

2017
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing.
Proc. VLDB Endow., 2015

Parity-Constrained Triangulations with Steiner Points.
Graphs Comb., 2015

Counting Triangulations and Other Crossing-Free Structures via Onion Layers.
Discret. Comput. Geom., 2015

Counting triangulations and other crossing-free structures approximately.
Comput. Geom., 2015

A comparison of adaptive radix trees and hash tables.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2014
Main memory adaptive indexing for multi-core systems.
Proceedings of the Tenth International Workshop on Data Management on New Hardware, 2014

2013
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations.
CoRR, 2013

A simple aggregative algorithm for counting triangulations of planar point sets and related problems.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Privacy by Fake Data: A Geometric Approach.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Counting Triangulations Approximately.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Colored Quadrangulations with Steiner Points.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Counting crossing-free structures.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Can Nearest Neighbor Searching Be Simple and Always Fast?
Proceedings of the Algorithms - ESA 2011, 2011

2010
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric.
Comput. Geom., 2010

2007
Bichromatic Quadrangulations with Steiner Points.
Graphs Comb., 2007


  Loading...