 | 2008 |
|---|
| 4 |       | Dominik Scheder,
Philipp Zumstein:
How Many Conflicts Does It Need to Be Unsatisfiable?.
SAT 2008: 246-256 |
| 3 | | Noga Alon,
Robert Berke,
Kevin Buchin,
Maike Buchin,
Péter Csorba,
Saswata Shannigrahi,
Bettina Speckmann,
Philipp Zumstein:
Polychromatic colorings of plane graphs.
Symposium on Computational Geometry 2008: 338-345 |
| 2 | | Dominik Scheder,
Philipp Zumstein:
An Improved Bound on the Number of Con flicts in Unsatisfiable k-CNF Formulas
CoRR abs/0806.1148: (2008) |
| 2007 |
|---|
| 1 | | Dominik Scheder,
Philipp Zumstein:
Satisfiability with Exponential Families.
SAT 2007: 148-158 |
