Dominik Schreiber

According to our database, Dominik Schreiber authored at least 15 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Engineering Optimal Parallel Task Scheduling.

Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber

CoRR, 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, Javier Segovia-Aguas, Jendrik Seipp

AI Mag., 2024

Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines.

Matthew Akram, Dominik Schreiber

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Scalable SAT Solving on Demand (Abstract).

Dominik Schreiber, Peter Sanders

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

Scalable SAT Solving and its Application

Dominik Schreiber

PhD thesis, 2023

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers.

Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

2022

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.

Dominik Schreiber, Peter Sanders

Dataset, July, 2022

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.

Peter Sanders, Dominik Schreiber

J. Open Source Softw., 2022

Decentralized Online Scheduling of Malleable NP-hard Jobs.

Peter Sanders, Dominik Schreiber

Proceedings of the Euro-Par 2022: Parallel Processing, 2022

2021

Lilotane: A Lifted SAT-based Approach to Hierarchical Planning.

Dominik Schreiber

J. Artif. Intell. Res., 2021

Scalable SAT Solving in the Cloud.

Dominik Schreiber, Peter Sanders

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2019

PASAR - Planning as Satisfiability with Abstraction Refinement.

Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Finding Optimal Longest Paths by Dynamic Programming in Parallel.

Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Efficient SAT Encodings for Hierarchical Planning.

Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo

Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019

Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning.

Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019