default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIdelfonso Izquierdo
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Jose Torres-Jimenez
, Idelfonso Izquierdo-Marquez:
Improved covering arrays using covering perfect hash families with groups of restricted entries. Appl. Math. Comput. 369 (2020)
2010 – 2019
- 2019
- [j12]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Himer Avila-George:
Methods to Construct Uniform Covering Arrays. IEEE Access 7: 42774-42797 (2019) - [j11]Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez:
New covering array numbers. Appl. Math. Comput. 353: 134-146 (2019) - [j10]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez:
A low spatial complexity algorithm to generate combinations with the strong minimal change property. Discret. Math. Algorithms Appl. 11(5): 1950060:1-1950060:15 (2019) - 2018
- [j9]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez:
Covering arrays of strength three from extended permutation vectors. Des. Codes Cryptogr. 86(11): 2629-2643 (2018) - [j8]Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez:
New optimal covering arrays using an orderly algorithm. Discret. Math. Algorithms Appl. 10(1): 1850011:1-1850011:16 (2018) - [j7]Himer Avila-George, Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez:
Improved pairwise test suites for non-prime-power orders. IET Softw. 12(3): 215-224 (2018) - [j6]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Himer Avila-George:
Search-based software engineering for constructing covering arrays. IET Softw. 12(4): 324-332 (2018) - [j5]Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez, Brenda Acevedo-Juárez, Himer Avila-George:
A greedy-metaheuristic 3-stage approach to construct covering arrays. Inf. Sci. 460-461: 172-189 (2018) - 2017
- [j4]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Daniel Ramirez-Acuna, René Peralta:
Near-optimal algorithm to count occurrences of subsequences of a given length. Discret. Math. Algorithms Appl. 9(3): 1750042:1-1750042:10 (2017) - [j3]Jose Torres-Jimenez, Himer Avila-George, Idelfonso Izquierdo-Marquez:
A two-stage algorithm for combinatorial testing. Optim. Lett. 11(3): 457-469 (2017) - [i1]Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez:
New Covering Array Numbers. CoRR abs/1711.10040 (2017) - 2016
- [j2]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez:
Construction of non-isomorphic covering arrays. Discret. Math. Algorithms Appl. 8(2): 1650033:1-1650033:24 (2016) - 2015
- [j1]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Alberto Garcia-Robledo, Aldo Gonzalez-Gomez, Javier Bernal, Raghu Kacker:
A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs. Inf. Sci. 303: 33-49 (2015) - [c3]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez, Aldo Gonzalez-Gomez, Himer Avila-George:
A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays. MICAI (1) 2015: 158-177 - 2013
- [c2]Carlos Ansótegui, Idelfonso Izquierdo, Felip Manyà, José Torres-Jiménez:
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. CCIA 2013: 51-59 - [c1]Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez:
Survey of Covering Arrays. SYNASC 2013: 20-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
