1 | Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons | Coautor: Catana-Salazar, J. C., Aldana-Galvan, I, Alvarez-Rebollar, J. L., Marin, N., et al. | 2020 | GRAPHS AND COMBINATORICS | WoS-id: 000516252400002 Scopus-id: 2-s2.0-85079748985
| 1 | 2 |
2 | On optimal coverage of a tree with multiple robots | 2ᵒ autor: Catana-Salazar, J. C., Aldana-Galvan, I, Diaz-Banez, J. M., Duque, F., et al. | 2020 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | WoS-id: 000528798100003 Scopus-id: 2-s2.0-85081923766
| 2 | 2 |
3 | Plane augmentation of plane graphs to meet parity constraints | 1ᵉʳ autor: Catana, J. C., Garcia, A., Tejel, J., Urrutia, J. | 2020 | APPLIED MATHEMATICS AND COMPUTATION | WoS-id: 000555705300018 Scopus-id: 2-s2.0-85087988293
| 0 | 0 |
4 | Minimizing the solid angle sum of orthogonal polyhedra | Coautor: Catana-Salazar, J. C., Aldana-Galvan, I., Alvarez-Rebollar, J. L., Jimenez-Salinas, M., et al. | 2019 | INFORMATION PROCESSING LETTERS | WoS-id: 000457814800011 Scopus-id: 2-s2.0-85057878651
| 0 | 0 |
5 | An agglomeration strategy for the parallel processes mapping onto a distributed computing architecture | 1ᵉʳ autor: Catana-Salazar, Juan C., Ortega-Arjona, Jorge L. | 2016 | Communications in Computer and Information Science | WoS-id: 000376262000014 Scopus-id: 2-s2.0-84964053751
| 0 | 0 |
6 | Efficient counting of the number of independent sets on polygonal trees | Coautor: Catana-Salazar, Juan C., De Ita, Guillermo, Bello, Pedro, Contreras, Meliza | 2016 | Lecture Notes in Computer Science | WoS-id: 000379296900017 Scopus-id: 2-s2.0-84977548907
| 0 | 0 |