On the public citation graph
A density‐based greedy algorithm for higher strength covering arrays
0 signed · 151 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.20067openalex-snapshot
Covering arrays of higher strength from permutation vectors
inferredcites →https://doi.org/10.1002/stvr.299openalex-snapshot
Applying simulation and design of experiments to the embedded software testing process
inferredcites →https://doi.org/10.1002/stvr.319openalex-snapshot
Combination testing strategies: a survey
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
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/11402763_13openalex-snapshot
Constraint-Based Approaches to the Covering Test Problem
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/s10623-006-0020-8openalex-snapshot
Roux-type constructions for covering arrays of strengths three and four
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/0166-218x(83)90072-0openalex-snapshot
On qualitatively independent partitions and related problems
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.1016/j.infsof.2006.03.004openalex-snapshot
Prioritized interaction testing for pair-wise coverage with seeding and constraints
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/b:desi.0000029232.40302.6dopenalex-snapshot
On t-Covering Arrays
inferredcites →https://doi.org/10.1109/18.556707openalex-snapshot
On greedy algorithms in coding theory
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/tse.2003.1232283openalex-snapshot
Efficient evaluation of multifactor dependent system performance using fractional factorial design
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1109/tse.2006.8openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1145/1062455.1062495openalex-snapshot
A framework of greedy methods for constructing interaction test suites
inferredcites →https://doi.org/10.1145/253228.253271openalex-snapshot
Applying design of experiments to software 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.21657openalex-snapshot
Two‐stage algorithms for covering array construction
inferred← citeshttps://doi.org/10.1002/jcd.21876openalex-snapshot
Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
inferred← citeshttps://doi.org/10.1002/stvr.1486openalex-snapshot
A Hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering
inferred← citeshttps://doi.org/10.1002/stvr.1689openalex-snapshot
Approaches for computing test‐case‐aware covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-030-04491-6_2openalex-snapshot
Memetic Algorithm for Constructing Covering Arrays of Variable Strength Based on Global-Best Harmony Search and Simulated Annealing
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-030-21363-3_15openalex-snapshot
Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_29openalex-snapshot
Algorithms for Constructing Anonymizing Arrays
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_40openalex-snapshot
Heuristically Enhanced IPO Algorithms for Covering Array Generation
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/978-3-642-01877-0_3openalex-snapshot
Binary Covering Arrays and Existentially Closed Graphs
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-15585-7_6openalex-snapshot
Bad Pairs in Software Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-22203-0_1openalex-snapshot
Practical Adoptions of T-Way Strategies for Interaction Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_12openalex-snapshot
Efficient Conditional Expectation Algorithms for Constructing Hash Families
inferred← citeshttps://doi.org/10.1007/978-3-642-32541-0_1openalex-snapshot
Constraints Dependent T-Way Test Suite Generation Using Harmony Search Strategy
inferred← citeshttps://doi.org/10.1007/s00500-021-05788-0openalex-snapshot
GALP: a hybrid artificial intelligence algorithm for generating covering array
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/s10623-016-0316-2openalex-snapshot
Covering arrays from m-sequences and character sums
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/s10878-022-00947-xopenalex-snapshot
Algorithmic methods for covering arrays of higher index
inferred← citeshttps://doi.org/10.1007/s11219-011-9160-9openalex-snapshot
Pairwise testing for software product lines: comparison of two approaches
inferred← citeshttps://doi.org/10.1007/s11390-015-1574-6openalex-snapshot
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1007/s11590-019-01459-0openalex-snapshot
Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
inferred← citeshttps://doi.org/10.1007/s11786-017-0326-0openalex-snapshot
An Efficient Design and Implementation of the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1007/s11786-018-0385-xopenalex-snapshot
On a Combinatorial Framework for Fault Characterization
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/bs.adcom.2021.01.002openalex-snapshot
Evaluating software testing techniques: A systematic mapping study
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126952openalex-snapshot
In-Parameter-Order strategies for covering perfect hash families
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.11.029openalex-snapshot
Application of Particle Swarm Optimization to uniform and variable strength covering array construction
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.08.022openalex-snapshot
Using simulated annealing for computing cost-aware covering arrays
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.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.endm.2018.02.014openalex-snapshot
Covering Arrays via Set Covers
inferred← citeshttps://doi.org/10.1016/j.endm.2018.02.019openalex-snapshot
The Lovász Local Lemma and Variable Strength Covering Arrays
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105202openalex-snapshot
Detecting arrays for effects of multiple interacting factors
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.11.007openalex-snapshot
Practical minimization of pairwise-covering test configurations using constraint programming
inferred← citeshttps://doi.org/10.1016/j.infsof.2017.10.007openalex-snapshot
A tuned version of genetic algorithm for efficient test suite generation in interactive t -way testing strategy
inferred← citeshttps://doi.org/10.1016/j.infsof.2026.108255openalex-snapshot
An effective covering array generation algorithm based on rollback and candidate-based test case removal strategies
inferred← citeshttps://doi.org/10.1016/j.ins.2011.01.002openalex-snapshot
Design and implementation of a t-way test data generation strategy with automated execution tool support
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.020openalex-snapshot
New bounds for binary covering arrays using simulated annealing
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.jda.2012.04.004openalex-snapshot
Strengthening hash families and compressive sensing
inferred← citeshttps://doi.org/10.1016/j.jspi.2008.05.020openalex-snapshot
Tabu search for covering arrays using permutation vectors
inferred← citeshttps://doi.org/10.1016/j.jss.2011.06.004openalex-snapshot
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1016/j.jss.2014.08.005openalex-snapshot
PROW: A Pairwise algorithm with constRaints, Order and Weight
inferred← citeshttps://doi.org/10.1016/j.jss.2014.09.001openalex-snapshot
Generating combinatorial test suite using combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.383openalex-snapshot
Populations of Models, Experimental Designs and Coverage of Parameter Space by Latin Hypercube and Orthogonal Sampling
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.018openalex-snapshot
Problems and algorithms for covering arrays via set covers
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.019openalex-snapshot
A survey on the state of the art of complexity problems for covering arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.022openalex-snapshot
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
inferred← citeshttps://doi.org/10.1038/s41467-026-68532-yopenalex-snapshot
On the fundamental resource for exponential advantage in quantum channel learning
inferred← citeshttps://doi.org/10.1049/iet-sen.2018.5005openalex-snapshot
Adapting the elitism on greedy algorithm for variable strength combinatorial test cases generation
inferred← citeshttps://doi.org/10.1080/10556788.2021.1907384openalex-snapshot
A primer on the application of neural networks to covering array generation
inferred← citeshttps://doi.org/10.1080/15598608.2012.647489openalex-snapshot
Improving Two Recursive Constructions for Covering Arrays
inferred← citeshttps://doi.org/10.1093/comjnl/bxaa020openalex-snapshot
Covering Array Constructors: An Experimental Analysis of Their Interaction Coverage and Fault Detection
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/access.2021.3087165openalex-snapshot
A Comparison of Fault Detection Efficiency Between Adaptive Random Testing and Greedy Combinatorial Testing for Control Logics in Nuclear Industrial Distributed Control Systems
inferred← citeshttps://doi.org/10.1109/ase.2015.61openalex-snapshot
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T)
inferred← citeshttps://doi.org/10.1109/cec.2010.5586148openalex-snapshot
Simulated Annealing for constructing binary covering arrays of variable strength
inferred← citeshttps://doi.org/10.1109/compsac.2010.17openalex-snapshot
Applying Particle Swarm Optimization to Pairwise Testing
inferred← citeshttps://doi.org/10.1109/compsac.2013.32openalex-snapshot
Evaluation and Analysis of Spectrum-Based Fault Localization with Modified Similarity Coefficients for Software Debugging
inferred← citeshttps://doi.org/10.1109/compsac.2013.84openalex-snapshot
Prioritizing Variable-Strength Covering Array
inferred← citeshttps://doi.org/10.1109/ecbs.2011.9openalex-snapshot
Finding Interaction Faults Adaptively Using Distance-Based Strategies
inferred← citeshttps://doi.org/10.1109/gi52543.2021.00017openalex-snapshot
A Permutation Representation of Covering Arrays
inferred← citeshttps://doi.org/10.1109/ic3.2014.6897246openalex-snapshot
Integrating greedy based approach with genetic algorithm to generate mixed covering arrays for pair-wise testing
inferred← citeshttps://doi.org/10.1109/icse43902.2021.00030openalex-snapshot
AutoCCAG: An Automated Approach to Constrained Covering Array Generation
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00113openalex-snapshot
Towards High-Strength Combinatorial Interaction Testing for Highly Configurable Software Systems
inferred← citeshttps://doi.org/10.1109/icsecs.2015.7333101openalex-snapshot
A variable combinatorial test suite strategy based on modified greedy algorithm
inferred← citeshttps://doi.org/10.1109/icsess.2012.6269509openalex-snapshot
Sole error locating array and approximate error locating array
inferred← citeshttps://doi.org/10.1109/icstw.2016.38openalex-snapshot
Coverage, Location, Detection, and Measurement
inferred← citeshttps://doi.org/10.1109/icstw.2016.7openalex-snapshot
Towards Automatic Cost Model Discovery for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/icstw.2017.35openalex-snapshot
A Model for T-Way Fault Profile Evolution during Testing
inferred← citeshttps://doi.org/10.1109/icstw.2019.00060openalex-snapshot
Using Parameter Mapping to Avoid Forbidden Tuples in a Covering Array
inferred← citeshttps://doi.org/10.1109/isci.2011.5958995openalex-snapshot
On sequence based interaction testing
inferred← citeshttps://doi.org/10.1109/isiea.2009.5356419openalex-snapshot
Assessing combinatorial interaction strategy for reverse engineering of combinational circuits
inferred← citeshttps://doi.org/10.1109/mitp.2008.54openalex-snapshot
Practical Combinatorial Testing: Beyond Pairwise
inferred← citeshttps://doi.org/10.1109/qrs54544.2021.00029openalex-snapshot
Application of Combinatorial Testing to Quantum Programs
inferred← citeshttps://doi.org/10.1109/qsic.2010.36openalex-snapshot
Adaptive Interaction Fault Location Based on Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/qsic.2014.15openalex-snapshot
General Optimization Strategies for Refining the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1109/tse.2012.65openalex-snapshot
Test Case-Aware Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/tse.2013.53openalex-snapshot
Reducing Masking Effects in CombinatorialInteraction Testing: A Feedback DrivenAdaptive Approach
inferred← citeshttps://doi.org/10.1109/tse.2019.2955687openalex-snapshot
Comparative Analysis of Constraint Handling Techniques for Constrained Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tse.2021.3065950openalex-snapshot
Combinatorial Test Generation for Multiple Input Models With Shared Parameters
inferred← citeshttps://doi.org/10.1109/tse.2024.3419919openalex-snapshot
A Scalable t-Wise Coverage Estimator: Algorithms and Applications
inferred← citeshttps://doi.org/10.1137/080730706openalex-snapshot
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
inferred← citeshttps://doi.org/10.1137/16m1067767openalex-snapshot
Upper Bounds on the Size of Covering Arrays
inferred← citeshttps://doi.org/10.1142/s1793830914500347openalex-snapshot
Covering arrays, augmentation, and quilting arrays
inferred← citeshttps://doi.org/10.1145/3688836openalex-snapshot
Solving the t -Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
inferred← citeshttps://doi.org/10.1145/3832783.3834349openalex-snapshot
DynCA: An Effective Algorithm for 3-Wise Combinatorial Interaction Testing in Highly Configurable Systems
inferred← citeshttps://doi.org/10.1155/2010/323429openalex-snapshot
A Strategy for Automatic Quality Signing and Verification Processes for Hardware and Software Testing
inferred← citeshttps://doi.org/10.1155/2014/843248openalex-snapshot
Adaptive Random Testing with Combinatorial Input Domain
inferred← citeshttps://doi.org/10.1371/journal.pone.0189283openalex-snapshot
Optimal shortening of uniform covering arrays
inferred← citeshttps://doi.org/10.14257/ijca.2016.9.12.04openalex-snapshot
Automatic Test Case Generation and Optimization Strategies based on Components with Sequential Constraints
inferred← citeshttps://doi.org/10.14569/ijacsa.2019.0100431openalex-snapshot
ABCVS: An Artificial Bee Colony for Generating Variable T-Way Test Sets
inferred← citeshttps://doi.org/10.1561/0100000044openalex-snapshot
Combinatorial Designs for Authentication and Secrecy Codes
inferred← citeshttps://doi.org/10.18293/seke2018-139openalex-snapshot
A Revisit of Fault-Detecting Probability of Combinatorial Testing for Boolean-Specifications (P)
inferred← citeshttps://doi.org/10.21123/bsj.2020.17.3(suppl.).1002openalex-snapshot
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm
inferred← citeshttps://doi.org/10.2172/1606019openalex-snapshot
REALIZATION OF A AUTOMATED T-WAY COMBINATORIAL TESTING APPROACH FOR A SOFTWARE BASED EMBEDDED DIGITAL DEVICE
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/2017-11952openalex-snapshot
An Analysis and Extension of Category Partition Testing in the Presence of Constraints
inferred← citeshttps://doi.org/10.23940/ijpe.18.06.p19.12831290openalex-snapshot
Combinatorial Test Case Prioritization based on Incremental Combinatorial Coverage Strength
inferred← citeshttps://doi.org/10.23940/ijpe.19.11.p14.29522961openalex-snapshot
Fault Detection Capabilities of Combinatorial Testing and Random Testing for Boolean-Specifications
inferred← citeshttps://doi.org/10.23940/ijpe.21.01.p11.114122openalex-snapshot
Comparing Fault Detection Efficiencies of Adaptive Random Testing and Greedy Combinatorial Testing for Boolean-Specifications
inferred← citeshttps://doi.org/10.24203/ijcit.v9i4.23openalex-snapshot
PWiseHA: Application of Harmony Search Algorithm for Test Suites Generation using Pairwise Techniques
inferred← citeshttps://doi.org/10.32920/ryerson.14661957openalex-snapshot
Error locating: degree constraints
inferred← citeshttps://doi.org/10.32920/ryerson.14661957.v1openalex-snapshot
Error locating: degree constraints
inferred← citeshttps://doi.org/10.3390/eng4010032openalex-snapshot
Covering Arrays ML HPO for Static Malware Detection
inferred← citeshttps://doi.org/10.3390/telecom4020015openalex-snapshot
Deep Learning Optimisation of Static Malware Detection with Grid Search and Covering Arrays
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2011.01126openalex-snapshot
Locating Error Interactions Based on Partial Covering Array
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2011.01509openalex-snapshot
An Adaptive Algorithm of Locating Fault Interactions Based Combinatorial Testing
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.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.4018/978-1-60566-731-7.ch014openalex-snapshot
Combinatorial Testing
inferred← citeshttps://doi.org/10.4218/etrij.10.0109.0266openalex-snapshot
MC-MIPOG: A Parallel t-Way Test Generation Strategy for Multicore Systems
inferred← citeshttps://doi.org/10.5815/ijitcs.2015.10.04openalex-snapshot
Construction of Strength Two Mixed Covering Arrays Using Greedy Mutation in Genetic Algorithm
inferred← citeshttps://doi.org/10.5897/sre10.1196openalex-snapshot
ITTDG: Integrated T-way test data generation strategy for interaction testing
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.