A Characterization of Biplanar Graphs - Shunichi Toida (1969)

Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) - Tiko Kameda; Shunichi Toida (SWAT, 1973)

Generation of all Cutsets of a Bipath Network. - Shunichi Toida (IEEE Trans. Commun., 1973)

An Approach to the Diagnosability Analysis of a System. - F. J. Allan; Tiko Kameda; Shunichi Toida (IEEE Trans. Computers, 1975)

A Diagnosing Algorithm for Networks - Tiko Kameda; Shunichi Toida; F. J. Allan (Inf. Control., 1975)

System Diagnosis and Redundant Tests. - Shunichi Toida (IEEE Trans. Computers, 1976)

A note on Ádám's conjecture. - Shunichi Toida (J. Comb. Theory B, 1977)

On Minimal Test Sets for Locating Single Link Failures in Networks. - Toshihide Ibaraki; Tsunehiko Kameda; Shunichi Toida (IEEE Trans. Computers, 1981)

The Complexity of Fault Detection Problems for Combinational Logic Circuits. - Hideo Fujiwara; Shunichi Toida (IEEE Trans. Computers, 1982)

On polynomial-time testable classes of combinational circuits. - Nageswara S. V. Rao; Shunichi Toida (VTS, 1991)

Computational Complexity of Test-Point Insertions and Decompositions. - Nageswara S. V. Rao; Shunichi Toida (VLSI Design, 1992)

On test generation for combinational circuits consisting of AND and EXOR gates. - Shunichi Toida; Nageswara S. V. Rao (VTS, 1992)

Revisiting shift register realization for ease of test generation and testing. - Shunichi Toida (VTS, 1993)

On Polynomial-Time Testable Combinational Circuits. - Nageswara S. V. Rao; Shunichi Toida (IEEE Trans. Computers, 1994)

Preposition Senses: Generalized Disambiguation Model. - Chutima Boonthum; Shunichi Toida; Irwin B. Levinstein (CICLing, 2006)