On the public citation graph
Group construction of covering arrays
0 signed · 66 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/(sici)1520-6610(1999)7:3<185::aid-jcd3>3.0.co;2-3openalex-snapshot
New recursive methods for transversal covers
inferredcites →https://doi.org/10.1002/jcd.10002openalex-snapshot
On the state of strength‐three covering arrays
inferredcites →https://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
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.1016/0012-365x(73)90098-8openalex-snapshot
Families of k-independent sets
inferredcites →https://doi.org/10.1016/j.disc.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
inferredcites →https://doi.org/10.1016/s0166-218x(03)00291-9openalex-snapshot
Upper bounds for covering arrays by tabu search
inferredcites →https://doi.org/10.1023/a:1008329410829openalex-snapshot
Lower Bounds for Transversal Covers
inferredcites →https://doi.org/10.1023/a:1008379710317openalex-snapshot
Covering Arrays of Strength Three
inferredcites →https://doi.org/10.1080/00401706.1998.10485524openalex-snapshot
Factor-Covering Designs for Testing Software
inferredcites →https://doi.org/10.1093/qmath/12.1.313openalex-snapshot
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
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/52.536462openalex-snapshot
The combinatorial design approach to automatic test generation
inferredcites →https://doi.org/10.1109/issre.1996.558835openalex-snapshot
A practical strategy for testing pair-wise coverage of network interfaces
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.20065openalex-snapshot
Products of mixed covering arrays of strength two
inferred← citeshttps://doi.org/10.1002/jcd.20067openalex-snapshot
Covering arrays of higher strength from permutation vectors
inferred← citeshttps://doi.org/10.1002/jcd.21657openalex-snapshot
Two‐stage algorithms for covering array construction
inferred← citeshttps://doi.org/10.1002/jcd.21671openalex-snapshot
On the structure of small strength‐2 covering arrays
inferred← citeshttps://doi.org/10.1002/jcd.70022openalex-snapshot
Lower Bounds and Construction of Detecting Arrays
inferred← citeshttps://doi.org/10.1002/qre.2176openalex-snapshot
A graph‐based postoptimization approach for covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-27060-9_13openalex-snapshot
A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_34openalex-snapshot
Partial Covering Arrays: Algorithms and Asymptotics
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-15108-8_10openalex-snapshot
Verification of General and Cyclic Covering Arrays Using Grid Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-34654-5_62openalex-snapshot
Constructing Real Test-Suites Using an Enhanced Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-81-322-2452-5_26openalex-snapshot
Covering Arrays of Strength Four and Software Testing
inferred← citeshttps://doi.org/10.1007/s00373-017-1861-9openalex-snapshot
Improved Strength Four Covering Arrays with Three Symbols
inferred← citeshttps://doi.org/10.1007/s10601-006-7094-9openalex-snapshot
Constraint Models for the Covering Test Problem
inferred← citeshttps://doi.org/10.1007/s10623-004-3804-8openalex-snapshot
Bounds for Covering Codes over Large Alphabets
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-017-0369-xopenalex-snapshot
Asymptotic and constructive methods for covering perfect hash families and covering arrays
inferred← citeshttps://doi.org/10.1007/s11590-016-1012-xopenalex-snapshot
A two-stage algorithm for combinatorial testing
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.2007.07.050openalex-snapshot
Strength two covering arrays: Existence tables and projection
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.026openalex-snapshot
Cover starters for covering arrays of strength two
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.ins.2013.03.002openalex-snapshot
A novel selection evolutionary strategy for constrained optimization
inferred← citeshttps://doi.org/10.1080/15598608.2013.781461openalex-snapshot
Resolvable Covering Arrays
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/cit.2016.89openalex-snapshot
Generating Test Suites with High 3-Way Coverage for Software Testing
inferred← citeshttps://doi.org/10.1109/icsengt.2017.8123413openalex-snapshot
Fuzzy adaptive teaching learning-based optimization strategy for pairwise testing
inferred← citeshttps://doi.org/10.1109/itng.2012.44openalex-snapshot
Software Testing with Budget Constraints
inferred← citeshttps://doi.org/10.1109/iwsda50346.2022.9870453openalex-snapshot
Equivalence Classes and Balance Properties of Interleaved Sequences
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.22openalex-snapshot
A Parameter Free Choice Function Based Hyper-Heuristic Strategy for Pairwise Test Generation
inferred← citeshttps://doi.org/10.1109/tit.2011.2159478openalex-snapshot
Two New Measures for Permutations: Ambiguity and Deficiency
inferred← citeshttps://doi.org/10.1134/s0361768811030029openalex-snapshot
A survey of methods for constructing covering arrays
inferred← citeshttps://doi.org/10.1137/16m1067767openalex-snapshot
Upper Bounds on the Size of Covering Arrays
inferred← citeshttps://doi.org/10.1142/s0218194018500377openalex-snapshot
Research Notes: Binary Test-Suites Using Covering Arrays
inferred← citeshttps://doi.org/10.1155/2012/897027openalex-snapshot
New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing
inferred← citeshttps://doi.org/10.14569/ijacsa.2015.061234openalex-snapshot
A New Algorithm for Post-Processing Covering Arrays
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.2227openalex-snapshot
3-Way Software Testing with Budget Constraints
inferred← citeshttps://doi.org/10.19053/01211129.v25.n43.2016.5295openalex-snapshot
Metaheuristic algorithms for building Covering Arrays: A review
inferred← citeshttps://doi.org/10.20381/ruor-12082openalex-snapshot
Mixed covering arrays on graphs and tabu search algorithms
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.20381/ruor-5542openalex-snapshot
Graph-dependent Covering Arrays and LYM Inequalities
inferred← citeshttps://doi.org/10.22215/etd/2009-09116openalex-snapshot
Projection - product and asymptotic constructions of mixed level covering arrays
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.22215/etd/2017-11936openalex-snapshot
Covering Arrays from Maximal Sequences over Finite Fields
inferred← citeshttps://doi.org/10.22215/etd/2018-13204openalex-snapshot
Properties of Interleaved Sequences Created from M-Sequences
inferred← citeshttps://doi.org/10.4995/thesis/10251/17027openalex-snapshot
Constructing Covering Arrays using Parallel Computing and Grid Computing
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.