Generation of all the Balanced Parenthesis Strings in Lexicographical Order. - Ichiro Semba (Inf. Process. Lett., 1981)

An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order. - Ichiro Semba (J. Algorithms, 1984)

A Fast Iterative Algorithm for Generating Set Partitions. - Borivoje Djokic; Masahiro Miyakawa; Satoshi Sekiguchi; Ichiro Semba; Ivan Stojmenovic (Comput. J., 1989)

Parallel Algorithms for Generating Subsets and Set Partitions. - Borivoje Djokic; Masahiro Miyakawa; Satoshi Sekiguchi; Ichiro Semba; Ivan Stojmenovic (SIGAL International Symposium on Algorithms, 1990)

Generating derangements by interchanging at most four elements. - Kenji Mikawa; Ichiro Semba (Syst. Comput. Jpn., 2004)