Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search. - Ken Tokoro; Kazuaki Yamaguchi; Sumio Masuda (ACSC, 2006)

An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem. - Kazuaki Yamaguchi; Sumio Masuda (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

A fast heuristic for the minimum weight vertex cover problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (ICIS, 2016)

Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (Discret. Appl. Math., 2017)

A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (CSII (selected papers), 2018)

An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings. - Naoto Kido; Sumio Masuda; Kazuaki Yamaguchi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

A maximum edge-weight clique extraction algorithm based on branch-and-bound. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (Discret. Optim., 2020)

Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Sumio Masuda (Discret. Optim., 2021)

Independent Sets Extraction Graph Coloring Algorithm Using Beam Search. - Kentaro Akashi; Kazuaki Yamaguchi (SNPD, 2022)

An experimental evaluation of upper bounds of clique weights based on graph coloring. - Yuki Kashihara; Kazuaki Yamaguchi; Masahide Nakamura (BCD, 2023)