| 2026 | CAV | Mallob: Scalable Automated Reasoning on Demand. | Dominik Schreiber, Niccol Rigi-Luperti, Peter Sanders |
| 2026 | SAT | A Natively Parallel Proof Framework for Clause-Sharing SAT Solving. | Ruben Gtz, Michael Drr, Dominik Schreiber |
| 2026 | SAT | CaDiCaL 3.0 (Tool Paper). | Florian Pollitt, Mathias Fleury, Katalin Fazekas, Nils Froleyks, Andr Schidler, Dominik Schreiber, Armin Biere |
| 2026 | TACAS | Real-time Proof Checking for Distributed Incremental SAT Solving. | Dominik Schreiber, Mathias Fleury, Katalin Fazekas, Armin Biere |
| 2026 | TACAS | Massively Parallel Bit-Precise Verification with Bitwuzla and Mallob. | Dominik Schreiber, Aina Niemetz, Mathias Preiner |
| 2025 | ALENEX | Engineering Optimal Parallel Task Scheduling. | Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber |
| 2025 | SAT | Streamlining Distributed SAT Solver Design. | Dominik Schreiber, Niccol Rigi-Luperti, Armin Biere |
| 2025 | SoCS | From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search. | Dominik Schreiber, Christoph Jabs, Jeremias Berg |
| 2024 | ICST | On Combinatorial Security Testing for the Tor Anonymity Network Client. | Dimitris E. Simos, Bernhard Garn, Dominik Schreiber, Manuel Leithner, D. Richard Kuhn, Raghu Kacker |
| 2024 | SPAA | Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. | Matthew Akram, Dominik Schreiber |
| 2024 | SAT | Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. | Dominik Schreiber |
| 2023 | TACAS | Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. | Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen |
| 2022 | EuroPar | Decentralized Online Scheduling of Malleable NP-hard Jobs. | Peter Sanders, Dominik Schreiber |
| 2021 | SAT | Scalable SAT Solving in the Cloud. | Dominik Schreiber, Peter Sanders |
| 2019 | ICAART | Efficient SAT Encodings for Hierarchical Planning. | Dominik Schreiber, Damien Pellier, Humbert Fiorino, Toms Balyo |
| 2019 | SoCS | Finding Optimal Longest Paths by Dynamic Programming in Parallel. | Kai Fieger, Toms Balyo, Christian Schulz, Dominik Schreiber |
| 2019 | SoCS | PASAR - Planning as Satisfiability with Abstraction Refinement. | Nils Christian Froleyks, Toms Balyo, Dominik Schreiber |