VLDB 2026 Research / reviewers in the wild / expert
Ludwig Kampel
dblp:187/2686
· DBLP profile ↗
8ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0002-1870-5143ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 1 first-author · 2 since 2021Theory of computation · 3 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Estimating Combinatorial t-Way Coverage Based on Matrix Complexity Metrics
Luiza Corpaci, Michael Wagner 0026, Sebastian Raubitzek, Ludwig Kampel, Kevin Mallinger, Dimitris E. Simos |
ICTSS | 4 |
| 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 0026, Christoph Wech, Jovan Zivanovic, Dimitris E. Simos |
ICTSS | 2 |
| 2022 | IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract)abstractCovering arrays (CAs) are discrete objects appearing in combinatorial design theory that find practical applications, most prominently in software testing. The generation of optimized CAs is a difficult combinatorial optimization problem being subject to ongoing research. Previous studies have shown that many different algorithmic approaches are best suited for different instances of CAs. In this extended abstract we describe the IPO-MAXSAT algorithm, which adopts the prominent IPO strategy for CA generation and uses MaxSAT solving to optimize the occurring sub-problems. Irene Hiess, Ludwig Kampel, Michael Wagner 0026, Dimitris E. Simos |
SOCS | 2 |
| 2021 | Heuristically Enhanced IPO Algorithms for Covering Array Generation
Michael Wagner 0026, Ludwig Kampel, Dimitris E. Simos |
IWOCA | 2 |
| 2019 | Knowledge Extraction for Cryptographic Algorithm Validation Test Vectors by Means of Combinatorial Coverage Measurement
Dimitris E. Simos, Bernhard Garn, Ludwig Kampel, D. Richard Kuhn, Raghu Kacker |
CD-MAKE | 3 |
| 2019 | Problems and algorithms for covering arrays via set covers
Ludwig Kampel, Manuel Leithner, Bernhard Garn, Dimitris E. Simos |
Theor. Comput. Sci. | 1 |
| 2019 | A survey on the state of the art of complexity problems for covering arrays
Ludwig Kampel, Dimitris E. Simos |
Theor. Comput. Sci. | 1 |
| 2016 | Set-Based Algorithms for Combinatorial Test Set Generation
Ludwig Kampel, Dimitris E. Simos |
ICTSS | 1 |