| 2007 |
|---|
| 8 | EE | Masaki Yamamoto:
A Spectral Method for MAX2SAT in the Planted Solution Model.
ISAAC 2007: 112-123 |
| 7 | EE | Kazuhisa Makino,
Suguru Tamaki,
Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations.
SAT 2007: 187-200 |
| 6 | 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) |
| 5 | EE | Tobias Riege,
Jörg Rothe,
Holger Spakowski,
Masaki Yamamoto:
An improved exact algorithm for the domatic number problem.
Inf. Process. Lett. 101(3): 101-106 (2007) |
| 2006 |
|---|
| 4 | EE | Osamu Watanabe,
Masaki Yamamoto:
Average-Case Analysis for the MAX-2SAT Problem.
SAT 2006: 277-282 |
| 3 | EE | Tobias Riege,
Jörg Rothe,
Holger Spakowski,
Masaki Yamamoto:
An Improved Exact Algorithm for the Domatic Number Problem
CoRR abs/cs/0603060: (2006) |
| 2 | EE | Masaki Yamamoto:
Generating Instances for MAX2SAT with Optimal Solutions.
Theory Comput. Syst. 39(5): 723-742 (2006) |
| 2005 |
|---|
| 1 | EE | Masaki Yamamoto:
An Improved O(1.234m)-Time Deterministic Algorithm for SAT.
ISAAC 2005: 644-653 |
