| 2025 | ESA | PLS-Completeness of String Permutations. | Dominik Scheder, Johannes Tantow |
| 2021 | FOCS | PPSZ is better than you think. | Dominik Scheder |
| 2021 | ISAAC | Impatient PPSZ - A Faster Algorithm for CSP. | Shibo Li, Dominik Scheder |
| 2019 | ISAAC | Searching for Cryptogenography Upper Bounds via Sum of Square Programming. | Dominik Scheder, Shuyang Tang, Jiaheng Zhang |
| 2017 | ICALP | Tighter Hard Instances for PPSZ. | Pavel Pudlk, Dominik Scheder, Navid Talebanfard |
| 2016 | CP | The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. | Timon Hertli, Isabelle Hurbain, Sebastian Millius, Robin A. Moser, Dominik Scheder, May Szedlk |
| 2013 | ISAAC | Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. | Dominik Scheder |
| 2013 | ISAAC | Unsatisfiable CNF Formulas contain Many Conflicts. | Dominik Scheder |
| 2013 | SODA | Exponential Lower Bounds for the PPSZ | Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard |
| 2011 | STOC | A full derandomization of schning's k-SAT algorithm. | Robin A. Moser, Dominik Scheder |
| 2011 | STACS | Improving PPSZ for 3-SAT using Critical Variables. | Timon Hertli, Robin A. Moser, Dominik Scheder |
| 2010 | STACS | Unsatisfiable Linear CNF Formulas Are Large and Complex. | Dominik Scheder |
| 2008 | LATIN | Guided Search and a Faster Deterministic Algorithm for 3-SAT. | Dominik Scheder |
| 2008 | SAT | How Many Conflicts Does It Need to Be Unsatisfiable? | Dominik Scheder, Philipp Zumstein |
| 2007 | SAT | Satisfiability with Exponential Families. | Dominik Scheder, Philipp Zumstein |