Structural Symmetries for Fully Observable Nondeterministic Planning. - Dominik Winterer; Martin Wehrle; Michael Katz 001 (IJCAI, 2016)

Stubborn Sets for Fully Observable Nondeterministic Planning. - Dominik Winterer; Yusra Alkhazraji; Michael Katz 001; Martin Wehrle (ICAPS, 2017)

A Novel Iterative Approach to Top-k Planning. - Michael Katz 001; Shirin Sohrabi; Octavian Udrea; Dominik Winterer (ICAPS, 2018)

Oversubscription Planning as Classical Planning with Multiple Cost Functions. - Michael Katz 001; Emil Keyder; Dominik Winterer; Florian Pommerening (ICAPS, 2019)

Validating SMT solvers via semantic fusion. - Dominik Winterer; Chengyu Zhang 001; Zhendong Su 001 (PLDI, 2020)

On the Unusual Effectiveness of Type-aware Mutations for Testing SMT Solvers. - Dominik Winterer; Chengyu Zhang 001; Zhendong Su 001 (CoRR, 2020)

On the unusual effectiveness of type-aware operator mutations for testing SMT solvers. - Dominik Winterer; Chengyu Zhang 001; Zhendong Su 001 (Proc. ACM Program. Lang., 2020)

Generative type-aware mutation for testing SMT solvers. - Jiwon Park; Dominik Winterer; Chengyu Zhang 001; Zhendong Su 001 (Proc. ACM Program. Lang., 2021)

Finding and Understanding Incompleteness Bugs in SMT Solvers. - Mauro Bringolf; Dominik Winterer; Zhendong Su 001 (ASE, 2022)

Compilation Quotient (CQ): A Metric for the Compilation Hardness of Programming Languages. - Vince Szabo; Dominik Winterer; Zhendong Su 001 (CoRR, 2024)

Validating SMT Solvers for Correctness and Performance via Grammar-Based Enumeration. - Dominik Winterer; Zhendong Su 001 (Proc. ACM Program. Lang., 2024)

Solidifying Modern SMT Solvers. - Dominik Winterer (2024)