BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Portugal
1 × United Kingdom
2 × USA
Collaborated with:
K.Makino S.Tamaki O.Watanabe Y.Yoshida H.Ito
Talks about:
problem (3) algorithm (2) connect (2) boolean (2) constant (1) approxim (1) maximum (1) analysi (1) improv (1) averag (1)

Person: Masaki Yamamoto

DBLP DBLP: Yamamoto:Masaki

Contributed to:

SAT 20102010
STOC 20092009
SAT 20072007
SAT 20062006

Wrote 4 papers:

SAT-2010-MakinoTY #algorithm #problem
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.
STOC-2009-YoshidaYI #algorithm #approximate
An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.
SAT-2007-MakinoTY #on the #problem
On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.
SAT-2006-WatanabeY #analysis #problem #satisfiability
Average-Case Analysis for the MAX-2SAT Problem (OW, MY), pp. 277–282.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.