| 2009 | ||
|---|---|---|
| 8 | Heidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT. ESA 2009: 764-775 | |
| 7 | Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl: The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 | |
| 6 | Heidi Gebauer: Disproof of the Neighborhood Conjecture with Implications to SAT CoRR abs/0904.2541: (2009) | |
| 5 | Heidi Gebauer: A Strategy for Maker in the Clique Game which Helps to Tackle some Open Problems by Beck CoRR abs/0909.4362: (2009) | |
| 4 | Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. 20(1): 25-44 (2009) | |
| 2008 | ||
| 3 | Heidi Gebauer: Unsatisfiable (k,(4*2^k/k))-CNF formulas CoRR abs/0810.1904: (2008) | |
| 2 | Heidi Gebauer: Disproving the Neighborhood Conjecture CoRR abs/0810.1981: (2008) | |
| 2007 | ||
| 1 | Heidi Gebauer, Yoshio Okamoto: Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. CATS 2007: 63-69 | |
| 1 | Robin A. Moser | [7] |
| 2 | Yoshio Okamoto | [1] [4] |
| 3 | Dominik Scheder | [7] |
| 4 | Emo Welzl | [7] |