Tatsuie TSUKIJI


Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata
Takeo HAGIWARA Tatsuie TSUKIJI Zhi-Zhong CHEN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/06/01
Vol. E99-A  No. 6  pp. 1034-1049
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
cellular automatacomputational complexityLorentz lattice gasLangton's antPSPACE-complete
 Summary | Full Text:PDF

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications
Zhi-Zhong CHEN Tatsuie TSUKIJI Hiroki YAMADA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/06/01
Vol. E99-A  No. 6  pp. 1050-1058
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
fixed-parameter algorithmsrandomized algorithmsmatchingscolor-codinguniversal sets
 Summary | Full Text:PDF

Approximated Vertex Cover for Graphs with Perfect Matchings
Tomokazu IMAMURA Kazuo IWAMA Tatsuie TSUKIJI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Vol. E89-D  No. 8  pp. 2405-2410
Type of Manuscript:  INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
approximation algorithmvertex coverperfect matchingMAX-2SAT
 Summary | Full Text:PDF

-Coloring Problem
Akihiro UEJIMA Hiro ITO Tatsuie TSUKIJI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/05/01
Vol. E87-A  No. 5  pp. 1243-1250
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
H-coloringcycles of odd ordercomplement graphsNP-completeness
 Summary | Full Text:PDF

P-Comp Versus P-Samp Questions on Average Polynomial Domination
Shin AIDA Tatsuie TSUKIJI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/10/01
Vol. E84-D  No. 10  pp. 1402-1410
Type of Manuscript:  PAPER
Category: Computational Complexity Theory
Keyword: 
average-case complexitypolynomial-time computabilitypolynomial-time samplabilitydomination
 Summary | Full Text:PDF

Some Lower Bounds of Cyclic Shift on Boolean Circuits
Tatsuie TSUKIJI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A  No. 4  pp. 520-523
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
Boolean circuitscyclic shiftlower boundspartitioningssynchronous circuits
 Summary | Full Text:PDF