An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem. - Heidi J. Romero; Carlos A. Brizuela; Andrei Tchernykh (ENC, 2004)

An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. - Carlos A. Brizuela; Luis C. González; Heidi J. Romero (EvoWorkshops, 2004)

A Genetic Algorithm for the Shortest Common Superstring Problem. - Luis C. González; Heidi J. Romero; Carlos A. Brizuela (GECCO (2), 2004)

Broadcasting in Conflict-Aware Multi-channel Networks. - Francisco Claude; Reza Dorrigiv; Shahin Kamali; Alejandro López-Ortiz; Pawel Pralat; Jazmín Romero; Alejandro Salinger; Diego Seco (WALCOM, 2013)

A Parameterized Algorithm for Packing Overlapping Subgraphs. - Jazmín Romero; Alejandro López-Ortiz (CSR, 2014)

The ${ mathcal{G}}$ -Packing with t-Overlap Problem. - Jazmín Romero; Alejandro López-Ortiz (WALCOM, 2014)

Parameterized Algorithms for the H-Packing with t-Overlap Problem. - Alejandro López-Ortiz; Jazmín Romero (J. Graph Algorithms Appl., 2014)

Kernelization Algorithms for Packing Problems Allowing Overlaps. - Henning Fernau; Alejandro López-Ortiz; Jazmín Romero (TAMC, 2015)

Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. - Henning Fernau; Alejandro López-Ortiz; Jazmín Romero (ACM Trans. Comput. Theory, 2015)

Generalized Set and Graph Packing Problems. - Jazmín Romero (2015)

Arbitrary Overlap Constraints in Graph Packing Problems. - Alejandro López-Ortiz; Jazmín Romero (CoRR, 2016)

Arbitrary Overlap Constraints in Graph Packing Problems. - Alejandro López-Ortiz; Cynthia B. Pérez; Jazmín Romero (Int. J. Found. Comput. Sci., 2018)