Institute of Theoretical Informatics, Algorithm Engineering
Mitarbeiterbild Dominik Schreiber

M.Sc. Dominik Schreiber

Curriculum Vitae

For more details, please consult my private homepage.

Research Interests

  • Malleable load balancing strategies in the context of NP-hard computations
  • Satisfiability (SAT) solving and its efficient practical usage
  • Automated planning, in particular hierarchical planning and SAT-based planning

Software

Publications


Finding Optimal Longest Paths by Dynamic Programming in Parallel.
Fieger, K.; Balyo, T.; Schulz, C.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 61–69, AAAI Press
PASAR - Planning as Satisfiability with Abstraction Refinement.
Froleyks, N.; Balyo, T.; Schreiber, D.
2019. Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCs 2019), Napa, CA, July 16-17, 2019, 70–78, AAAI Press
Tree-REX: SAT-based Tree Exploration for Efficient and High-Quality HTN Planning.
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), Berkeley, CA, July 11-15, 2019, Ed.: J. Benton, 382–390, AAAI Press
Efficient SAT Encodings for Hierarchical Planning.
Schreiber, D.; Pellier, D.; Fiorino, H.; Balyo, T.
2019. Proceedings of the 11th International Conference on Agents and Artificial Intelligence (ICAART 2019), Prague, CZ, February 19-21, 2019. Ed.: J. van den Herik. Vol. 2, 531–538, SciTePress. doi:10.5220/0007343305310538Full textFull text of the publication as PDF document
Hierarchical Task Network Planning Using SAT Techniques. master’s thesis.
Schreiber, D. P.
2018. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000104165Full textFull text of the publication as PDF document
Technical Reports
Title Author(s) Source Date

Dominik Schreiber

SAT Competition 2020, Cloud Track

2020

Nils Froleyks, Tomas Balyo, Dominik Schreiber

Technical Report, Sparkle Planning Challenge 2019

July 2019

Tomas Balyo, Dominik Schreiber, Patrick Hegemann, Jeremias Trautmann

Technical Report, Sparkle Planning Challenge 2019

July 2019

Teaching

Open Theses
Title Subject Supervisor
Parallel and distributed algorithms, SAT Solving, automated planning
Supervised Theses
Title Subject Supervisor Student
SAT Solving, Compression

Jens Manig

Automated Planning, Parallel Algorithms

Tomáš Balyo, Dominik Schreiber

Jean-Pierre von der Heydt

Automated Planning, SAT Solving, Heuristic Search

Tomáš Balyo, Dominik Schreiber

Nils Froleyks

Automated Planning, SAT Solving, Parallel Algorithms

Dominik Schreiber

Marvin Williams