Kazuaki Yamaguchi

Orcid: 0000-0002-0856-122X

According to our database1, Kazuaki Yamaguchi authored at least 10 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An experimental evaluation of upper bounds of clique weights based on graph coloring.
Proceedings of the 8th IEEE/ACIS International Conference on Big Data, 2023

2022
Independent Sets Extraction Graph Coloring Algorithm Using Beam Search.
Proceedings of the 24th IEEE/ACIS International Conference on Software Engineering, 2022

2021
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem.
Discret. Optim., 2021

2020
A maximum edge-weight clique extraction algorithm based on branch-and-bound.
Discret. Optim., 2020

2019
An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

2018
A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem.
Proceedings of the Computational Science/Intelligence & Applied Informatics, 2018

2017
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.
Discret. Appl. Math., 2017

2016
A fast heuristic for the minimum weight vertex cover problem.
Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2006
An <i>A</i><sup>*</sup> Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search.
Proceedings of the Computer Science 2006, 2006


  Loading...