| Approximation Algorithms for the Vertex K-Center Problem: Survey and Experimental Evaluation J Garcia-Diaz, R Menchaca-Mendez, MM Ricardo, S Pomares Hernández, ... IEEE Access 7 (1), 109228 - 109245, 2019 | 31 | 2019 |
| When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem J Garcia-Diaz, J Sanchez-Hernandez, R Menchaca-Mendez, ... Journal of Heuristics 23, 349-366, 2017 | 26 | 2017 |
| The effect of speed humps on instantaneous traffic emissions JC Pérez-Sansalvador, N Lakouari, J Garcia-Diaz, ... Applied Sciences 10 (5), 1592, 2020 | 18 | 2020 |
| Burning graphs through farthest-first traversal J García-Díaz, JC Pérez-Sansalvador, LMX Rodríguez-Henríquez, ... IEEE Access 10, 30395-30404, 2022 | 13 | 2022 |
| Local Search Algorithms for the Vertex K-Center Problem J Garcia, R Menchaca, J Sanchez IEEE Latin America Transactions 16 (6), 1765-1771, 2018 | 13 | 2018 |
| A Bloom filter-based algorithm for routing in intermittently connected mobile networks JJ Sanchez-Hernandez, R Menchaca-Mendez, R Menchaca-Mendez, ... Proceedings of the 18th ACM International Conference on Modeling, Analysis …, 2015 | 8 | 2015 |
| A Structure-Driven Randomized Algorithm for the K-Center Problem J García Díaz, R Menchaca Méndez, R Menchaca Méndez, R Quintero IEEE Latin America Transactions 13 (3), 746-752, 2015 | 8 | 2015 |
| Solving the capacitated vertex k-center problem through the minimum capacitated dominating set problem JA Cornejo Acosta, J García Díaz, R Menchaca-Méndez, ... Mathematics 8 (9), 1551, 2020 | 7 | 2020 |
| Graph burning: Mathematical formulations and optimal solutions J García-Díaz, LMX Rodríguez-Henríquez, JC Pérez-Sansalvador, ... Mathematics 10 (15), 2777, 2022 | 6 | 2022 |
| Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems JA Cornejo-Acosta, J García-Díaz, JC Pérez-Sansalvador, C Segura Mathematics 11 (13), 3014, 2023 | 3 | 2023 |
| The Moving Firefighter Problem BR Gutiérrez-De-La-Paz, J García-Díaz, R Menchaca-Méndez, ... Mathematics 11 (1), 179, 2022 | 1 | 2022 |
| A structure-driven genetic algorithm for graph coloring J Aguilar-Canepa, R Menchaca-Mendez, R Menchaca-Mendez, J García Computación y Sistemas 25 (3), 465-481, 2021 | 1 | 2021 |
| A new grasp algorithm for the k-center problem J Garcia-Diaz, J Sanchez-Hernandez, R Menchaca-Mendez, ... Encuentro Nacional de Computación, ENC, 2014 | 1 | 2014 |
| A greedy heuristic for graph burning J García-Díaz, JA Cornejo-Acosta arXiv preprint arXiv:2401.07577, 2024 | | 2024 |
| A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem JA Cornejo-Acosta, J García-Díaz, JC Pérez-Sansalvador, ... ACM Journal of Experimental Algorithmics 28, 1-26, 2023 | | 2023 |
| Approximation Algorithm for the Minimum Hub Cover Set Problem JA Trejo-Sánchez, CE Sansores-Pérez, J García-Díaz, JA Fern IEEE Access 10, 51419-51427, 2022 | | 2022 |
| Randomized Algorithm based on Sliding Distributions for the Scheduling Problem in Grid Systems HJ Selley-Rojas, J García-Díaz, MA Soto-Ramos, FR Menchaca-García, ... Computación y Sistemas 19 (1), 47-68, 2015 | | 2015 |
| Algoritmo aleatorizado basado en distribuciones deslizantes para el problema de planificación en Sistemas Grid HJ Selley-Rojas, J Garcia-Diaz, MA Soto-Ramos, FR Menchaca-Garcia, ... Computación y Sistemas 19 (1), 47-68, 2015 | | 2015 |
| Clasificación de patrones con memorias asociativas bidireccionales AB SP Torres Jurado, J García Díaz | | 2009 |
| Búsqueda basada en estructura para problemas NP-Difíciles J García Díaz | | |
Rolando Menchaca-MendezProfessor - Centro de Investigación en Computación del IPNVerified email at cic.ipn.mx
