BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Portugal
1 × United Kingdom
Collaborated with:
K.Makino M.Yamamoto T.Sakai K.Seto
Talks about:
problem (2) connect (2) boolean (2) algorithm (1) restrict (1) instanc (1) reduct (1) greedi (1) width (1) spars (1)

Person: Suguru Tamaki

DBLP DBLP: Tamaki:Suguru

Contributed to:

SAT 20142014
SAT 20102010
SAT 20072007

Wrote 3 papers:

SAT-2014-SakaiST #reduction #satisfiability #strict
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.
SAT-2010-MakinoTY #algorithm #problem
An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.
SAT-2007-MakinoTY #on the #problem
On the Boolean Connectivity Problem for Horn Relations (KM, ST, MY), pp. 187–200.

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.