|
Education
· PhD in Computer Science, Universidad Nacional Autónoma de México, México 2011.
· MSc in Computer Science, Universidad Nacional Autónoma de México, México 2007.
· BSc in Computer Science, Universidad Nacional Autónoma de México, México 2004.
|
Research Interests
His major research interests are combinatorial and computational geometry; analysis of algorithms.
Keywords: combinatorial geometry, computational geometry, algorithms.
Selected Publications
1. S. Bereg, J. Díaz-Báñez, D. Lara, P. Pérez-Lantero, C. Seara, J. Urrutia. On the Coarness of Bicolored Point Sets, Computational Geometry: Theory and Applications, (2013), pp. 65-77.
2. Luis F. Barba, R. Fabila-Monroy, Dolores Lara, Jesús Leaños, Cynthia Rodríguez, Gelasio Salazar, Francisco Zaragoza. The Erd?s-Sós Conjecture for Geometric Graphs, Discrete Mathematics and Theoretical Computer.
3. D. Lara, C. Rubio-Montiel. On crossing families of complete geometric graphs, Acta Mathematica Hungarica (2018).
4.R. Fabila-Monroy, C. Toscano, C. Huemer, D. Lara, D.Mitsche. Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity, Lecture Notes in Computer Science. International Symposium on Graph Drawing and Network Visualization, 2018.
5. O. Aichholzer, G. Araujo-Pardo, N. García-Colín, T. Hackl, D. Lara, C. Rubio-Montiel, J. Urrutia. Geometric Achromatic and Pseudoachromatic Indices, Graphs and Combinatorics, 32(2016), pp. 431-451.
|
|
cs.cinvestav.mx 
