On the public citation graph
Locating one pairwise interaction: Three recursive constructions
0 signed · 23 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.20065openalex-snapshot
Products of mixed covering arrays of strength two
inferredcites →https://doi.org/10.1007/0-387-25036-0_10openalex-snapshot
Software and Hardware Testing Using Combinatorial Covering Suites
inferredcites →https://doi.org/10.1007/s10623-004-3991-3openalex-snapshot
Cyclic Difference Packing and Covering Arrays
inferredcites →https://doi.org/10.1007/s10623-006-0020-8openalex-snapshot
Roux-type constructions for covering arrays of strengths three and four
inferredcites →https://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
inferredcites →https://doi.org/10.1007/s11425-011-4307-5openalex-snapshot
Optimal locating arrays for at most two faults
inferredcites →https://doi.org/10.1016/j.disc.2006.06.036openalex-snapshot
Constructing strength three covering arrays with augmented annealing
inferredcites →https://doi.org/10.1080/15598608.2012.647484openalex-snapshot
Optimality and Constructions of Locating Arrays
inferredcites →https://doi.org/10.1137/080730706openalex-snapshot
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
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-319-94667-2_29openalex-snapshot
Separating Interaction Effects Using Locating and Detecting Arrays
inferred← citeshttps://doi.org/10.1007/s11786-018-0385-xopenalex-snapshot
On a Combinatorial Framework for Fault Characterization
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.1016/j.infsof.2020.106346openalex-snapshot
Using simulated annealing for locating array construction
inferred← citeshttps://doi.org/10.1016/j.jss.2020.110771openalex-snapshot
Constrained locating arrays for combinatorial interaction testing
inferred← citeshttps://doi.org/10.1080/00224065.2023.2220973openalex-snapshot
Scalable level-wise screening experiments using locating arrays
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/icstw.2016.38openalex-snapshot
Coverage, Location, Detection, and Measurement
inferred← citeshttps://doi.org/10.1109/icstw.2019.00056openalex-snapshot
Partitioned Search with Column Resampling for Locating Array Construction
inferred← citeshttps://doi.org/10.1109/prdc.2018.00044openalex-snapshot
Deriving Fault Locating Test Cases from Constrained Covering Arrays
inferred← citeshttps://doi.org/10.1587/transfun.2020eal2081openalex-snapshot
Upper Bounds and Constructions of Locating Arrays
inferred← citeshttps://doi.org/10.3390/math8050831openalex-snapshot
Locating Arrays with Mixed Alphabet Sizes
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.