| A new exact algorithm for the maximum weight clique problem K Yamaguchi, S Masuda ITC-CSCC: international technical conference on circuits systems, computers …, 2008 | 77 | 2008 |
| Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search K Tokoro, K Yamaguchi, S Masuda Proceedings of the 29th Australasian Computer Science Conference-Volume 48 …, 2006 | 25 | 2006 |
| A branch-and-bound based exact algorithm for the maximum edge-weight clique problem S Shimizu, K Yamaguchi, S Masuda Computational Science/Intelligence & Applied Informatics 5, 27-47, 2019 | 19 | 2019 |
| A maximum edge-weight clique extraction algorithm based on branch-and-bound S Shimizu, K Yamaguchi, S Masuda Discrete Optimization 37, 100583, 2020 | 16 | 2020 |
| Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound S Shimizu, K Yamaguchi, T Saitoh, S Masuda Discrete Applied Mathematics 223, 120-134, 2017 | 16 | 2017 |
| Some improvements on kumlander-s maximum weight clique extraction algorithm S Shimizu, K Yamaguchi, T Saitoh, S Masuda International Journal of Computer and Information Engineering 6 (12), 1776-1780, 2012 | 15 | 2012 |
| Optimal table method for finding the maximum weight clique S Shimizu, K Yamaguchi, T Saitoh, S Masuda Proceedings of the 13th International Conference on Applied Computer Science …, 2013 | 11 | 2013 |
| An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem K Yamaguchi, S Masuda IEICE transactions on fundamentals of electronics, communications and …, 2006 | 10 | 2006 |
| A fast heuristic for the minimum weight vertex cover problem S Shimizu, K Yamaguchi, T Saitoh, S Masuda 2016 IEEE/ACIS 15th International Conference on Computer and Information …, 2016 | 9 | 2016 |
| 局所探索法による階層的描画の辺交差削減 田守健太郎， 山口一章， 増田澄男 電子情報通信学会論文誌 A 92 (1), 55-61, 2009 | 9 | 2009 |
| Placement of vertex labels in a graph drawing N Abe, S Masuda, K Yamaguchi IEICE transactions on fundamentals of electronics, communications and …, 2004 | 8 | 2004 |
| 階層グラフ描画におけるダミー頂点の共有 荒木徹也， 増田澄男， 山口一章 電子情報通信学会論文誌 A 94 (12), 950-959, 2011 | 6 | 2011 |
| 有向グラフ描画アルゴリズムにおける閉路削除法の改良 寺本正幸， 増田澄男， 山口一章 電子情報通信学会論文誌 A 92 (6), 434-439, 2009 | 3 | 2009 |
| 折れ線や曲線を用いた無向グラフ描画アルゴリズム 萱原雅之， 増田澄男， 山口一章 電子情報通信学会論文誌 A 83 (4), 402-411, 2000 | 3 | 2000 |
| Parallelization of a branch-and-bound algorithm for the maximum weight clique problem S Shimizu, K Yamaguchi, S Masuda Discrete Optimization 41, 100646, 2021 | 2 | 2021 |
| An algorithm for the map labeling problem with two kinds of priorities N Abe, Y Amai, T Nakatake, S Masuda, K Yamaguchi International Journal of Computer and Information Engineering 8 (5), 802-805, 2014 | 2 | 2014 |
| A genetic method to extend an algorithm for the maximum clique problem to an algorithm for the maximum weighted clique problem K Yamaguchi Proceedings of the 2004 International Technical Conference of Circuits …, 2004 | 2 | 2004 |
| An algorithm for labeling edges in a graph drawing N Abe, S Masuda, K Yamaguchi IEICE Trans. Fundamentals (Japanese Edition) 85, 306-314, 0 | 2 | |
| An exact algorithm for the arrow placement problem in directed graph drawings N Kido, S Masuda, K Yamaguchi IEICE Transactions on Fundamentals of Electronics, Communications and …, 2019 | 1 | 2019 |
| An algorithm for finding an orthogonal drawing of a hierarchical graph T Araki, S Masuda, I Matoba, K Yamaguchi, T Saitoh IEICE Technical Report; IEICE Tech. Rep. 113 (14), 35-42, 2013 | 1 | 2013 |
