| 2009 |
|---|
| 5 | EE | Heidi Gebauer:
Disproof of the Neighborhood Conjecture with Implications to SAT
CoRR abs/0904.2541: (2009) |
| 4 | EE | 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 | EE | Heidi Gebauer:
Unsatisfiable (k,(4*2^k/k))-CNF formulas
CoRR abs/0810.1904: (2008) |
| 2 | EE | Heidi Gebauer:
Disproving the Neighborhood Conjecture
CoRR abs/0810.1981: (2008) |
| 2007 |
|---|
| 1 | EE | Heidi Gebauer,
Yoshio Okamoto:
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes.
CATS 2007: 63-69 |
