José Alberto Fernández-Zepeda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
José Alberto Fernández-Zepeda has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Joel Antonio Trejo-Sánchez
Conacyt-Centro de Investigacion en Matematicas
3 shared publications - Hector Zatarain-Aceves
Autonomous University of Baja California (UABC)
2 shared publications - Alejandra Perez-Mena
Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California, Mexico
1 shared publication - Alejandro Flores Lamas
Department of Computer Sciences, Royal Holloway University of London, Egham Hill, United Kingdom
1 shared publication - Alejandro Flores-Lamas
Centro de Investigación Científica y de Educación Superior de Ensenada
1 shared publication - Anu G. Bourgeois
Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
1 shared publication
Latest Publications
- 25 August 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 329 (2) , 426-435
A dynamic programming algorithm for the maximum s -club problem on trees
- 25 August 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 329 (2) , 426-435
A dynamic programming algorithm for the maximum s -club problem on trees
- 20 April 2024
- Published by Elsevier in Behavioural Processes
- Vol. 218, 105028
Automatic classification of dog barking using deep learning
- 20 April 2024
- Published by Elsevier in Behavioural Processes
- Vol. 218, 105028
Automatic classification of dog barking using deep learning
- 11 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (6) , 1435-1454
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- 11 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (6) , 1435-1454
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- Open Access
- 9 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 51419-51427
Approximation Algorithm for the Minimum Hub Cover Set Problem
A subset S ⊆ V of vertices of an undirected graph G = (V,E) is a hub cover when for each edge (u, v) ∈ E, at least one of its endpoints belongs to S, or there exists a vertex r ∈ S that is a neighbor of both u and v. The problem of computing a minimum hub cover set in arbitrary graphs is NP-hard. This problem has applications for indexing large databases. This paper proposes APX-MHC, the first approximation algorithm for the minimum hub cover set in arbitrary graphs to the best of our knowledge. The approximation ratio of this algorithm is proportional to ln μ, where μ is upper bounded by min{1/2 Δ2, |E|} and Δ is the degree of G. The execution time of APX-MHC is O((Δ + 1)|E| + |S||V|). Experimental results show that APX-MHC far outperforms the theoretical approximation ratio for the input graph instances.
- 9 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 51419-51427
Open AccessApproximation Algorithm for the Minimum Hub Cover Set Problem
A subset S ⊆ V of vertices of an undirected graph G = (V,E) is a hub cover when for each edge (u, v) ∈ E, at least one of its endpoints belongs to S, or there exists a vertex r ∈ S that is a neighbor of both u and v. The problem of computing a minimum hub cover set in arbitrary graphs is NP-hard. This problem has applications for indexing large databases. This paper proposes APX-MHC, the first approximation algorithm for the minimum hub cover set in arbitrary graphs to the best of our knowledge. The approximation ratio of this algorithm is proportional to ln μ, where μ is upper bounded by min{1/2 Δ2, |E|} and Δ is the degree of G. The execution time of APX-MHC is O((Δ + 1)|E| + |S||V|). Experimental results show that APX-MHC far outperforms the theoretical approximation ratio for the input graph instances.
- Open Access
- 1 January 2019
- Published by AISTI in RISTI - Revista Ibérica de Sistemas e Tecnologias de Informação
- No. 31,p. 118-133
Una aplicación móvil para el monitoreo de cultivos: caso de estudio campaña contra el pulgón amarillo del sorgo
- 1 January 2019
- Published by AISTI in RISTI - Revista Ibérica de Sistemas e Tecnologias de Informação
- No. 31,p. 118-133
Open AccessUna aplicación móvil para el monitoreo de cultivos: caso de estudio campaña contra el pulgón amarillo del sorgo
- 13 July 2018
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 33 (4) , 823-837
A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem
- 13 July 2018
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 33 (4) , 823-837
A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem
- Open Access
- 16 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 28447-28466
The Maximum Uniform Message Distribution Problem
This paper introduces the Maximum Uniform Message Distribution (MUMD) problem, which can be present in delay-tolerant communication networks, where the destination of the messages is not present in the network. This type of behavior arises in scenarios of natural disasters or social conflicts where a global communication network is not available. In these scenarios, the people inside the affected area might use their mobile devices to communicate in an opportunistic manner. During this communication, the devices can duplicate, exchange, and gather messages with the intention of afterward delivering them to a global communication network. A device successfully delivers all messages in its memory when it reaches a global communication network. We model the MUMD as a computational problem and analyze the effectiveness of the existing opportunistic routing algorithms to solve this problem. Furthermore, we design an algorithm for the MUMD and perform experimental simulations to analyze its performance. Our results show that the greater the number of copies of messages and the more uniformly distributed through the network they are, the higher the probability that deliveries will be successful.
- 16 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 28447-28466
Open AccessThe Maximum Uniform Message Distribution Problem
This paper introduces the Maximum Uniform Message Distribution (MUMD) problem, which can be present in delay-tolerant communication networks, where the destination of the messages is not present in the network. This type of behavior arises in scenarios of natural disasters or social conflicts where a global communication network is not available. In these scenarios, the people inside the affected area might use their mobile devices to communicate in an opportunistic manner. During this communication, the devices can duplicate, exchange, and gather messages with the intention of afterward delivering them to a global communication network. A device successfully delivers all messages in its memory when it reaches a global communication network. We model the MUMD as a computational problem and analyze the effectiveness of the existing opportunistic routing algorithms to solve this problem. Furthermore, we design an algorithm for the MUMD and perform experimental simulations to analyze its performance. Our results show that the greater the number of copies of messages and the more uniformly distributed through the network they are, the higher the probability that deliveries will be successful.
- 5 April 2016
- Published by Wiley in Journal of Software: Evolution and Process
- Vol. 28 (5) , 372-390
Understanding SPI in small organizations: a study of Mexican software enterprises
- 5 April 2016
- Published by Wiley in Journal of Software: Evolution and Process
- Vol. 28 (5) , 372-390
Understanding SPI in small organizations: a study of Mexican software enterprises
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among these models, but they do have certain differences that can take form of restrictions on configurations allowed. This paper presents a constant time simulation of an R-mesh on an LR-mesh (a restricted model of the R-mesh), proving that in spite of the differences, the two models possess the same complexity. In other words, the LR-mesh can simulate a step of the R-mesh in constant time with a polynomial increase in size. This simulation is based on Rein-gold's algorithm to solve USTCON in log-space. The simulation is also the first to be executed in constant time.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among these models, but they do have certain differences that can take form of restrictions on configurations allowed. This paper presents a constant time simulation of an R-mesh on an LR-mesh (a restricted model of the R-mesh), proving that in spite of the differences, the two models possess the same complexity. In other words, the LR-mesh can simulate a step of the R-mesh in constant time with a polynomial increase in size. This simulation is based on Rein-gold's algorithm to solve USTCON in log-space. The simulation is also the first to be executed in constant time.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani that finds a leader in a tree graph. The worst case execution time for this algorithm is O(N4), where N is the number of nodes in the tree. We show that the average execution time for this algorithm, assuming two different scenarios, is much lower than O(N4). In the first scenario, the algorithm assumes a equiprobable daemon and it only privileges a single node at a time. The average execution time for this case is O(N2). For the second case, the algorithm can privilege multiple nodes at a time. We eliminate the daemon from this algorithm by making random choices to avoid interference between neighbor nodes. The execution time for this case is O(N). We also show that for specific tree graphs, these results reduce even more.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani that finds a leader in a tree graph. The worst case execution time for this algorithm is O(N4), where N is the number of nodes in the tree. We show that the average execution time for this algorithm, assuming two different scenarios, is much lower than O(N4). In the first scenario, the algorithm assumes a equiprobable daemon and it only privileges a single node at a time. The average execution time for this case is O(N2). For the second case, the algorithm can privilege multiple nodes at a time. We eliminate the daemon from this algorithm by making random choices to avoid interference between neighbor nodes. The execution time for this case is O(N). We also show that for specific tree graphs, these results reduce even more.