On the public citation graph

Variable strength covering arrays

https://doi.org/10.1002/jcd.21602
0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jcd.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferredcites →https://doi.org/10.1002/jcd.20149openalex-snapshot
Mixed covering arrays on graphs
inferredcites →https://doi.org/10.1002/jcd.21602openalex-snapshot
Variable strength covering arrays
inferredcites →https://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1007/978-1-4612-1478-6openalex-snapshot
Orthogonal Arrays
inferredcites →https://doi.org/10.1007/s10463-009-0240-6openalex-snapshot
Binary consecutive covering arrays
inferredcites →https://doi.org/10.1007/s10623-013-9835-2openalex-snapshot
A construction for strength-3 covering arrays from linear feedback shift register sequences
inferredcites →https://doi.org/10.1016/j.dam.2007.04.010openalex-snapshot
The test suite generation problem: Optimal instances and their implications
inferredcites →https://doi.org/10.1016/j.endm.2018.02.019openalex-snapshot
The Lovász Local Lemma and Variable Strength Covering Arrays
inferredcites →https://doi.org/10.1016/j.jctb.2005.03.005openalex-snapshot
Covering arrays on graphs
inferredcites →https://doi.org/10.1016/j.jspi.2009.11.016openalex-snapshot
Consecutive covering arrays and a new randomness test
inferredcites →https://doi.org/10.1038/scientificamerican1077-108openalex-snapshot
The Solution of the Four-Color-Map Problem
inferredcites →https://doi.org/10.1093/acprof:oso/9780198528173.001.0001openalex-snapshot
Graphs and Homomorphisms
inferredcites →https://doi.org/10.1109/cmpsac.2003.1245373openalex-snapshot
A variable strength interaction testing of components
inferredcites →https://doi.org/10.1109/qsic.2003.1319088openalex-snapshot
Generating small combinatorial test suites to cover input-output relationships
inferredcites →https://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferredcites →https://doi.org/10.1201/9781420010541openalex-snapshot
Handbook of Combinatorial Designs
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcd.21659openalex-snapshot
Covering arrays for some equivalence classes of words
inferred← citeshttps://doi.org/10.1002/jcd.21882openalex-snapshot
Ordered covering arrays and upper bounds on covering codes
inferred← citeshttps://doi.org/10.1002/qre.70045openalex-snapshot
Combinatorial Testing of Engineered Systems With Hard‐to‐Change Factors
inferred← citeshttps://doi.org/10.1002/stvr.1805openalex-snapshot
Combinatorial methods for testing Internet of Things smart home systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_9openalex-snapshot
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_11openalex-snapshot
A Survey of Cover-Free Families: Constructions, Applications, and Generalizations
inferred← citeshttps://doi.org/10.1007/s00373-020-02176-7openalex-snapshot
Consecutive Detecting Arrays for Interaction Faults
inferred← citeshttps://doi.org/10.1007/s00373-024-02813-5openalex-snapshot
Covering Array on the Cartesian Product of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-03007-3openalex-snapshot
Mixed Covering Arrays on Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10255-021-1006-zopenalex-snapshot
A Construction of Variable Strength Covering Arrays
inferred← citeshttps://doi.org/10.1007/s42081-019-00056-wopenalex-snapshot
Arrays for combinatorial interaction testing: a review on constructive approaches
inferred← citeshttps://doi.org/10.1016/j.endm.2018.02.019openalex-snapshot
The Lovász Local Lemma and Variable Strength Covering Arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.018openalex-snapshot
Problems and algorithms for covering arrays via set covers
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.019openalex-snapshot
A survey on the state of the art of complexity problems for covering arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.022openalex-snapshot
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000969openalex-snapshot
Diversity in Renovation Design: Theoretical Foundations of the Renovation Domain Model
inferred← citeshttps://doi.org/10.1080/09728600.2022.2081523openalex-snapshot
A hyperedge coloring and application in combinatorial testing
inferred← citeshttps://doi.org/10.1109/access.2022.3151378openalex-snapshot
Locating Hardware Trojans Using Combinatorial Testing for Cryptographic Circuits
inferred← citeshttps://doi.org/10.1109/gi.2019.00013openalex-snapshot
Evolutionary Computation for Improving Malware Analysis
inferred← citeshttps://doi.org/10.1109/tse.2021.3131548openalex-snapshot
Enhance Combinatorial Testing with Metamorphic Relations
inferred← citeshttps://doi.org/10.1109/tse.2023.3306461openalex-snapshot
An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing
inferred← citeshttps://doi.org/10.1142/s1793830921500853openalex-snapshot
Mixed covering arrays on graphs of small treewidth
inferred← citeshttps://doi.org/10.22215/etd/2017-11952openalex-snapshot
An Analysis and Extension of Category Partition Testing in the Presence of Constraints
showing the first 23 of 24 · page through all 24
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.