Seguir
Alejandro Flores Lamas
Alejandro Flores Lamas
Dirección de correo verificada de rhul.ac.uk
Título
Citado por
Citado por
Año
Solving String Constraints with Regex-Dependent Functions through Transducers with Priorities and Variables
ZW Taolue Chen, Alejandro Flores-Lamas, Matthew Hague, Zhilei Han, Denghang ...
Proc. ACM Program. Lang. 6, 31, 2022
38*2022
Algorithm to find a maximum 2-packing set in a cactus
A Flores-Lamas, JA Fernández-Zepeda, JA Trejo-Sánchez
Theoretical Computer Science, 2018
92018
A distributed algorithm for a maximal 2-packing set in Halin graphs
A Flores-Lamas, JA Fernández-Zepeda, JA Trejo-Sánchez
Journal of Parallel and Distributed Computing 142, 62-76, 2020
62020
Fast random cactus graph generation
JA Trejo-Sánchez, A Vela-Navarro, A Flores-Lamas, JL Lopez-Martinez, ...
Supercomputing: 9th International Conference, ISUM 2018, Mérida, Mexico …, 2019
22019
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
JA Trejo-Sánchez, FA Madera-Ramírez, JA Fernández-Zepeda, ...
Optimization Letters 17 (6), 1435-1454, 2023
12023
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
AL Sánchez, JA Ramírez-Rafael, A Flores-Lamas, M Hernández-Rosales, ...
arXiv preprint arXiv:2407.06367, 2024
2024
The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
A López Sánchez, JA Ramírez-Rafael, A Flores-Lamas, ...
24th International Workshop on Algorithms in Bioinformatics (WABI 2024), 2024
2024
Fast Random Cactus Graph Generation
A Flores-Lamas, JL López-Martínez, C Bermejo-Sabbagh, ...
Supercomputing: 9th International Conference, ISUM 2018, Mérida, Mexico …, 2018
2018
OSTRICH Version 1.3
T Chen, R De Masellis, A Flores-Lamas, M Hague, Z Han, D Hu, AW Lin, ...
The OSTRICH String Solver
T Chen, R De Masellis, A Flores-Lamas, M Hague, Z Han, D Hu, S Kan, ...
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–10