On the public citation graph
Products of mixed covering arrays of strength two
0 signed · 136 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(1998)6:6<411::aid-jcd3>3.0.co;2-iopenalex-snapshot
New techniques for designing qualitatively independent systems
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.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferredcites →https://doi.org/10.1002/jcd.20035openalex-snapshot
Group construction of covering arrays
inferredcites →https://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferredcites →https://doi.org/10.1016/0097-3165(89)90081-2openalex-snapshot
On the maximum number of qualitatively independent partitions
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.1023/b:desi.0000029232.40302.6dopenalex-snapshot
On t-Covering Arrays
inferredcites →https://doi.org/10.1104/pp.010683openalex-snapshot
Using Combinatorial Design to Study Regulation by Multiple Input Signals. A Tool for Parsimony in the Post-Genomics Era
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/32.979992openalex-snapshot
A test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/aero.2000.879426openalex-snapshot
Automating test case generation for the new generation mission software system
inferredcites →https://doi.org/10.1109/aiccsa.2001.934001openalex-snapshot
A measure for component interaction test coverage
inferredcites →https://doi.org/10.1109/cmpsac.2003.1245373openalex-snapshot
A variable strength interaction testing of components
inferredcites →https://doi.org/10.1109/icse.1997.610252openalex-snapshot
Applying Design of Experiments to Software Testing
inferredcites →https://doi.org/10.1109/icse.2003.1201186openalex-snapshot
Constructing test suites for interaction testing
inferredcites →https://doi.org/10.1109/issre.1996.558835openalex-snapshot
A practical strategy for testing pair-wise coverage of network interfaces
inferredcites →https://doi.org/10.1109/issre.2003.1251061openalex-snapshot
Augmenting simulated annealing to build interaction test suites
inferredcites →https://doi.org/10.1145/253228.253271openalex-snapshot
Applying design of experiments to software testing
inferredcites →https://doi.org/10.1145/302405.302640openalex-snapshot
Model-based testing in practice
inferredcites →https://doi.org/10.1201/9781420049954openalex-snapshot
CRC Handbook of Combinatorial Designs
inferredcites →https://doi.org/10.4064/aa-47-3-255-261openalex-snapshot
A polynomial representation for logarithms in GF(q)
inferredcites →https://doi.org/10.5555/776816.776822openalex-snapshot
Constructing test suites for interaction testing
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.20067openalex-snapshot
Covering arrays of higher strength from permutation vectors
inferred← citeshttps://doi.org/10.1002/jcd.20288openalex-snapshot
Generalized covering designs and clique coverings
inferred← citeshttps://doi.org/10.1002/jcd.21553openalex-snapshot
Asymptotic Size of Covering Arrays: An Application of Entropy Compression
inferred← citeshttps://doi.org/10.1002/jcd.21963openalex-snapshot
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences
inferred← citeshttps://doi.org/10.1002/qre.2129openalex-snapshot
Selecting the Best Wild Card Entries in a Covering Array
inferred← citeshttps://doi.org/10.1002/stvr.466openalex-snapshot
T‐wise combinatorial interaction test suites construction based on coverage inheritance
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_10openalex-snapshot
Detecting Arrays for Main Effects
inferred← citeshttps://doi.org/10.1007/978-3-319-18473-9_28openalex-snapshot
A Framework for Incremental Covering Arrays Construction
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-28865-9_42openalex-snapshot
An Effective t-way Test Data Generation Strategy
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-16561-0_36openalex-snapshot
Covering Arrays Generation Methods Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_17openalex-snapshot
Optimal Shortening of Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_18openalex-snapshot
An Exact Approach to Maximize the Number of Wild Cards in a Covering Array
inferred← citeshttps://doi.org/10.1007/978-3-642-28765-7_79openalex-snapshot
Simulated Annealing for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_15openalex-snapshot
MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-32112-2_39openalex-snapshot
Mixed Covering Arrays on Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_12openalex-snapshot
A Post-optimization Strategy for Combinatorial Testing: Test Suite Reduction through the Identification of Wild Cards and Merge of Rows
inferred← citeshttps://doi.org/10.1007/978-3-662-43429-1_2openalex-snapshot
Mathematical Construction Methods
inferred← citeshttps://doi.org/10.1007/978-981-10-4481-6_4openalex-snapshot
Test Algebra for Concurrent Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s00373-017-1800-9openalex-snapshot
Covering Arrays on Product Graphs
inferred← citeshttps://doi.org/10.1007/s00500-020-04769-zopenalex-snapshot
An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications
inferred← citeshttps://doi.org/10.1007/s10114-016-5049-7openalex-snapshot
Optimum detecting arrays for independent interaction faults
inferred← citeshttps://doi.org/10.1007/s10255-021-1006-zopenalex-snapshot
A Construction of Variable Strength Covering Arrays
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-008-9235-1openalex-snapshot
Covering arrays of strength 3 and 4 from holey difference matrices
inferred← citeshttps://doi.org/10.1007/s10623-011-9498-9openalex-snapshot
The equivalence between optimal detecting arrays and super-simple OAs
inferred← citeshttps://doi.org/10.1007/s10623-011-9505-1openalex-snapshot
Constructions of covering arrays of strength five
inferred← citeshttps://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
inferred← citeshttps://doi.org/10.1007/s11227-012-0763-0openalex-snapshot
Supercomputing and grid computing on the verification of covering arrays
inferred← citeshttps://doi.org/10.1007/s11425-011-4307-5openalex-snapshot
Optimal locating arrays for at most two faults
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/s42519-019-0075-2openalex-snapshot
Covering Arrays: Using Prior Information for Construction, Evaluation and to Facilitate Fault Localization
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.dam.2007.09.024openalex-snapshot
Merging covering arrays and compressing multiple sequence alignments
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.023openalex-snapshot
Mixed covering arrays on 3-uniform hypergraphs
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.2007.11.021openalex-snapshot
Optimal and near-optimal mixed covering arrays by column expansion
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.2018.05.047openalex-snapshot
A greedy-metaheuristic 3-stage approach to construct covering arrays
inferred← citeshttps://doi.org/10.1016/j.ins.2018.10.048openalex-snapshot
A greedy algorithm to construct covering arrays using a graph representation
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.03.013openalex-snapshot
On the existence of orthogonal arrays OA(3,5,4n+2)
inferred← citeshttps://doi.org/10.1016/j.jspi.2011.05.018openalex-snapshot
Mixed covering arrays of strength three with few factors
inferred← citeshttps://doi.org/10.1016/j.jspi.2024.106230openalex-snapshot
On schematic orthogonal arrays of high strength
inferred← citeshttps://doi.org/10.1016/j.jss.2008.02.034openalex-snapshot
A backtracking search tool for constructing combinatorial test suites
inferred← citeshttps://doi.org/10.1049/iet-sen.2012.0074openalex-snapshot
Metaheuristic approach for constructing functional test‐suites
inferred← citeshttps://doi.org/10.1049/iet-sen.2017.0107openalex-snapshot
Improved pairwise test suites for non‐prime‐power orders
inferred← citeshttps://doi.org/10.1049/iet-sen.2018.5141openalex-snapshot
Search‐based software engineering for constructing covering arrays
inferred← citeshttps://doi.org/10.1080/03610926.2016.1197253openalex-snapshot
Schematic saturated orthogonal arrays obtained by using the contractive replacement method
inferred← citeshttps://doi.org/10.1080/03610926.2020.1722841openalex-snapshot
Lower bound and construction of mixed-level locating arrays
inferred← citeshttps://doi.org/10.1080/03610926.2021.1953074openalex-snapshot
Schematic saturated orthogonal arrays obtained by using the expansive replacement method
inferred← citeshttps://doi.org/10.1080/03610926.2023.2279911openalex-snapshot
Revised schematic array
inferred← citeshttps://doi.org/10.1080/03610926.2024.2301979openalex-snapshot
Existence of schematic arrays under a novel criterion
inferred← citeshttps://doi.org/10.1080/15598608.2012.647484openalex-snapshot
Optimality and Constructions of Locating Arrays
inferred← citeshttps://doi.org/10.1080/15598608.2012.647489openalex-snapshot
Improving Two Recursive Constructions for Covering Arrays
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/compsacw.2013.25openalex-snapshot
Incrementally Applicable t-Wise Combinatorial Test Suites for High-Strength Interaction Testing
inferred← citeshttps://doi.org/10.1109/icise.2010.5690660openalex-snapshot
The design of test case based on combinatorial and orthogonal experiment
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/icstw.2009.7openalex-snapshot
IPO-s: Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays
inferred← citeshttps://doi.org/10.1109/issrew.2018.00-17openalex-snapshot
Evaluation and Construction of Covering Arrays Utilizing Prior Information
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/qsic.2006.31openalex-snapshot
Generating Optimal Test Set for Neighbor Factors Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tevc.2017.2747638openalex-snapshot
Constructing Cost-Aware Functional Test-Suites Using Nested Differential Evolution Algorithm
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/16m1056390openalex-snapshot
Disjoint Spread Systems and Fault Location
inferred← citeshttps://doi.org/10.1142/s1793830921500853openalex-snapshot
Mixed covering arrays on graphs of small treewidth
inferred← citeshttps://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferred← citeshttps://doi.org/10.1145/3329486.3329489openalex-snapshot
Debugging Machine Learning Pipelines
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.1186/s13638-023-02262-3openalex-snapshot
Measurement and evaluation method of radar anti-jamming effectiveness based on principal component analysis and machine learning
inferred← citeshttps://doi.org/10.1214/14-aos1228openalex-snapshot
Optimum mixed level detecting arrays
inferred← citeshttps://doi.org/10.13069/jacodesmath.17551openalex-snapshot
Locating one pairwise interaction: Three recursive constructions
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1012290openalex-snapshot
Heuristic energy-based cyclic peptide design
inferred← citeshttps://doi.org/10.1371/journal.pone.0189283openalex-snapshot
Optimal shortening of uniform covering arrays
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1037openalex-snapshot
On the Construction of Variable Strength Orthogonal Arrays
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.20381/ruor-5890openalex-snapshot
Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing
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.26493/2590-9770.1220.3a1openalex-snapshot
Subspace restrictions and affine composition for covering perfect hash families
inferred← citeshttps://doi.org/10.3390/math8050831openalex-snapshot
Locating Arrays with Mixed Alphabet Sizes
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03497openalex-snapshot
Combinatorial Testing: Principles and Methods
inferred← citeshttps://doi.org/10.3844/jcssp.2011.1375.1385openalex-snapshot
A Review of Covering Arrays and Their Application to Software Testing
inferred← citeshttps://doi.org/10.3923/jai.2011.156.165openalex-snapshot
The Development of a Particle Swarm Based Optimization Strategy for Pairwise Testing
inferred← citeshttps://doi.org/10.4018/978-1-4666-6026-7.ch018openalex-snapshot
T-Way Testing Strategies
inferred← citeshttps://doi.org/10.4018/978-1-5225-3923-0.ch084openalex-snapshot
T-Way Testing Strategies
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3804openalex-snapshot
Generalized covering designs and clique coverings
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07393openalex-snapshot
Mixed Covering Arrays on 3-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1606.01376openalex-snapshot
Universal Sets and Cover-Free Families
inferred← citeshttps://doi.org/10.48550/arxiv.2105.06058openalex-snapshot
DataExposer: Exposing Disconnect between Data and Systems
inferred← citeshttps://doi.org/10.4995/thesis/10251/17027openalex-snapshot
Constructing Covering Arrays using Parallel Computing and Grid Computing
inferred← citeshttps://doi.org/10.5772/36019openalex-snapshot
Using Grid Computing for Constructing Ternary Covering Arrays
inferred← citeshttps://doi.org/10.7763/ijcte.2011.v3.337openalex-snapshot
MIPOG - An Efficient t-Way Minimization Strategy for Combinatorial Testing
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.