Masaki Yamamoto

28 papers A* 1A 3B 2Misc 2Journal 20
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the initial transition of graphs of Kirkman schedules by the partial team swap.
J. Comb. Optim.
Yusuke Kashiwagi, Masaki Yamamoto, Takamasa Yashima
2021 J jnl
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring.
Australas. J Comb.
Naoki Matsumoto, Masaki Yamamoto, Masahito Yamazaki
2017 J jnl
Approximately counting paths and cycles in a graph.
Discret. Appl. Math.
Masaki Yamamoto
2014 J jnl
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.
CoRR
Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe, Masaki Yamamoto
2013 J jnl
A Combinatorial Analysis for the Critical Clause Tree.
Theory Comput. Syst.
Masaki Yamamoto
2013 J jnl
Derandomizing the HSSW Algorithm for 3-SAT.
Algorithmica
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2012 J jnl
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.
SIAM J. Comput.
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
2011 J jnl
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise.
J. Comb. Optim.
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
2011 J jnl
A tighter lower bound on the circuit size of the hardest Boolean functions.
Electron. Colloquium Comput. Complex.
Masaki Yamamoto
2011 J jnl
An exact algorithm for the Boolean connectivity problem for k-CNF.
Theor. Comput. Sci.
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011 J jnl
Derandomizing HSSW Algorithm for 3-SAT
CoRR
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011 Misc conf
Derandomizing HSSW Algorithm for 3-SAT.
COCOON
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2011 J jnl
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.
J. Comput. Biol.
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto
2011 J jnl
Spectral Analysis of Random Sparse Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe, Masaki Yamamoto
2010 J jnl
A combinatorial analysis for the critical clause tree.
Electron. Colloquium Comput. Complex.
Masaki Yamamoto
2010 A conf
An Exact Algorithm for the Boolean Connectivity Problem for
SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2010 J jnl
Average-case analysis for the MAX-2SAT problem.
Theor. Comput. Sci.
Osamu Watanabe, Masaki Yamamoto
2010 J jnl
On the Boolean connectivity problem for Horn relations.
Discret. Appl. Math.
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2009 Misc conf
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise.
COCOON
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
2009 A* conf
An improved constant-time approximation algorithm for maximum matchings.
STOC
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
2007 J jnl
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem.
Electron. Colloquium Comput. Complex.
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2007 B conf
A Spectral Method for MAX2SAT in the Planted Solution Model.
ISAAC
Masaki Yamamoto
2007 J jnl
An improved exact algorithm for the domatic number problem.
Inf. Process. Lett.
Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
2007 A conf
On the Boolean Connectivity Problem for Horn Relations.
SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
2006 J jnl
An Improved Exact Algorithm for the Domatic Number Problem
CoRR
Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
2006 A conf
Average-Case Analysis for the MAX-2SAT Problem.
SAT
Osamu Watanabe, Masaki Yamamoto
2006 J jnl
Generating Instances for MAX2SAT with Optimal Solutions.
Theory Comput. Syst.
Masaki Yamamoto
2005 B conf
An Improved O(1.234
ISAAC
Masaki Yamamoto