Drawing the Horton Set in an Integer Grid of Minimun Size. - Luis Barba; Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (CCCG, 2014)

An Upper Bound on the k-Modem Illumination Problem. - Frank Duque; Carlos Hidalgo-Toscano (Int. J. Comput. Geom. Appl., 2015)

Updating the Number of Crossings of Complete Geometric Graphs. - Frank Duque; Ruy Fabila Monroy (CoRR, 2016)

Drawing the Horton set in an integer grid of minimum size. - Luis Barba; Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (Comput. Geom., 2017)

Drawing the almost convex set in an integer grid of minimum size. - Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Pablo Pérez-Lantero (Comput. Geom., 2017)

The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph. - Frank Duque; Hernán González-Aguilar; César Hernández-Vélez; Jesús Leaños; Carolina Medina (Electron. J. Comb., 2018)

Point Sets with Small Integer Coordinates and No Large Convex Polygons. - Frank Duque; Ruy Fabila Monroy; Carlos Hidalgo-Toscano (Discret. Comput. Geom., 2018)

On optimal coverage of a tree with multiple robots. - Israel Aldana-Galván; Juan C. Catana-Salazar; José Miguel Díaz-Báñez; Frank Duque; Ruy Fabila Monroy; Marco A. Heredia; Adriana Ramírez-Vigueras; Jorge Urrutia (Eur. J. Oper. Res., 2020)

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. - Oswin Aichholzer; Frank Duque; Ruy Fabila Monroy; Oscar E. García-Quintero; Carlos Hidalgo-Toscano (J. Graph Algorithms Appl., 2020)

Counting the number of crossings in geometric graphs. - Frank Duque; Ruy Fabila Monroy; César Hernández-Vélez; Carlos Hidalgo-Toscano (Inf. Process. Lett., 2021)

Anacondensed hexagonal systems. - Roberto Cruz; Frank Duque; Juan Rada (Appl. Math. Comput., 2022)

Computing k-Crossing Visibility through k-levels. - Frank Duque (CoRR, 2023)