default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Alvarez 0001
Person information
- affiliation: Huawei Technologies, Munich Research Center, Germany
- affiliation: TU Braunschweig, Department of Computer Science, Germany
- affiliation: Saarland University, Department of Computer Science
Other persons with the same name
- Víctor Álvarez (aka: Victor Alvarez) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j7]Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete
, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer:
Conflict-Free Coloring of Graphs. SIAM J. Discret. Math. 32(4): 2675-2702 (2018)- 2015
- [j6]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5): 386-397 (2015) - [j5]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53(4): 675-690 (2015) - [j4]Victor Alvarez:
Parity-Constrained Triangulations with Steiner Points. Graphs Comb. 31(1): 35-57 (2015) - [j3]Stefan Richter, Victor Alvarez, Jens Dittrich:
A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing. Proc. VLDB Endow. 9(3): 96-107 (2015) - 2010
- [j2]Victor Alvarez, Raimund Seidel:
Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric. Comput. Geom. 43(2): 94-98 (2010) - 2007
- [j1]Victor Alvarez, Toshinori Sakai, Jorge Urrutia:
Bichromatic Quadrangulations with Steiner Points. Graphs Comb. 23(Supplement-1): 85-98 (2007)
Conference and Workshop Papers
- 2017
- [c10]Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer:
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. SODA 2017: 1951-1963 - 2016
- [c9]Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, Birgit Vogtenhuber:
An Improved Lower Bound on the Minimum Number of Triangulations. SoCG 2016: 7:1-7:16 - 2015
- [c8]Victor Alvarez, Stefan Richter, Xiao Chen, Jens Dittrich:
A comparison of adaptive radix trees and hash tables. ICDE 2015: 1227-1238 - 2014
- [c7]Victor Alvarez, Felix Martin Schuhknecht, Jens Dittrich, Stefan Richter:
Main memory adaptive indexing for multi-core systems. DaMoN 2014: 3:1-3:10 - 2013
- [c6]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations Approximately. CCCG 2013 - [c5]Victor Alvarez, Erin W. Chambers, László Kozma:
Privacy by Fake Data: A Geometric Approach. CCCG 2013 - [c4]Victor Alvarez, Raimund Seidel:
A simple aggregative algorithm for counting triangulations of planar point sets and related problems. SoCG 2013: 1-8 - 2012
- [c3]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting crossing-free structures. SCG 2012: 61-68 - [c2]Victor Alvarez, Atsuhiro Nakamoto:
Colored Quadrangulations with Steiner Points. TJJCCGG 2012: 20-29 - 2011
- [c1]Victor Alvarez, David G. Kirkpatrick, Raimund Seidel:
Can Nearest Neighbor Searching Be Simple and Always Fast? ESA 2011: 82-92
Informal and Other Publications
- 2017
- [i5]Zachary Abel, Victor Alvarez, Aman Gour, Adam Hesterberg, Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. CoRR abs/1701.05999 (2017) - 2014
- [i4]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR abs/1404.0261 (2014) - [i3]Victor Alvarez, Felix Martin Schuhknecht, Jens Dittrich, Stefan Richter:
Main Memory Adaptive Indexing for Multi-core Systems. CoRR abs/1404.2034 (2014) - 2013
- [i2]Victor Alvarez, Karl Bringmann, Saurabh Ray:
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. CoRR abs/1312.3188 (2013) - [i1]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR abs/1312.4628 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 20:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
