An Improved O(1.234m)-Time Deterministic Algorithm for SAT. - Masaki Yamamoto 001 (ISAAC, 2005)

Generating Instances for MAX2SAT with Optimal Solutions. - Masaki Yamamoto 001 (Theory Comput. Syst., 2006)

A Spectral Method for MAX2SAT in the Planted Solution Model. - Masaki Yamamoto 001 (ISAAC, 2007)

A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Electron. Colloquium Comput. Complex., 2007)

An improved exact algorithm for the domatic number problem. - Tobias Riege; Jörg Rothe; Holger Spakowski; Masaki Yamamoto 001 (Inf. Process. Lett., 2007)

An improved constant-time approximation algorithm for maximum matchings. - Yuichi Yoshida; Masaki Yamamoto 001; Hiro Ito (STOC, 2009)

An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (SAT, 2010)

On the Boolean connectivity problem for Horn relations. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Discret. Appl. Math., 2010)

A combinatorial analysis for the critical clause tree. - Masaki Yamamoto 001 (Electron. Colloquium Comput. Complex., 2010)

Average-case analysis for the MAX-2SAT problem. - Osamu Watanabe 001; Masaki Yamamoto 001 (Theor. Comput. Sci., 2010)

A tighter lower bound on the circuit size of the hardest Boolean functions. - Masaki Yamamoto 001 (Electron. Colloquium Comput. Complex., 2011)

Spectral Analysis of Random Sparse Matrices. - Tomonori Ando; Yoshiyuki Kabashima; Hisanao Takahashi; Osamu Watanabe 001; Masaki Yamamoto 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. - Tatsuya Akutsu; Avraham A. Melkman; Takeyuki Tamura; Masaki Yamamoto 001 (J. Comput. Biol., 2011)

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. - Masaki Yamamoto 001; Shuji Kijima; Yasuko Matsui (J. Comb. Optim., 2011)

An exact algorithm for the Boolean connectivity problem for k-CNF. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Theor. Comput. Sci., 2011)

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. - Yuichi Yoshida; Masaki Yamamoto 001; Hiro Ito (SIAM J. Comput., 2012)

Derandomizing the HSSW Algorithm for 3-SAT. - Kazuhisa Makino; Suguru Tamaki; Masaki Yamamoto 001 (Algorithmica, 2013)

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets. - Ryuhei Mori; Takeshi Koshiba; Osamu Watanabe 001; Masaki Yamamoto 001 (CoRR, 2014)

Approximately counting paths and cycles in a graph. - Masaki Yamamoto 001 (Discret. Appl. Math., 2017)

The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring. - Naoki Matsumoto; Masaki Yamamoto 001; Masahito Yamazaki (Australas. J Comb., 2021)

On the initial transition of graphs of Kirkman schedules by the partial team swap. - Yusuke Kashiwagi; Masaki Yamamoto 001; Takamasa Yashima (J. Comb. Optim., 2025)