Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. - Dominik Schreiber 001; Damien Pellier; Humbert Fiorino; Tomás Balyo (ICAPS, 2019)

Efficient SAT Encodings for Hierarchical Planning. - Dominik Schreiber 001; Damien Pellier; Humbert Fiorino; Tomás Balyo (ICAART (2), 2019)

Finding Optimal Longest Paths by Dynamic Programming in Parallel. - Kai Fieger; Tomás Balyo; Christian Schulz 003; Dominik Schreiber 001 (SOCS, 2019)

PASAR - Planning as Satisfiability with Abstraction Refinement. - Nils Christian Froleyks; Tomás Balyo; Dominik Schreiber 001 (SOCS, 2019)

Scalable SAT Solving in the Cloud. - Dominik Schreiber 001; Peter Sanders 001 (SAT, 2021)

Lilotane: A Lifted SAT-based Approach to Hierarchical Planning. - Dominik Schreiber 001 (J. Artif. Intell. Res., 2021)

Decentralized Online Scheduling of Malleable NP-hard Jobs. - Peter Sanders 001; Dominik Schreiber 001 (Euro-Par, 2022)

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. - Peter Sanders 001; Dominik Schreiber 001 (J. Open Source Softw., 2022)

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. - Dominik Schreiber 001; Peter Sanders 001 (Zenodo, 2022)

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. - Dawn Michaelson; Dominik Schreiber 001; Marijn J. H. Heule; Benjamin Kiesl-Reiter; Michael W. Whalen (TACAS (1), 2023)

Scalable SAT Solving and its Application - Dominik Schreiber 001 (2023)

Skalierbares SAT Solving und dessen Anwendung. - Dominik Schreiber 001 (Ausgezeichnete Informatikdissertationen, 2023)

Scalable SAT Solving on Demand (Abstract). - Dominik Schreiber 001; Peter Sanders 001 (HOPC@SPAA, 2024)

Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. - Dominik Schreiber 001 (SAT, 2024)

Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. - Matthew Akram; Dominik Schreiber 001 (SPAA, 2024)

The 2023 International Planning Competition. - Ayal Taitler; Ron Alford; Joan Espasa; Gregor Behnke; Daniel Fiser; Michael Gimelfarb; Florian Pommerening; Scott Sanner; Enrico Scala; Dominik Schreiber 001; Javier Segovia-Aguas; Jendrik Seipp (AI Mag., 2024)

Engineering Optimal Parallel Task Scheduling. - Matthew Akram; Nikolai Maas; Peter Sanders 001; Dominik Schreiber 001 (CoRR, 2024)

MallobSat: Scalable SAT Solving by Clause Sharing. - Dominik Schreiber 001; Peter Sanders 001 (J. Artif. Intell. Res., 2024)

Streamlining Distributed SAT Solver Design. - Dominik Schreiber 001; Niccolò Rigi-Luperti; Armin Biere (SAT, 2025)

On the dissertation "Scalable SAT Solving and its Application". - Dominik Schreiber 001 (it Inf. Technol., 2025)

Distributed Incremental SAT Solving with Mallob: Report and Case Study with Hierarchical Planning. - Dominik Schreiber 001 (CoRR, 2025)

Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers. - Dawn Michaelson; Dominik Schreiber 001; Marijn J. H. Heule; Benjamin Kiesl-Reiter; Michael W. Whalen (J. Autom. Reason., 2025)