A Bloom Filter-Based Algorithm for Routing in Intermittently Connected Mobile Networks. - Jairo Javier Sanchez-Hernandez; Rolando Menchaca-Méndez; Ricardo Menchaca-Mendez; Jesus Garcia-Diaz; Mario E. Rivero-Angeles; Jose Joaquin Garcia-Luna-Aceves (MSWiM, 2015)

Algoritmo aleatorizado basado en distribuciones deslizantes para el problema de planificación en Sistemas Grid. - Hector Julian Selley-Rojas; Jesus Garcia-Diaz; Manuel A. Soto-Ramos; Felipe R. Menchaca-Garcia; Rolando Menchaca-Méndez (Computación y Sistemas, 2015)

When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem. - Jesus Garcia-Diaz; Jairo Javier Sanchez-Hernandez; Ricardo Menchaca-Mendez; Rolando Menchaca-Méndez (J. Heuristics, 2017)

Approximation Algorithms for the Vertex K-Center Problem: Survey and Experimental Evaluation. - Jesus Garcia-Diaz; Rolando Menchaca-Méndez; Ricardo Menchaca-Mendez; Saúl E. Pomares Hernández; Julio Cesar Perez Sansalvador; Noureddine Lakouari (IEEE Access, 2019)

A Structure-Driven Genetic Algorithm for Graph Coloring. - José Carlos Aguilar-Canepa; Rolando Menchaca-Méndez; Ricardo Menchaca-Mendez; Jesus Garcia-Diaz (Computación y Sistemas, 2021)

Burning Graphs Through Farthest-First Traversal. - Jesus Garcia-Diaz; Julio César Pérez Sansalvador; Lil María Rodríguez-Henríquez; José Alejandro Cornejo-Acosta (IEEE Access, 2022)

Approximation Algorithm for the Minimum Hub Cover Set Problem. - Joel Antonio Trejo-Sánchez; Candelaria Elizabeth Sansores-Pérez; Jesus Garcia-Diaz; José Alberto Fernndez-Zepeda (IEEE Access, 2022)

A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem. - José Alejandro Cornejo-Acosta; Jesus Garcia-Diaz; Julio César Pérez Sansalvador; Roger Z. Ríos-Mercado; Saúl Eduardo Pomares Hernández (ACM J. Exp. Algorithmics, 2023)

A greedy heuristic for graph burning. - Jesús García-Díaz; José Alejandro Cornejo-Acosta; Joel Antonio Trejo-Sánchez (Computing, 2025)