Idelfonso Izquierdo

According to our database, Idelfonso Izquierdo authored at least 16 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Improved covering arrays using covering perfect hash families with groups of restricted entries.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Appl. Math. Comput., 2020

2019

A low spatial complexity algorithm to generate combinations with the strong minimal change property.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Discret. Math. Algorithms Appl., 2019

New covering array numbers.

Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez

Appl. Math. Comput., 2019

Methods to Construct Uniform Covering Arrays.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Himer Avila-George

IEEE Access, 2019

2018

A greedy-metaheuristic 3-stage approach to construct covering arrays.

Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez, Brenda Acevedo-Juárez, Himer Avila-George

Inf. Sci., 2018

Search-based software engineering for constructing covering arrays.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Himer Avila-George

IET Softw., 2018

Improved pairwise test suites for non-prime-power orders.

Himer Avila-George, Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

IET Softw., 2018

New optimal covering arrays using an orderly algorithm.

Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez

Discret. Math. Algorithms Appl., 2018

Covering arrays of strength three from extended permutation vectors.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Des. Codes Cryptogr., 2018

2017

A two-stage algorithm for combinatorial testing.

Jose Torres-Jimenez, Himer Avila-George, Idelfonso Izquierdo-Marquez

Optim. Lett., 2017

Near-optimal algorithm to count occurrences of subsequences of a given length.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, René Peralta

Discret. Math. Algorithms Appl., 2017

2016

Construction of non-isomorphic covering arrays.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Discret. Math. Algorithms Appl., 2016

2015

A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Alberto Garcia-Robledo, Aldo Gonzalez-Gomez, Javier Bernal, Raghu Kacker

Inf. Sci., 2015

A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Aldo Gonzalez-Gomez, Himer Avila-George

Proceedings of the Advances in Artificial Intelligence and Soft Computing, 2015

2013

Survey of Covering Arrays.

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

A Max-SAT-Based Approach to Constructing Optimal Covering Arrays.

Carlos Ansótegui, Idelfonso Izquierdo, Felip Manyà, José Torres-Jiménez

Proceedings of the Artificial Intelligence Research and Development, 2013