| 2009 | ||
|---|---|---|
| 9 | Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl: The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 | |
| 8 | Dominik Scheder: Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely CoRR abs/0905.1587: (2009) | |
| 2008 | ||
| 7 | Dominik Scheder: Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN 2008: 60-71 | |
| 6 | Dominik Scheder, Philipp Zumstein: How Many Conflicts Does It Need to Be Unsatisfiable?. SAT 2008: 246-256 | |
| 5 | Dominik Scheder, Philipp Zumstein: An Improved Bound on the Number of Con flicts in Unsatisfiable k-CNF Formulas CoRR abs/0806.1148: (2008) | |
| 4 | Dominik Scheder: Satisfiability of Almost Disjoint CNF Formulas CoRR abs/0807.1282: (2008) | |
| 2007 | ||
| 3 | Dominik Scheder, Philipp Zumstein: Satisfiability with Exponential Families. SAT 2007: 148-158 | |
| 2 | Dominik Scheder: Unsatisfiable Linear k-CNFs Exist, for every k CoRR abs/0708.2336: (2007) | |
| 1 | Claudia Käppeli, Dominik Scheder: Partial Satisfaction of k-Satisfiable Formulas. Electronic Notes in Discrete Mathematics 29: 497-501 (2007) | |
| 1 | Heidi Gebauer | [9] |
| 2 | Claudia Käppeli | [1] |
| 3 | Robin A. Moser | [9] |
| 4 | Emo Welzl | [9] |
| 5 | Philipp Zumstein | [3] [5] [6] |