Kazuho Kanahara

According to our database, Kazuho Kanahara authored at least 10 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2022

Speeding-Up Construction Algorithms for the Graph Coloring Problem.

Kazuho Kanahara, Kengo Katayama, Etsuji Tomita

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem.

Kazuho Kanahara, Shun Ito, Kengo Katayama

Proceedings of the 10th International Conference on Computer and Communications Management, 2022

An Extended NEH based Method for Permutation Flowshop Scheduling Problem.

Shun Ito, Kazuho Kanahara, Tetsuya Oda, Kengo Katayama

Proceedings of the 10th International Conference on Computer and Communications Management, 2022

An Efficient Local Search for the Maximum Clique Problem on Massive Graphs.

Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama

Proceedings of the Advances in Internet, Data & Web Technologies, 2022

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

Proceedings of the 2nd IEEE Global Conference on Life Sciences and Technologies, 2020

Applying a Local Search for the Uncapacitated p-Median Problem to the Capacitated Problem.

Takafumi Miyake, Kengo Katayama, Kazuho Kanahara, Tetsuya Oda

Proceedings of the 9th IEEE Global Conference on Consumer Electronics, 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

Proceedings of the 9th IEEE Global Conference on Consumer Electronics, 2020

Speeding-Up of Construction Algorithms for the Graph Coloring Problem.

Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita

Proceedings of the Advances on Broad-Band Wireless Computing, Communication and Applications, 2020

2018

A Local Search Based on Variant Variable Depth Search for the Quadratic Assignment Problem.

Takeshi Okano, Kengo Katayama, Kazuho Kanahara, Noritaka Nishihara

Proceedings of the IEEE 7th Global Conference on Consumer Electronics, 2018

A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem.

Kazuho Kanahara, Kengo Katayama, Takeshi Okano, Elis Kulla, Tetsuya Oda, Noritaka Nishihara

Proceedings of the Complex, Intelligent, and Software Intensive Systems, 2018