David Flores-Peñaloza
TítuloCitado porAño
Edge-removal and non-crossing configurations in geometric graphs
O Aichholzer, S Cabello, R Fabila Monroy, D Flores Peñaloza, T Hackl, ...
Discrete mathematics and theoretical computer science 12 (1), 75-86, 2010
372010
Modem illumination of monotone polygons
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, J Urrutia, ...
Computational Geometry 68, 101-118, 2018
332018
Token graphs
R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ...
Graphs and Combinatorics 28 (3), 365-380, 2012
292012
Empty monochromatic triangles
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ...
Computational geometry 42 (9), 934-938, 2009
202009
On crossing numbers of geometric proximity graphs
BM Ábrego, R Fabila-Monroy, S Fernández-Merchant, D Flores-Penaloza, ...
Computational Geometry 44 (4), 216-233, 2011
92011
On the chromatic number of some flip graphs
R Fabila-Monroy, D Flores-Penaloza, C Huemer, F Hurtado, J Urrutia, ...
92009
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
72014
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
On the connectedness and diameter of a geometric Johnson graph
C Bautista-Santiago, J Cano, R Fabila-Monroy, D Flores-Peñaloza, ...
arXiv preprint arXiv:1202.3455, 2012
52012
Balanced islands in two colored point sets in the plane
O Aichholzer, N Atienza, R Fabila-Monroy, P Perez-Lantero, ...
arXiv preprint arXiv:1510.01819, 2015
32015
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 (4), 413-426, 2012
32012
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
22013
Proximity graphs inside large weighted graphs
BM Ábrego, R Fabila‐Monroy, S Fernández‐Merchant, ...
Networks 61 (1), 29-39, 2013
22013
The topology of look-compute-move robot wait-free algorithms with hard termination
M Alcántara, A Castañeda, D Flores-Peñaloza, S Rajsbaum
Distributed Computing 32 (3), 235-255, 2019
12019
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 Maximum-Sum Matchings of Points
S Bereg, O Chacón-Rivera, D Flores-Peñaloza, C Huemer, ...
arXiv preprint arXiv:1911.10610, 2019
2019
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
2018
Optimizing some constructions with bars: new geometric knapsack problems
S Bereg, JM Díaz-Báñez, D Flores-Peñaloza, S Langerman, ...
Journal of combinatorial optimization 31 (3), 1160-1173, 2016
2016
On the connectedness and diameter of a geometric Johnson graph
J Urrutia, E Sarmiento, D Lara, H González-Aguilar, D Flores-Peñaloza, ...
Discrete Mathematics & Theoretical Computer Science 15, 2013
2013
On Crossings in Geometric Proximity Graphs
BM Abrego, R Fabila-Monroy, S Fernández-Merchant, D Flores-Penaloza, ...
Proc. XIII Encuentros de Geometría Computacional, 2009
2009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20