| 2008 |
|---|
| 8 | EE | Kazuo Iwama,
Suguru Tamaki:
The Complexity of the Hajos Calculus for Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(011): (2008) |
| 7 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama,
Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Transactions 91-A(9): 2301-2307 (2008) |
| 2007 |
|---|
| 6 | EE | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations.
SAT 2007: 187-200 |
| 5 | EE | Kazuo Iwama,
Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments.
Discrete Applied Mathematics 155(12): 1596-1603 (2007) |
| 4 | EE | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.
Electronic Colloquium on Computational Complexity (ECCC) 14(029): (2007) |
| 2004 |
|---|
| 3 | EE | Kazuo Iwama,
Suguru Tamaki:
Improved upper bounds for 3-SAT.
SODA 2004: 328 |
| 2003 |
|---|
| 2 | EE | Kazuo Iwama,
Suguru Tamaki:
Improved Upper Bounds for 3-SAT
Electronic Colloquium on Computational Complexity (ECCC)(053): (2003) |
| 2001 |
|---|
| 1 | EE | Kazuo Iwama,
Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments.
Algorithm Engineering 2001: 118-128 |
