Publications

• Robin A. Moser and Dominik Scheder, A Full Derandomization of Schöning's k-SAT Algorithm, STOC 2011


• Timon Hertli, Robin A. Moser, and Dominik Scheder, Improving PPSZ for 3-SAT using Critical Variables in 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)


• D. Scheder, Unsatisfiable Linear CNF Formulas are Large and Complex, 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010)


• D. Scheder, P. Zumstein, How many Conflicts does it need to be Unsatisfiable, Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2008)


• D. Scheder, Guided Search and a Faster Deterministic Algorithm for 3-SAT, Proc. 8th Latin American Theoretical Informatics Symposium (LATIN) (2008).


• C. Käppeli, D. Scheder, Partial Satisfaction of k-Satisfiable Formulas, Proc. of European Conference on Combinatorics (EuroComb) (2007) 497-501.


• D. Scheder, P. Zumstein, Satisfiability with exponential families, Proc. 10th International Conference on Theory and Applications of Satisfiability Testing (SAT), Lecture Notes in Computer Science 4501 (2007) 148-158.


• D. Scheder, Approaches to Approximating the Minimum Weight k-Edge Connected Spanning Subgraph of a Mixed Graph, Master's Thesis, University of Colorado at Boulder, 2005. Advisor: Harold N. Gabow.

Unpublished Material

• Unsatisfiable CNF Formulas need many Conflicts

Presentations

• Linear Formulas Are Large and Complex at STACS 2010, Nancy.


• Deterministic Local Search for the k-SAT Problem: An Algorithm and some Improvements, at Euro 2009, Bonn.


• Conflict Graph, at SAT 2008


• Guided Search and a Faster Deterministic Algorithm for 3-SAT, at Latin 2008.