My publications as of 20 November 2017. Also available as plain text.

Continuous yao graphs. [Abstract]
, , , , , , , , , and .
Accepted in Computational Geometry, Theory and Applications.
[DOI] [BibTeX]
Linear transformation distance for bichromatic matchings. [Abstract]
, , , , and .
Accepted in Computational Geometry, Theory and Applications. Special Issue in Memoriam: Ferran Hurtado.
[pdf] [arXiv] [BibTeX]
Incremental voronoi diagrams. [Abstract]
, , , and .
Published in Discrete and Computational Geometry.
[BibTeX]
Column planarity and partially-simultaneous geometric embedding. [Abstract]
, , , , , and .
Published in Journal of Graph Algorithms and Applications.
[BibTeX]
Drawing the horton set in an integer grid of minimum size. [Abstract]
, , , and .
Computational Geometry: Theory and Applications, 63:10–19, 2017.
[arXiv] [DOI] [BibTeX]
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. [Abstract]
, , , , , and .
Discrete and Computational Geometry, 2015.
[pdf] [arXiv] [BibTeX]
Asymmetric polygons with maximum area. [Abstract]
, , , , and .
European Journal of Operational Research, 2015.
[arXiv] [BibTeX]
Compatible connectivity-augmentation of planar disconnected graphs. [Abstract]
, , , , , and .
Discrete and Computational Geometry, 2015.
[pdf] [arXiv] [BibTeX]
Space-time trade-offs for stack-based algorithms. [Abstract]
, , , , and .
Algorithmica, 2014.
[pdf] [arXiv] [BibTeX]
Theta-3 is connected. [Abstract]
, , , , , , , and .
Computational Geometry, Theory and Applications, 47(9):910–917, 2014.
[pdf] [arXiv] [BibTeX]
Bichromatic compatible matchings. [Abstract]
, , , and .
Computational Geometry, Theory and Applications, 2014.
[pdf] [arXiv] [BibTeX]
Isoperimetric enclosures. [Abstract]
, , , , and .
Graph and Combinatorics, 31(2):361–392, 2015.
[pdf] [BibTeX]
The Erdös-Sós conjecture for geometric graphs. [Abstract]
, , , , , , and .
Discrete Mathematics and Theoretical Computer Science, 15(1):93–100, July 2012.
[arXiv] [BibTeX]
Computing the visibility polygon using few variables. [Abstract]
, , , and .
Computational Geometry, Theory and Applications, pages 70–79, 2011.
[pdf] [arXiv] [BibTeX]
Sharing a pizza: bisecting masses with two cuts. [Abstract]
and .
In Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG'17. July 2017.
[pdf] [BibTeX]
Subquadratic algorithms for algebraic generalizations of 3SUM. [Abstract]
, , , , , and .
In Proceedings of the 33th Symposium on Computational Geometry. 2017.
[arXiv] [BibTeX]
Dynamic graph coloring. [Abstract]
, , , , , , and .
In Proceedings of the 16th Algorithms and Data Structures Symposium. 2017.
[arXiv] [BibTeX]
Deterministic algorithms for unique sink orientations of grids. [Abstract]
, , , and .
In Proceedings of the 22nd International Computing and Combinatorics Conference. 2016.
[BibTeX]
The farthest-point geodesic voronoi diagram of points on the boundary of a simple polygon. [Abstract]
, , and .
In Proceedings of the 32st Symposium on Computational Geometry. 2016.
[pdf] [BibTeX]
Incremental voronoi diagrams. [Abstract]
, , , and .
In Proceedings of the 32st Symposium on Computational Geometry. 2016.
[BibTeX]
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. [Abstract]
, , , , , and .
In Proceedings of the 31st Symposium on Computational Geometry, volume 34, pages 209–223, 2015.
[pdf] [arXiv] [BibTeX]
Column planarity and partial simultaneous geometric embedding for outerplanar graphs. [Abstract]
, , and .
In Proceedings of the European Workshop on Computational Geometry, EuroCG'15. 2015.
[BibTeX]
Compatible connectivity-augmentation of planar disconnected graphs. [Abstract]
, , , , , and .
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms, pages 1602–1615, 2015.
[pdf] [arXiv] [BibTeX]
Optimal detection of intersections between convex polyhedra. [Abstract]
and .
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms, pages 1641–1654, 2015.
[pdf] [arXiv] [BibTeX]
Drawing the horton set in an integer grid of minimun size. [Abstract]
, , , and .
In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG'14. August 2014.
[pdf] [BibTeX]
Continuous Yao graphs. [Abstract]
, , , , , , , and .
In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG'14. August 2014.
[pdf] [arXiv] [BibTeX]
Linear transformation distance for bichromatic matchings. [Abstract]
, , , , and .
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14, page 154, 2014.
[pdf] [arXiv] [BibTeX]
Weight balancing on boundaries and skeletons. [Abstract]
, , , , , , , , , , , , and .
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14. 2014.
[pdf] [BibTeX]
New and improved spanning ratios for Yao graphs. [Abstract]
, , , , , , , , , and .
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14. 2014.
[pdf] [BibTeX]
Optimal algorithms for constrained 1-center problems. [Abstract]
, , and .
In Proceedings of the 11th Latin American Theoretical INformatics Symposium, LATIN'14, pages (84–95), March 2014.
[pdf] [BibTeX]
Isoperimetric enclosures. [Abstract]
, , , , and .
In Proceedings of the 1st Mexican Conference on Discrete Mathematics and Computational Geometry, MCDMCG'13, pages 47–56, November 2013.
[pdf] [BibTeX]
Theta-3 is connected. [Abstract]
, , , , , , , and .
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 205–210, August 2013.
[pdf] [BibTeX]
Computing covers of plane forests. [Abstract]
, , , and .
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 217–222, August 2013.
[pdf] [BibTeX]
On $k$-enclosing objects in a coloured point set. [Abstract]
, , , , , , , , and .
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 229–234, August 2013.
[pdf] [BibTeX]
On the stretch factor of the theta-4 graph. [Abstract]
, , , , and .
In Proceedings of the 13th Algorithms and Data Structures Symposium, WADS'13, pages 109–120, August 2013.
[pdf] [arXiv] [BibTeX]
Bichromatic compatible matchings. [Abstract]
, , , and .
In Proceedings of the 29th Symposium on Computational Geometry, SoCG'13, pages 267–276, June 2013.
[pdf] [arXiv] [BibTeX]
Space-time trade-offs for stack-based algorithms. [Abstract]
, , , , and .
In Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science, STACS'13, pages 281–292, February-March 2013.
[pdf] [arXiv] [BibTeX]
Circle separability queries in logarithmic time. [Abstract]
, , and .
In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG'12, pages 121–125, August 2012.
[pdf] [BibTeX]
Disk constrained 1-center queries. [Abstract]
.
In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG'12, pages 15–19, August 2012.
[pdf] [BibTeX]
The Erdös-Sós conjecture for geometric graphs. [Abstract]
, , , , , , and .
In Proceedings of the European Workshop on Computational Geometry, EuroCG'12. March 2012.
[pdf] [arXiv] [BibTeX]
Computing the visibility polygon using few variables. [Abstract]
, , , and .
In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11), pages 70–79. Yokohama, Japan, 2011.[pdf] [arXiv] [DOI] [BibTeX]
On edge-disjoint empty triangles of point sets. [Abstract]
, , , and .
In Proceedings of the XIV Spanish Meeting on Computational Geometry, EGC 2011, pages 15–18, July 2011.
[pdf] [BibTeX]
Dynamic circle separability between convex polygons. [Abstract]
and .
In Proceedings of the XIV Spanish Meeting on Computational Geometry, EGC 2011, pages 43–46, June 2011.
[pdf] [BibTeX]
A lower bound for deterministic asynchronous rendez-vous on the line. [Abstract]
, , , , and .
Available in TBD.
[pdf] [BibTeX]
Top-down skiplists. [Abstract]
and .
Available in ArXiv.
[pdf] [arXiv] [BibTeX]
On edge-disjoint empty triangles of point sets. [Abstract]
, , , and .
In Pach, J., editor, Thirty Essays on Geometric Graph Theory, Algorithms and Combinatorics. Springer, 2012.
[pdf] [BibTeX]
On proximity problems in Euclidean spaces.
.
PhD thesis, Universite Libre de Bruxelles and Carelton University, 2016.
[BibTeX]
Problemas de proximidad sobre objetos geométricos en el plano (On proximity problems of geometric objects in the plane).
.
Master's thesis, Universidad Nacional Autónoma de México, 2011.
Supervisor: Jorge Urrutia.
[BibTeX]
Algoritmos de optimización sobre trayectorias monótonas en gráficas coloreadas por aristas (Optimization algorithms on montone paths in edge-colored graphs).
.
Bachelor's thesis, Universidad Nacional Autónoma de México, 2009.
Supervisor: Hortensia Galeana.
[BibTeX]