Follow
David Flores-Peñaloza
Title
Cited by
Cited by
Year
Token graphs
R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ...
Graphs and Combinatorics 28, 365-380, 2012
832012
Edge-removal and non-crossing configurations in geometric graphs
O Aichholzer, S Cabello, R Fabila-Monroy, D Flores-Penaloza, T Hackl, ...
Discrete Mathematics & Theoretical Computer Science 12 (Graph and Algorithms), 2010
452010
Modem illumination of monotone polygons
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, J Urrutia, ...
Computational Geometry 68, 101-118, 2018
402018
Empty monochromatic triangles
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ...
Computational Geometry 42 (9), 934-938, 2009
332009
On the chromatic number of some flip graphs
R Fabila-Monroy, D Flores-Penaloza, C Huemer, F Hurtado, J Urrutia, ...
Discrete Mathematics & Theoretical Computer Science 11 (Graph and Algorithms), 2009
212009
The topology of look-compute-move robot wait-free algorithms with hard termination
M Alcantara, A Castañeda, D Flores-Peñaloza, S Rajsbaum
Distributed Computing 32, 235-255, 2019
172019
On maximum-sum matchings of points
S Bereg, OP Chacón-Rivera, D Flores-Peñaloza, C Huemer, ...
Journal of Global Optimization 85 (1), 111-128, 2023
132023
On crossing numbers of geometric proximity graphs
BM Abrego, R Fabila-Monroy, S Fernández-Merchant, D Flores-Penaloza, ...
Computational Geometry 44 (4), 216-233, 2011
122011
Computing balanced islands in two colored point sets in the plane
O Aichholzer, N Atienza, JM Díaz-Báñez, R Fabila-Monroy, ...
Information Processing Letters 135, 28-32, 2018
82018
Embedding the double circle in a square grid of minimum size
S Bereg, R Fabila-Monroy, D Flores-Peñaloza, MA López, ...
International Journal of Computational Geometry & Applications 24 (03), 247-258, 2014
82014
On the connectedness and diameter of a geometric Johnson graph
C Bautista-Santiago, J Cano, R Fabila-Monroy, D Flores-Peñaloza, ...
Discrete Mathematics & Theoretical Computer Science 15 (Combinatorics), 2013
72013
Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice.
D Flores-Peñaloza, FJZ Martinez
CCCG, 91-94, 2009
72009
Proximity graphs inside large weighted graphs
BM Ábrego, R Fabila‐Monroy, S Fernández‐Merchant, ...
Networks 61 (1), 29-39, 2013
52013
Drawing the double circle on a grid of minimum size
S Bereg, R Fabila-Monroy, D Flores-Peñaloza, M Lopez, P Pérez-Lantero
arXiv preprint arXiv:1305.6693, 2013
32013
Min-energy broadcast in mobile ad hoc networks with restricted motion
JM Díaz-Báñez, R Fabila-Monroy, D Flores-Peñaloza, MA Heredia, ...
Journal of combinatorial optimization 24, 413-426, 2012
32012
Matching random colored points with rectangles
J Corujo, D Flores-Peñaloza, C Huemer, P Pérez-Lantero, C Seara
Journal of Combinatorial Optimization 45 (2), 81, 2023
22023
Rainbow polygons for colored point sets in the plane
D Flores-Peñaloza, M Kano, L Martínez-Sandoval, D Orden, J Tejel, ...
Discrete Mathematics 344 (7), 112406, 2021
22021
Covering moving points with anchored disks
C Bautista-Santiago, JM Díaz-Báñez, R Fabila-Monroy, ...
European journal of operational research 216 (2), 278-285, 2012
12012
On polynomials associated to Voronoi diagrams of point sets and crossing numbers
M Claverol, A de las Heras-Parrilla, D Flores-Peñaloza, C Huemer, ...
Discrete Mathematics & Theoretical Computer Science 26 (Combinatorics), 2024
2024
Rainbow ortho-convex 4-sets in k-colored point sets
D Flores-Peñaloza, MA Lopez, N Marín, D Orden
arXiv preprint arXiv:2404.06376, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20