A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem. - Kazuho Kanahara; Kengo Katayama; Takeshi Okano; Elis Kulla; Tetsuya Oda; Noritaka Nishihara (CISIS, 2018)

A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem. - Takeshi Okano; Kengo Katayama; Kazuho Kanahara; Noritaka Nishihara (GCCE, 2018)

Speeding-Up of Construction Algorithms for the Graph Coloring Problem. - Kazuho Kanahara; Kengo Katayama; Takafumi Miyake; Etsuji Tomita (BWCCA, 2020)

Approach of a Solution Construction Method for Mesh Router Placement Optimization Problem. - Aoto Hirata; Tetsuya Oda; Nobuki Saito; Kazuho Kanahara; Masaharu Hirota; Kengo Katayama (GCCE, 2020)

Applying a Local Search for the Uncapacitated p-Median Problem to the Capacitated Problem. - Takafumi Miyake; Kengo Katayama; Kazuho Kanahara; Tetsuya Oda (GCCE, 2020)

Approach of Fuzzy Theory and Hill Climbing Based Recommender for Schedule of Life. - Nobuki Saito; Tetsuya Oda; Yuki Nagai; Kazuho Kanahara; Masaharu Hirota; Kengo Katayama (LifeTech, 2020)

An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. - Kazuho Kanahara; Tetsuya Oda; Elis Kulla; Akira Uejima; Kengo Katayama (EIDWT, 2022)

An Extended NEH based Method for Permutation Flowshop Scheduling Problem. - Shun Ito; Kazuho Kanahara; Tetsuya Oda; Kengo Katayama (ICCCM, 2022)

The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem. - Kazuho Kanahara; Shun Ito; Kengo Katayama (ICCCM, 2022)

Speeding-Up Construction Algorithms for the Graph Coloring Problem. - Kazuho Kanahara; Kengo Katayama; Etsuji Tomita (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)