| The 2023 International Planning Competition A Taitler, R Alford, J Espasa, G Behnke, D Fišer, M Gimelfarb, ... AI Magazine, 2024 | 71 | 2024 |
| Lilotane: A Lifted SAT-Based Approach to Hierarchical Planning D Schreiber Journal of Artificial Intelligence Research 70, 1117-1181, 2021 | 62 | 2021 |
| Scalable SAT Solving in the Cloud D Schreiber, P Sanders International Conference on Theory and Applications of Satisfiability …, 2021 | 46 | 2021 |
| Tree-REX: SAT-based tree exploration for efficient and high-quality HTN planning D Schreiber, D Pellier, H Fiorino, T Balyo Proceedings of the International Conference on Automated Planning and …, 2019 | 43 | 2019 |
| Decentralized online scheduling of malleable NP-hard jobs P Sanders, D Schreiber Euro-Par 2022: Parallel Processing: 28th International Conference on …, 2022 | 23 | 2022 |
| Lifted logic for task networks: TOHTN planner lilotane in the IPC 2020 D Schreiber Proceedings of 10th International Planning Competition: planner and domain …, 2021 | 14 | 2021 |
| MallobSat: Scalable SAT solving by clause sharing D Schreiber, P Sanders Journal of Artificial Intelligence Research 80, 1437-1495, 2024 | 13 | 2024 |
| Unsatisfiability proofs for distributed clause-sharing SAT solvers D Michaelson, D Schreiber, MJH Heule, B Kiesl-Reiter, MW Whalen Tools and Algorithms for the Construction and Analysis of Systems: 29th …, 2023 | 12 | 2023 |
| Scalable SAT Solving and its Application DP Schreiber | 11 | 2023 |
| Mallob in the SAT Competition 2021 D Schreiber Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions, 38-39, 2021 | 10 | 2021 |
| Engineering HordeSat Towards Malleability: mallob-mono in the SAT 2020 Cloud Track D Schreiber Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions, 45-46, 2020 | 10 | 2020 |
| Efficient SAT encodings for hierarchical planning D Schreiber, D Pellier, H Fiorino, T Balyo 11th International Conference on Agents and Artificial Intelligence (ICAART …, 2019 | 10 | 2019 |
| PASAR—Planning as Satisfiability with Abstraction Refinement N Froleyks, T Balyo, D Schreiber Proceedings of the International Symposium on Combinatorial Search 10 (1), 70-78, 2019 | 8 | 2019 |
| Finding optimal longest paths by dynamic programming in parallel K Fieger, T Balyo, C Schulz, D Schreiber Proceedings of the International Symposium on Combinatorial Search 10 (1), 61-69, 2019 | 6 | 2019 |
| Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling P Sanders, D Schreiber Journal of Open Source Software 7 (76), 4591, 2022 | 5 | 2022 |
| Mallob{32, 64, 1600} in the SAT Competition 2023 D Schreiber SAT COMPETITION 2023, 46, 0 | 5* | |
| Trusted Scalable SAT Solving with on-the-fly LRAT Checking D Schreiber 27th International Conference on Theory and Applications of Satisfiability …, 2024 | 4 | 2024 |
| Distributed Incremental SAT Solving with Mallob: Report and Case Study with Hierarchical Planning D Schreiber arXiv preprint arXiv:2505.18836, 2025 | 2 | 2025 |
| Engineering Optimal Parallel Task Scheduling M Akram, N Maas, P Sanders, D Schreiber 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2025 | 2 | 2025 |
| MallobSat and MallobSat-ImpCheck In the SAT Competition 2024 D Schreiber Proceedings of SAT Competition 2024: Solver and Benchmark Descriptions, 2024 | 2 | 2024 |
Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyVerified email at kit.edu
