How to Use Boltzmann Machines and Neural Networks for Covering Array Generation. - Ludwig Kampel; Michael Wagner 026; Ilias S. Kotsireas; Dimitris E. Simos (LION, 2019)

IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation. - Michael Wagner 026; Ludwig Kampel; Dimitris E. Simos (MACIS, 2019)

Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength. - Michael Wagner 026; Ludwig Kampel; Dimitris E. Simos (SEA², 2019)

CAGEN: A fast combinatorial test generation tool with support for constraints and higher-index arrays. - Michael Wagner 026; Kristoffer Kleine; Dimitris E. Simos; Rick Kuhn; Raghu Kacker (ICST Workshops, 2020)

Heuristically Enhanced IPO Algorithms for Covering Array Generation. - Michael Wagner 026; Ludwig Kampel; Dimitris E. Simos (IWOCA, 2021)

Developing multithreaded techniques and improved constraint handling for the tool CAgen. - Michael Wagner 026; Manuel Leithner; Dimitris E. Simos; Rick Kuhn; Raghu Kacker (ICST Workshops, 2022)

IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract). - Irene Hiess; Ludwig Kampel; Michael Wagner 026; Dimitris E. Simos (SOCS, 2022)

IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation. - Irene Hiess; Ludwig Kampel; Michael Wagner 026; Dimitris E. Simos (SYNASC, 2022)

In-Parameter-Order strategies for covering perfect hash families. - Michael Wagner 026; Charles J. Colbourn; Dimitris E. Simos (Appl. Math. Comput., 2022)

A primer on the application of neural networks to covering array generation. - Ludwig Kampel; Michael Wagner 026; Ilias S. Kotsireas; Dimitris E. Simos (Optim. Methods Softw., 2022)

Applying CT-FLA for AEB Function Testing: A Virtual Driving Case Study. - Ludwig Kampel; Michael Wagner 026; Dimitris E. Simos; Mihai Nica; Dino Dodig; David Kaufmann; Franz Wotawa (ICSTW, 2023)

Summary of In-Parameter-Order strategies for covering perfect hash families. - Michael Wagner 026; Charles J. Colbourn; Dimitris E. Simos (ICSTW, 2023)

Applying Pairwise Combinatorial Testing to Large Language Model Testing. - Bernhard Garn; Ludwig Kampel; Manuel Leithner; Berina Celic; Ceren Çulha; Irene Hiess; Klaus Kieseberg; Marlene Koelbing; Dominik-Philip Schreiber; Michael Wagner 026; Christoph Wech; Jovan Zivanovic; et al. (ICTSS, 2023)

Algorithmic methods for covering arrays of higher index. - Ryan E. Dougherty; Kristoffer Kleine; Michael Wagner 026; Charles J. Colbourn; Dimitris E. Simos (J. Comb. Optim., 2023)

Algorithmic Optimizations for Deriving Minimal Forbidden Tuples. - Michael Wagner 026; Irene Hiess; Ludwig Kampel; Dimitris E. Simos; Yu Lei (ICSTW, 2024)

Estimating Combinatorial t-Way Coverage Based on Matrix Complexity Metrics. - Luiza Corpaci; Michael Wagner 026; Sebastian Raubitzek; Ludwig Kampel; Kevin Mallinger; Dimitris E. Simos (ICTSS, 2024)

State of the CArt: evaluating covering array generators at scale. - Manuel Leithner; Andrea Bombarda; Michael Wagner 026; Angelo Gargantini; Dimitris E. Simos (Int. J. Softw. Tools Technol. Transf., 2024)