On the public citation graph
Covering arrays of higher strength from permutation vectors
0 signed · 65 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jcd.10002openalex-snapshot
On the state of strength‐three covering arrays
inferredcites →https://doi.org/10.1002/jcd.20035openalex-snapshot
Group construction of covering arrays
inferredcites →https://doi.org/10.1002/jcd.20065openalex-snapshot
Products of mixed covering arrays of strength two
inferredcites →https://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferredcites →https://doi.org/10.1007/3-540-44598-6_33openalex-snapshot
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
inferredcites →https://doi.org/10.1016/j.disc.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
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.1023/b:desi.0000029232.40302.6dopenalex-snapshot
On t-Covering Arrays
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/issre.2003.1251061openalex-snapshot
Augmenting simulated annealing to build interaction test suites
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.21657openalex-snapshot
Two‐stage algorithms for covering array construction
inferred← citeshttps://doi.org/10.1002/jcd.21747openalex-snapshot
An extension of a construction of covering arrays
inferred← citeshttps://doi.org/10.1002/spe.1017openalex-snapshot
Grammar‐based test generation with YouGen
inferred← citeshttps://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-01877-0_3openalex-snapshot
Binary Covering Arrays and Existentially Closed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_40openalex-snapshot
Randomized Postoptimization of Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-15585-7_6openalex-snapshot
Bad Pairs in Software Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-30476-7_3openalex-snapshot
Specification-Driven Test Generation for Model Transformations
inferred← citeshttps://doi.org/10.1007/s10270-013-0369-xopenalex-snapshot
Specification-driven model transformation testing
inferred← citeshttps://doi.org/10.1007/s10623-006-0020-8openalex-snapshot
Roux-type constructions for covering arrays of strengths three and four
inferred← citeshttps://doi.org/10.1007/s10623-009-9333-8openalex-snapshot
Covering arrays from cyclotomy
inferred← citeshttps://doi.org/10.1007/s10623-011-9505-1openalex-snapshot
Constructions of covering arrays of strength five
inferred← citeshttps://doi.org/10.1007/s10623-015-0152-9openalex-snapshot
Finite field constructions of combinatorial arrays
inferred← citeshttps://doi.org/10.1007/s10623-017-0369-xopenalex-snapshot
Asymptotic and constructive methods for covering perfect hash families and covering arrays
inferred← citeshttps://doi.org/10.1007/s10623-018-0465-6openalex-snapshot
Covering arrays of strength three from extended permutation vectors
inferred← citeshttps://doi.org/10.1007/s10878-022-00947-xopenalex-snapshot
Algorithmic methods for covering arrays of higher index
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.1007/s42979-023-02548-9openalex-snapshot
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124826openalex-snapshot
Improved covering arrays using covering perfect hash families with groups of restricted entries
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126952openalex-snapshot
In-Parameter-Order strategies for covering perfect hash families
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.024openalex-snapshot
Merging covering arrays and compressing multiple sequence alignments
inferred← citeshttps://doi.org/10.1016/j.dam.2010.03.008openalex-snapshot
Covering and radius-covering arrays: Constructions and classification
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.040openalex-snapshot
Constructing new covering arrays from LFSR sequences over finite fields
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.017openalex-snapshot
Randomized post-optimization of covering arrays
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105202openalex-snapshot
Detecting arrays for effects of multiple interacting factors
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.020openalex-snapshot
New bounds for binary covering arrays using simulated annealing
inferred← citeshttps://doi.org/10.1016/j.ins.2018.05.047openalex-snapshot
A greedy-metaheuristic 3-stage approach to construct covering arrays
inferred← citeshttps://doi.org/10.1016/j.jestch.2015.11.006openalex-snapshot
Test case minimization approach using fault detection and combinatorial optimization techniques for configuration-aware structural testing
inferred← citeshttps://doi.org/10.1016/j.jspi.2008.05.020openalex-snapshot
Tabu search for covering arrays using permutation vectors
inferred← citeshttps://doi.org/10.1016/j.measurement.2013.02.021openalex-snapshot
Combinatorial testing for software: An adaptation of design of experiments
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/cec.2010.5586148openalex-snapshot
Simulated Annealing for constructing binary covering arrays of variable strength
inferred← citeshttps://doi.org/10.1109/qrs.2016.15openalex-snapshot
How Effective Is Branch-Based Combinatorial Testing? An Exploratory Study
inferred← citeshttps://doi.org/10.1109/qsic.2006.31openalex-snapshot
Generating Optimal Test Set for Neighbor Factors Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/qsic.2014.15openalex-snapshot
General Optimization Strategies for Refining the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1109/rivf55975.2022.10013824openalex-snapshot
A Pairwise Based Method for Automated Test Data Generation for $\mathrm{C}/\mathrm{C}++$ Projects
inferred← citeshttps://doi.org/10.1109/tr.2016.2618121openalex-snapshot
Modeling and Verifying Combinatorial Interactions to Test Data Intensive Systems: Experience at the Norwegian Customs Directorate
inferred← citeshttps://doi.org/10.1142/s1793830914500347openalex-snapshot
Covering arrays, augmentation, and quilting arrays
inferred← citeshttps://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferred← citeshttps://doi.org/10.1145/2000799.2000801openalex-snapshot
The Minimal Failure-Causing Schema of Combinatorial Testing
inferred← citeshttps://doi.org/10.1145/2593882.2593885openalex-snapshot
Software testing: a research travelogue (2000–2014)
inferred← citeshttps://doi.org/10.1145/3319619.3326823openalex-snapshot
Genetic algorithms for affine transformations to existential t -restrictions
inferred← citeshttps://doi.org/10.1155/2018/1860673openalex-snapshot
A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families
inferred← citeshttps://doi.org/10.20381/ruor-19660openalex-snapshot
Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory
inferred← citeshttps://doi.org/10.22215/etd/2010-08757openalex-snapshot
Hybrid strength two covering array constructions: using cover starters to create covering arrays
inferred← citeshttps://doi.org/10.26493/2590-9770.1220.3a1openalex-snapshot
Subspace restrictions and affine composition for covering perfect hash families
inferred← citeshttps://doi.org/10.3390/math12121908openalex-snapshot
New Upper Bounds for Covering Arrays of Order Seven
inferred← citeshttps://doi.org/10.5070/c64163845openalex-snapshot
Sets of mutually orthogoval projective and affine planes
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.