| No. | Title | Appeared | Page | Year |
| 1 | Fundamental Research for Optimal Sequential Partitions of Graphs | Bulletin of the Hokkaido Information University, Vol.1, No.1 | pp.115-126 | 1990 |
| 2 | Optimal Sequential Partitions of Graphs by Branch-and-Bound | Technical Report, Information Processing Society of Japan, Vol.90, No.58 | pp.69-76 | 1990 |
| 3 | An Improved Branch-and-Bound Algorithm for Sequential Partitions of Graphs and Related Proble | Technical Report, Information Processing Society of Japan, Vol.91,No.48 | pp.1-8 | 1991 |
| 4 | Complexity of Optimal Sequential Partitions of Graphs by Dynamic Programming | Bulletin of Faculty of Engineering, Hokkaido University, No.157 | pp.59-70 | 1991 |
| 5 | Algorithm and Efficiency of Branch-and-Bound for Optimal Sequential Partitions | Technical Report, Information Processing Society of Japan, Vol.92,No.58 | pp.25-32 | 1992 |
| 6 | Development and Characteristic Analysis of Branch-and-Bound algorithm for Optimal Sequential Partitions of Graphs | Transactions of Information Processing Society of Japan, Vol.35, No.3 | pp.364-372 | 1994 |
| 7 | Optimal Sequential Partitions for Partial Order | The Economic Review, Otaru University of Commerce, Vol.45, No.2 | pp.185-204 | 1994 |
| 8 | Tabu Search Approach and Characteristic Analysis for the Optimal Sequential Partitions of Directed Acyclic Graphs | Technical Report, Information Processing Society of Japan, Vol.95,No.66 | pp.1-6 | 1995 |
| 9 | A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graphs | The Transactions of the Institute of Electrical Engineers of Japan, Vol.116-C, No.10 | pp.1149-1157 | 1996 |
| 10 | A Simulated Annealing Algorithm for the Sequential Partitioning Problem of Directed Acyclic Graphs | The Economic Review, Otaru University of Commerce Vol.47, No.2,3 | pp.287-302 | 1997 |
| 11 | Assignment Problem for System with Precedence Relation among Elements | The Transactions of the Institute of Electrical Engineers of Japan, Vol.117-C, No.2 | pp.136-142 | 1997 |
| 12 | Exact and Approximation Approach of Assignment Problem for System with Precedence Relationships among Elements | Journal of Japan Industrial Management Association,Vol.47,No.6 | pp.344-350 | 1997 |
| 13 | A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graph | The Electrical Engineering in Japan, Scripta Technica,INC., Vol.119,No.4 | pp.42-51 | 1997 |
| 14 | The Assignment Problem for System with Precedence Relationships among Elements using a Simulated Annealing Algorithm | Proc. of the 14th International Conference on Production Research | pp.1056-1059 | 1997 |
| 15 | Assignment Problem for System with Precedence Relationships among Elements | The Electrical Engineering in Japan, Scripta Technica,INC., Vol.121,No.2 | pp.54-62 | 1997 |
| 16 | A simulated Annealing Approach using Random Compound Move for Sequential Partition Problem | Transactions of Information Processing Society of Japan, Vol.38, No.12 | pp.2411-2418 | 1997 |
| 17 | A Simulated Annealing Algorithm with the Random Compound Move for the Sequential Partitioning Problem of Directed Acyclic Graphs | European Journal of Operational Research, Vol.112, No.1 | pp.147-157 | 1999 |
| 18 | Improvement and Analysis of Ant System Algorithm for TSP | The Proceedings of the 15th National Conference of the Australian Society for Operations Research Inc. | pp.644-651 | 1999 |
| 19 | Parallel Revised Ant System Algorithm by New Agents for TSP | The Proc. of Second Asia-Pacific Conference on Industrial Engineering and Management System | pp.639-642 | 1999 |
| 20 | A Genetic Algorithm for the Optimal Sequential Partitioning Problem | The Transactions of the Institute of Electrical Engineers of Japan, Vol.120-C, No.2 | pp.215-221 | 2000 |
| 21 | Parallel Tabu Search Algorithm for Graph Partitioning Problem | Proc. of the 2nd Joint International Workshop ORSJ and ASOR | pp.90-97 | 2000 |
| 22 | 「Probabilistic Analysis of Local Search using AR(1) Model in the Graph Partitioning Problem」 | Proc. of the Fifth Metaheuristics International Conference, Paper ID 38 | pp.1-6 | 2003 |
| 23 | 「Ant-TSL System Algorithm using New Ant Agents with Intensification and Diversification Strategies」 | Journal of Industrial Management Association, Vol.59, No.6 | pp449-456 | 2009 |
| 24 | 「Time Series Analysis for Fitness Landscapes of Combinatorial Optimization Problems 」 | 13th Czech-Japan Seminar on Data Analysis and Decision Making in Service Science | pp155-160 | 2010 |
| 24 | 「A Probabilistic Analysis of Neighborhoods for Combinatorial Optimization Problems and Its Application」 | Journal of Heuristics, DOI：https://doi.org/10.1007/s10732-021-09484-y | pp.1-23 | 2021 |