Akira Matsubayashi. Non-Greedy Online Steiner Trees on Outerplanar Graphs. Algorithmica. 2020
Akira Matsubayashi. A 3+Omega (1) Lower Bound for Page Migration. Algorithmica. 2020. 82. 9. 2535-2563
Akira Matsubayashi. Non-greedy online steiner trees on outerplanar graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. 10138. 129-141
Amanj Khorramian, Akira Matsubayashi. Uniform page migration problem in Euclidean space. Algorithms. 2016. 9. 3
MATSUBAYASHI Akira. On the Complexity of Minimum Congestion Embedding of Acyclic Graphs into Ladders. IEICE transactions on fundamentals of electronics, communications and computer sciences. 2001. 84. 5. 1218-1226
2015/12 - 7th International Workshop on Parallel and Distributed Algorithms and Applications Best Paper Award
所属学会 (5件):
Society for Industrial and Applied Mathematics
, Association for Computing Machinery
, 電子情報通信学会
, 情報処理学会
, European Association for Theoretical Computer Science