Kazuaki Yamaguchi

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 9

Top Topics

Branch And Bound

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

Yuki Kashihara, Kazuaki Yamaguchi, Masahide Nakamura
An experimental evaluation of upper bounds of clique weights based on graph coloring. BCD (2023)
Kentaro Akashi, Kazuaki Yamaguchi
Independent Sets Extraction Graph Coloring Algorithm Using Beam Search. SNPD (2022)
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. Discret. Optim. 41 (2021)
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
A maximum edge-weight clique extraction algorithm based on branch-and-bound. Discret. Optim. 37 (2020)
Naoto Kido, Sumio Masuda, Kazuaki Yamaguchi
An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (11) (2019)
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound. CoRR (2018)
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem. CSII (selected papers) (2018)
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. Discret. Appl. Math. 223 (2017)
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
A fast heuristic for the minimum weight vertex cover problem. ICIS (2016)
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search. ACSC (2006)
Kazuaki Yamaguchi, Sumio Masuda
Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2006)