On the public citation graph

Two‐stage algorithms for covering array construction

https://doi.org/10.1002/jcd.21657
0 signed · 49 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/9780470277331openalex-snapshot
The Probabilistic Method
inferredcites →https://doi.org/10.1002/jcd.20035openalex-snapshot
Group construction of covering arrays
inferredcites →https://doi.org/10.1002/jcd.20067openalex-snapshot
Covering arrays of higher strength from permutation vectors
inferredcites →https://doi.org/10.1002/jcd.21609openalex-snapshot
Small arrays of maximum coverage
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
inferredcites →https://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1002/stvr.v19:1openalex-snapshot
inferredcites →https://doi.org/10.1007/978-1-4612-1478-6openalex-snapshot
Orthogonal Arrays
inferredcites →https://doi.org/10.1007/bf02018457openalex-snapshot
Two applications (for search theory and truth functions) of Sperner type theorems
inferredcites →https://doi.org/10.1007/s10623-017-0369-xopenalex-snapshot
Asymptotic and constructive methods for covering perfect hash families and covering arrays
inferredcites →https://doi.org/10.1007/s11590-016-1012-xopenalex-snapshot
A two-stage algorithm for combinatorial testing
inferredcites →https://doi.org/10.1016/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0097-3165(74)90062-4openalex-snapshot
Two combinatorial covering theorems
inferredcites →https://doi.org/10.1016/0166-218x(96)00096-0openalex-snapshot
The complexity of generalized graph colorings
inferredcites →https://doi.org/10.1016/j.dam.2007.09.024openalex-snapshot
Merging covering arrays and compressing multiple sequence alignments
inferredcites →https://doi.org/10.1016/j.ins.2018.05.047openalex-snapshot
A greedy-metaheuristic 3-stage approach to construct covering arrays
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1017/s0963548300001905openalex-snapshot
t-Covering Arrays: Upper Bounds and Poisson Approximations
inferredcites →https://doi.org/10.1023/a:1008379710317openalex-snapshot
Covering Arrays of Strength Three
inferredcites →https://doi.org/10.1109/18.6031openalex-snapshot
Vector sets for exhaustive testing of logic circuits
inferredcites →https://doi.org/10.1109/32.605761openalex-snapshot
The AETG system: an approach to testing based on combinatorial design
inferredcites →https://doi.org/10.1109/sew.2002.1199454openalex-snapshot
An investigation of the applicability of design of experiments to software testing
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1137/16m1067767openalex-snapshot
Upper Bounds on the Size of Covering Arrays
inferredcites →https://doi.org/10.1145/1536414.1536462openalex-snapshot
A constructive proof of the Lovász local lemma
inferredcites →https://doi.org/10.1145/1667053.1667060openalex-snapshot
A constructive proof of the general lovász local lemma
inferredcites →https://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferredcites →https://doi.org/10.1145/2049697.2049702openalex-snapshot
New Constructive Aspects of the Lovász Local Lemma
inferredcites →https://doi.org/10.1145/2723872.2723878openalex-snapshot
Locating Arrays
inferredcites →https://doi.org/10.1201/b14957openalex-snapshot
Introduction to Combinatorial Testing
inferredcites →https://doi.org/10.1214/aoms/1177699280openalex-snapshot
On Orthogonal Arrays

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.70022openalex-snapshot
Lower Bounds and Construction of Detecting Arrays
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_7openalex-snapshot
Perfect Hash Families: The Generalization to Higher Indices
inferred← citeshttps://doi.org/10.1007/s42979-023-02548-9openalex-snapshot
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
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.022openalex-snapshot
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
inferred← citeshttps://doi.org/10.1049/itr2.12438openalex-snapshot
A real‐time critical‐scenario‐generation framework for defect detection of autonomous driving system
inferred← citeshttps://doi.org/10.1080/24754269.2021.1904095openalex-snapshot
Combinatorial testing: using blocking to assign test cases for validating complex software systems
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/icstw.2018.00069openalex-snapshot
The Effect of Time-Between-Events for Sequence Interaction Testing of a Real-Time System
inferred← citeshttps://doi.org/10.1109/icstw58534.2023.00047openalex-snapshot
Hints in Unified Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/tits.2025.3595278openalex-snapshot
Rapid Generation of Hazardous Multi-Participants Scenarios for Testing Intelligent Driving System
inferred← citeshttps://doi.org/10.1145/3377930.3390230openalex-snapshot
Genetic algorithms for redundancy in interaction testing
inferred← citeshttps://doi.org/10.3390/math8050831openalex-snapshot
Locating Arrays with Mixed Alphabet Sizes
inferred← citeshttps://doi.org/10.3934/era.2025147openalex-snapshot
Detecting arrays on graphs
inferred← citeshttps://doi.org/10.3934/era.2025292openalex-snapshot
Mixed-level detecting arrays on graphs
inferred← citeshttps://doi.org/10.3934/math.20241657openalex-snapshot
Separable detecting arrays
inferred← citeshttps://doi.org/10.4271/2018-01-0004openalex-snapshot
Real-Time Sequence Testing of an Automotive Electric Machine Control Systems
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.