Home Students November 30, 2022   

Supervised Students


PhD Theses

  1. Advanced algorithms for the Cyclic Bandwidth Sum Problem in Graphs, by María Valentina Narváez Terán, CINVESTAV-Tamaulipas.
    Defended on December 14, 2021.
  2. On the use of alternative evaluation schemes in metaheuristics to handle the main search difficulties involved with the prediction of protein structures under the HP model, by Mario Garza Fabre, CINVESTAV-Tamaulipas, co-advisor Dr. Gregorio Toscano Pulido.
    Defended on May 13, 2014.

MSc Theses

  1. New multi-objective optimization reformulations for solving the maximum parsimony problem, by Daniel Rafael Torres Avalos, CINVESTAV-Tamaulipas, co-advisor Dr. Gregorio Toscano Pulido.
    Defended on December 8, 2017.
  2. Metaheurísticas para la minimización de la suma del ancho de banda cíclico en grafos, by María Valentina Narváez Terán, CINVESTAV-Tamaulipas.
    Defended on August 9, 2016.
  3. Diseño de un patrón arquitectónico de software mejorado, aplicable a proyectos de desarrollo ágil, by Sergio Iván Ponce Ruiz, CINVESTAV-Tamaulipas.
    Defended on May 23, 2014.
  4. Reconstrucción tridimensional de fachadas de edificios empleando imágenes monoculares obtenidas por un vehículo aéreo no tripulado autónomo, by Carlos Alberto Motta Ávila, CINVESTAV-Tamaulipas, advisor Dr. José Gabriel Ramírez Torres (I was the co-advisor).
    Defended on February 28, 2014.
  5. Algoritmos para el problema de minimización del ancho de banda cíclico en grafos generales, by Hillel Romero Monsivais, CINVESTAV-Tamaulipas.
    Defended on December 14, 2012.
  6. Aceleración de un algoritmo evolutivo en GPUs para la inferencia de modelos de redes reguladoras de genes, by Luis Enrique Ramírez Chávez, Department of Computer Science, CINVESTAV-IPN, advisor Dr. Carlos A. Coello Coello (I was the co-advisor).
    Defended on February 2, 2012.
  7. Metaheurísticas para la resolución del problema de máxima parsimonia, by Karla Esmeralda Vázquez Ortiz, CINVESTAV-Tamaulipas.
    Defended on December 14, 2011.
  8. Una metaheurística de recocido simulado para el problema de maximización del antibandwidth en grafos, by Luis Carlos Betancourt Rodríguez, CINVESTAV-Tamaulipas.
    Defended on December 5, 2011.
  9. Un algoritmo de branch and bound para construir pequeñas instancias de covering arrays binarios de fuerza variable, by Josué Emmanuel Bracho Ríos, CINVESTAV-Tamaulipas, advisor Dr. José Torres Jiménez (I was the co-advisor).
    Defended on January 25, 2010.


® 2008 Eduardo Rodriguez-Tello