On the public citation graph
Mixed covering arrays on graphs
0 signed · 38 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.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferredcites →https://doi.org/10.1002/jcd.20065openalex-snapshot
Products of mixed covering arrays of strength two
inferredcites →https://doi.org/10.1016/j.disc.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
inferredcites →https://doi.org/10.1016/j.materresbull.2003.10.010openalex-snapshot
Experimental Design for Combinatorial and High Throughput Materials Development
inferredcites →https://doi.org/10.1021/ar000117sopenalex-snapshot
Experimental Strategies for Combinatorial and High-Throughput Materials Development
inferredcites →https://doi.org/10.1080/00401706.1998.10485524openalex-snapshot
Factor-Covering Designs for Testing Software
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/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/issre.1996.558835openalex-snapshot
A practical strategy for testing pair-wise coverage of network interfaces
inferredcites →https://doi.org/10.1109/qsic.2003.1319088openalex-snapshot
Generating small combinatorial test suites to cover input-output relationships
inferredcites →https://doi.org/10.1109/wift.1998.766301openalex-snapshot
AETG/sup SM/ Web: a Web based service for automatic efficient test generation from functional requirements
inferredcites →https://doi.org/10.20381/ruor-19660openalex-snapshot
Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-32112-2_39openalex-snapshot
Mixed Covering Arrays on Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1800-9openalex-snapshot
Covering Arrays on Product Graphs
inferred← citeshttps://doi.org/10.1007/s00373-024-02813-5openalex-snapshot
Covering Array on the Cartesian Product of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-03007-3openalex-snapshot
Mixed Covering Arrays on Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10623-011-9565-2openalex-snapshot
Divisibility of polynomials over finite fields and combinatorial applications
inferred← citeshttps://doi.org/10.1007/s10623-013-9835-2openalex-snapshot
A construction for strength-3 covering arrays from linear feedback shift register sequences
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.jspi.2011.05.018openalex-snapshot
Mixed covering arrays of strength three with few factors
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.057openalex-snapshot
Covering arrays avoiding forbidden edges
inferred← citeshttps://doi.org/10.1080/09728600.2022.2081523openalex-snapshot
A hyperedge coloring and application in combinatorial testing
inferred← citeshttps://doi.org/10.1088/1757-899x/715/1/012026openalex-snapshot
Statistical testing data generation for UAS
inferred← citeshttps://doi.org/10.1109/qsic.2010.36openalex-snapshot
Adaptive Interaction Fault Location Based on Combinatorial Testing
inferred← citeshttps://doi.org/10.1142/s1793830921500853openalex-snapshot
Mixed covering arrays on graphs of small treewidth
inferred← citeshttps://doi.org/10.20381/ruor-12082openalex-snapshot
Mixed covering arrays on graphs and tabu search algorithms
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03497openalex-snapshot
Combinatorial Testing: Principles and Methods
inferred← citeshttps://doi.org/10.3934/era.2025292openalex-snapshot
Mixed-level detecting arrays on graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07393openalex-snapshot
Mixed Covering Arrays on 3-Uniform Hypergraphs
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.