From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “combinatorial testing” 35

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Generation of Invalid Test Inputs from Over-Constrained Test Models for Combinatorial Robustness Testing
2020 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) conference-paper Computer Science Software Testing and Debugging Techniques

Konrad Fögen, Horst Lichter

1

citations
Combinatorial robustness testing based on error-constraints
2021 RWTH Publications (RWTH Aachen) book Computer Science Software Testing and Debugging Techniques Open access

Konrad Fögen

0

citations
An Industrial Case Study on Fault Detection Effectiveness of Combinatorial Robustness Testing
2020 CEUR Workshop Proceedings article Computer Science Software Testing and Debugging Techniques Open access

Konrad Fögen, Horst Lichter

1

citations
Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Massimiliano Incudini, Casper Gyurik, Riccardo Molteni, Vedran Dunjko

0

citations
Upper and Lower Bounds for Competitive Group Testing
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Robert Scheidweiler, Eberhard Triesch

0

citations
Upper and lower bounds for competitive group testing
2023 Discrete Applied Mathematics article Computer Science Optimization and Search Problems

Robert Scheidweiler, Eberhard Triesch

1

citations
Isomorphism Testing Parameterized by Genus and Beyond
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Neuen

4

citations
A Comparison Infrastructure for Fault Characterization Algorithms
2020 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) conference-paper Computer Science Software Testing and Debugging Techniques

Torben Friedrichs, Konrad Fögen, Horst Lichter

3

citations
A decomposition-compatible canonization framework for the graph isomorphism problem
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Graph Theory and Algorithms Open access

Daniel Wiebking

0

citations
A novel surrogate-assisted evolutionary algorithm applied to partition-based ensemble learning
2021 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access cited by 2 patents

Arkadiy Dushatskiy, Tanja Alderliesten, Peter A. N. Bosman

13

citations
Deep Weisfeiler Leman
2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Pascal Schweitzer, Daniel Wiebking

6

citations
A Practical, Progressively-Expressive GNN
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Lingxiao Zhao, Louis Härtel, Neil Shah, Leman Akoglu

3

citations
Quantum annealing for industry applications: introduction and review
2022 Reports on Progress in Physics article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 7 patents

Sheir Yarkoni, Elena Raponi, Thomas Bäck

331

citations
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction
2023 International Joint Conference on Artificial Intelligence conference-paper Computer Science Constraint Satisfaction and Optimization Open access

Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe

15

citations
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer

7

citations
Multi-surrogate Assisted Efficient Global Optimization for Discrete Problems
2022 IEEE Symposium Series on Computational Intelligence (SSCI) conference-paper Computer Science Advanced Multi-Objective Optimization Algorithms

Qi Huang, Roy de Winter, Bas van Stein, Thomas Bäck, Anna V. Kononova

2

citations
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction
2022 arXiv (Cornell University) preprint Computer Science Constraint Satisfaction and Optimization Open access

Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe

1

citations
Multi-surrogate Assisted Efficient Global Optimization for Discrete Problems
2022 arXiv (Cornell University) preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Qi Huang, Roy de Winter, Bas van Stein, Thomas Bäck, Anna V. Kononova

0

citations
Quantum Topological Data Encoding
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Adam Wesołowski, Dimitrios Thanos, Daniel Leykam, Lirandë Pira

0

citations
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk)
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Graph Theory and Algorithms Open access

Martin Grohe

0

citations
End-to-end quantum algorithm for topology optimization in structural mechanics
2026 Quantum Science and Technology article Computer Science Quantum Computing Algorithms and Architecture Open access

Leonhard Hölscher, Oliver Ahrend, Lukas Karch, Carlotta L'Estocq, Marc Marfany Andreu, Tobias Stollenwerk, +2 more

1

citations
Canonisation and Definability for Graphs of Bounded Rank Width
2022 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

7

citations
Fine-grained Expressivity of Graph Neural Networks
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Jan Böker, Ron Levie, Ningyuan Teresa Huang, Soledad Villar

4

citations
Combined Task and Motion Planning via Sketch Decompositions
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science AI-based Problem Solving and Planning Open access

Magi Dalmau Moreno, Néstor García, Vicenç Gómez, Héctor Geffner

1

citations
Combined Task and Motion Planning Via Sketch Decompositions (Extended Version with Supplementary Material)
2024 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Magí Dalmau, Néstor García, Vicenç Gómez, Héctor Geffner

0

citations