Short cycles in digraphs. - Tsuyoshi Nishimura (Discret. Math., 1988)

Independence number, connectivity, and r-factors. - Tsuyoshi Nishimura (J. Graph Theory, 1989)

Regular factors of line graphs. - Tsuyoshi Nishimura (Discret. Math., 1990)

An ore-type condition for the existence ofk-factors in graphs. - Tadashi Iida; Tsuyoshi Nishimura (Graphs Comb., 1991)

A degree condition for the existence of k-factors. - Tsuyoshi Nishimura (J. Graph Theory, 1992)

Two recursive theorems on n-extendibility. - Tsuyoshi Nishimura; Akira Saito (Discret. Math., 1996)

Component factors and induced subgraphs. - Tsuyoshi Nishimura (J. Graph Theory, 1996)

A new recursive theorem onn-extendibility. - Tsuyoshi Nishimura (Graphs Comb., 1997)

A degree condition for the existence of 1-factors in graphs or their complements. - Kiyoshi Ando; Atsushi Kaneko; Tsuyoshi Nishimura (Discret. Math., 1999)

A recursive theorem on matching extension. - Chi-i Chan; Tsuyoshi Nishimura (Australas. J Comb., 2000)

On 1-factors and matching extension. - Tsuyoshi Nishimura (Discret. Math., 2000)

On packing 3-vertex paths in a graph. - Atsushi Kaneko; Alexander K. Kelmans; Tsuyoshi Nishimura (J. Graph Theory, 2001)

A closure concept in factor-critical graphs. - Tsuyoshi Nishimura (Discret. Math., 2002)

Note on a closure concept and matching extension. - Tsuyoshi Nishimura (Australas. J Comb., 2005)

Study on the Acoustic Characteristics of Sound Proofing Ventilation Unit. - Hayato Goto; Tsunetoshi Nasu; Noriko Horibe; Tsuyoshi Nishimura (IIAI-AAI, 2014)