Masaki Yamamoto

Seikei University, Tokyo, Japan

other persons with the same name:

• Masaki Yamamoto 0002 - Faculty of Human and Cultural Studies, Tezukayama Gakuin University, Japan
• Masaki Yamamoto 0003
• Masaki Yamamoto 0004 - Nagoya University, Japan
• Masaki Yamamoto 0005 - Panasonic
• Masaki Yamamoto 0006 - Kochi University of Technology

	2013
j10		Masaki Yamamoto: A Combinatorial Analysis for the Critical Clause Tree. Theory Comput. Syst. 52(2): 271-284 (2013)
	2012
j9		Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41(4): 1074-1093 (2012)
	2011
j8		Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe, Masaki Yamamoto: Spectral Analysis of Random Sparse Matrices. IEICE Transactions 94-A(6): 1247-1256 (2011)
j7		Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto: Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. Journal of Computational Biology 18(10): 1275-1290 (2011)
j6		Masaki Yamamoto, Shuji Kijima, Yasuko Matsui: A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. J. Comb. Optim. 22(3): 392-408 (2011)
j5		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: An exact algorithm for the Boolean connectivity problem for k-CNF. Theor. Comput. Sci. 412(35): 4613-4618 (2011)
c8		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: Derandomizing HSSW Algorithm for 3-SAT. COCOON 2011: 1-12
i5		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: Derandomizing HSSW Algorithm for 3-SAT. CoRR abs/1102.3766 (2011)
i4		Masaki Yamamoto: A tighter lower bound on the circuit size of the hardest Boolean functions. Electronic Colloquium on Computational Complexity (ECCC) 18: 86 (2011)
	2010
j4		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: On the Boolean connectivity problem for Horn relations. Discrete Applied Mathematics 158(18): 2024-2030 (2010)
j3		Osamu Watanabe, Masaki Yamamoto: Average-case analysis for the MAX-2SAT problem. Theor. Comput. Sci. 411(16-18): 1685-1697 (2010)
c7		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: An Exact Algorithm for the Boolean Connectivity Problem for k-CNF. SAT 2010: 172-180
i3		Masaki Yamamoto: A combinatorial analysis for the critical clause tree. Electronic Colloquium on Computational Complexity (ECCC) 17: 95 (2010)
	2009
c6		Masaki Yamamoto, Shuji Kijima, Yasuko Matsui: A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON 2009: 328-337
c5		Yuichi Yoshida, Masaki Yamamoto, Hiro Ito: An improved constant-time approximation algorithm for maximum~matchings. STOC 2009: 225-234
	2007
j2		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)
c4		Masaki Yamamoto: A Spectral Method for MAX2SAT in the Planted Solution Model. ISAAC 2007: 112-123
c3		Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto: On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200
i2		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)
	2006
j1		Masaki Yamamoto: Generating Instances for MAX2SAT with Optimal Solutions. Theory Comput. Syst. 39(5): 723-742 (2006)
c2		Osamu Watanabe, Masaki Yamamoto: Average-Case Analysis for the MAX-2SAT Problem. SAT 2006: 277-282
i1		Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto: An Improved Exact Algorithm for the Domatic Number Problem. CoRR abs/cs/0603060 (2006)
	2005
c1		Masaki Yamamoto: An Improved O(1.234m)-Time Deterministic Algorithm for SAT. ISAAC 2005: 644-653

Coauthor Index

Colors in the list of coauthors

Last update Fri May 24 03:30:36 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page