On the public citation graph
Covering arrays with mixed alphabet sizes
0 signed · 84 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/978-0-387-35516-0_4openalex-snapshot
Determination of Test Configurations for Pair-Wise Interaction Coverage
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
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/0097-3165(89)90081-2openalex-snapshot
On the maximum number of qualitatively independent partitions
inferredcites →https://doi.org/10.1016/0097-3165(92)90016-nopenalex-snapshot
Qualitative independence and Sperner problems for directed graphs
inferredcites →https://doi.org/10.1016/0097-3165(94)90108-2openalex-snapshot
Capacities: From information theory to extremal set theory
inferredcites →https://doi.org/10.1016/0166-218x(83)90072-0openalex-snapshot
On qualitatively independent partitions and related problems
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.1080/03610929908832429openalex-snapshot
Small orthogonal main effect plans with four factors
inferredcites →https://doi.org/10.1090/s0002-9904-1974-13379-3openalex-snapshot
Self-orthogonal latin squares of all orders 𝑛≠2,3,6
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
inferredcites →https://doi.org/10.1201/9781420049954openalex-snapshot
CRC Handbook of Combinatorial Designs
inferredcites →https://doi.org/10.20381/ruor-11247openalex-snapshot
Software component interaction testing: Coverage measurement and generation of configurations.
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.20288openalex-snapshot
Generalized covering designs and clique coverings
inferred← citeshttps://doi.org/10.1002/jcd.70022openalex-snapshot
Lower Bounds and Construction of Detecting Arrays
inferred← citeshttps://doi.org/10.1002/spe.1017openalex-snapshot
Grammar‐based test generation with YouGen
inferred← citeshttps://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_44openalex-snapshot
Algorithms to Locate Errors Using Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_28openalex-snapshot
Covering Arrays Avoiding Forbidden Edges
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_32openalex-snapshot
Finding the Best CAFE Is NP-Hard
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-28765-7_79openalex-snapshot
Simulated Annealing 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-34654-5_62openalex-snapshot
Constructing Real Test-Suites Using an Enhanced Simulated Annealing
inferred← citeshttps://doi.org/10.1007/s00373-017-1800-9openalex-snapshot
Covering Arrays on Product Graphs
inferred← citeshttps://doi.org/10.1007/s00373-025-03007-3openalex-snapshot
Mixed Covering Arrays on Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10623-026-01863-5openalex-snapshot
Generalized group divisible covering designs
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/s42081-019-00056-wopenalex-snapshot
Arrays for combinatorial interaction testing: a review on constructive approaches
inferred← citeshttps://doi.org/10.1007/s42519-019-0062-7openalex-snapshot
Cost-Efficient Mixed-Level Covering Designs for Testing Experiments
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.04.010openalex-snapshot
The test suite generation problem: Optimal instances and their implications
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.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
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.jspi.2011.05.018openalex-snapshot
Mixed covering arrays of strength three with few factors
inferred← citeshttps://doi.org/10.1016/j.jss.2010.07.048openalex-snapshot
Two case studies in grammar-based test generation
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.057openalex-snapshot
Covering arrays avoiding forbidden edges
inferred← citeshttps://doi.org/10.1049/iet-sen.2012.0074openalex-snapshot
Metaheuristic approach for constructing functional test‐suites
inferred← citeshttps://doi.org/10.1080/03610926.2020.1722841openalex-snapshot
Lower bound and construction of mixed-level locating arrays
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/isit50566.2022.9834368openalex-snapshot
Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/taicpart.2009.35openalex-snapshot
Test Generation with Context Free Grammars and Covering Arrays
inferred← citeshttps://doi.org/10.1137/080730706openalex-snapshot
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
inferred← citeshttps://doi.org/10.1142/s1793830921500853openalex-snapshot
Mixed covering arrays on graphs of small treewidth
inferred← citeshttps://doi.org/10.1214/14-aos1228openalex-snapshot
Optimum mixed level detecting arrays
inferred← citeshttps://doi.org/10.1587/transfun.2021eap1071openalex-snapshot
An Improved Adaptive Algorithm for Locating Faulty Interactions in Combinatorial Testing
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1037openalex-snapshot
On the Construction of Variable Strength Orthogonal Arrays
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-19265openalex-snapshot
Covering arrays avoiding forbidden edges and edge clique covers
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.32920/ryerson.14662638openalex-snapshot
Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays
inferred← citeshttps://doi.org/10.32920/ryerson.14662638.v1openalex-snapshot
Combinatorial Constructions Of Ordered Orthogonal Arrays & Ordered Covering Arrays
inferred← citeshttps://doi.org/10.3390/math8050831openalex-snapshot
Locating Arrays with Mixed Alphabet Sizes
inferred← citeshttps://doi.org/10.3934/era.2025292openalex-snapshot
Mixed-level detecting arrays on graphs
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.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
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.