Associate Professor MATSUBAYASHI, Akira
Faculty, Affiliation
Faculty of Electrical, Information and Communication Engineering,Institute of Science and Engineering
College and School Educational Field
Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and Technology
Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and Technology
Course in Information and Communication Engineering, School of Electrical, Information and Communication Engineering, College of Science and Engineering
Laboratory
Networks and Parallel Computation Laboratory
Academic Background
【Academic background(Doctoral/Master's Degree)】
Tokyo Institute of Technology Doctor Graduate School of Science and Engineering Division of Electrical and Electronic Engineering 1996 Completed
Tokyo Institute of Technology Master Interdisciplinary Graduate School of Science and Engineering Division of Intelligence Science 1993 Completed
【Academic background(Bachelor's Degree)】
Tokyo Institute of Technology 1991
Career
Utsunomiya University Department of Information Science, Faculty of Engineering Research Associate(1996/04/01-2000/03/31)
Kanazawa University Department of Information and Systems Engineering, Faculty of Engineering Research Associate(2000/04/01-2001/03/31)
Kanazawa University Department of Information and Systems Engineering, Faculty of Engineering Lecturer(2001/04/01-2008/03/31)
Kanazawa University School of Electrical and Computer Engineering, College of Science and Engineering Lecturer(2008/04/01-2014/12/31)
Kanazawa University School of Electrical and Computer Engineering, College of Science and Engineering Associate Professor(2015/01/01-2018/03/31)
Kanazawa University School of Electrical, information and Communication Engineering, College of Science and Engineering Associate Professor(2018/04/01-)
Year & Month of Birth
1968/10
Academic Society
The Institute of Electronics, Information and Communication Engineers
Information Processing Society of Japan
Society for Industrial and Applied Mathematics
Association for Computing Machinery
European Association for Theoretical Computer Science
Award
○Best Paper Award of ATMOS 2023(2023/09/07)
○7th International Workshop on Parallel and Distributed Algorithms and Applications: Best Paper Award(2015/12/10)
Specialities
Theory of informatics
Speciality Keywords
Computer Science, Algorithm Theory, Graph Theory, Combinatorial Optimization, Discrete Mathematics
Research Themes
Graph Networks, Parallel Computation, and Their Applications
Our research interest is in theoretical aspects of network design, network applications, and parallel computation.
Books
Papers
- A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox Akira Matsubayashi, Yushi Saito 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) 115 12:1-12:19 2023/09
- Reducing Redundant Transmissions for Message Broadcast in Vehicular Ad-Hoc Networks Yu-Ting Wang, Meng-Hsun Tsai, Akira Matsubayashi 2023 IEEE 20th Annual Consumer Communications & Networking Conference (CCNC) 969-970 2023/01
- Non-Greedy Online Steiner Trees on Outerplanar Graphs Akira Matsubayashi Algorithmica 83 2 613-640 2021/02
- A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi Algorithmica 82 9 2535-2563 2020/09
- Uniform Page Migration Problem in Euclidean Space Amanj Khorramian, Akira Matsubayashi Algorithms 9 3 2016/08
- Non-Greedy Online Steiner Trees on Outerplanar Graphs Akira Matsubayashi Proceedings of the 14th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science 10138 129-141 2016/08
- Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids Akira Matsubayashi Proceedings of the 3rd International Symposium on Computing and Networking 321-327 2015/12
- A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi Proceedings of the 3rd International Symposium on Computing and Networking 314-320 2015/12
- Separator-based graph embedding into multidimensional grids with small edge-congestion Akira Matsubayashi Discrete Applied Mathematics 185 20 119-137 2015/04
- Asymptotically Optimal Online Page Migration on Three Points Akira Matsubayashi Algorithmica 71 4 1035-1064 2015/04
- Asymptotically Optimal Online Page Migration on Three Points Akira Matsubayashi Proceedings of the 10th Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science 7846 107-119 2012/09
- Minimum Energy Broadcast on Rectangular Grid Wireless Networks Atsushi Murata, Akira Matsubayashi THEORETICAL COMPUTER SCIENCE 421 39 5167-5175 2011/09
- Minimum Energy Broadcast on Rectangular Grid Wireless Networks Atsushi Murata, Akira Matsubayashi Proceedings of the 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities 2010/07
- Randomized Online File Allocation on Uniform Cactus Graphs Yasuyuki Kawamura, Akira Matsubayashi IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E92-D 12 2009/12
- Separator-Based Graph Embedding into Higher-Dimensional Grids with Small Congestion Akira Matsubayashi Proceedings of the 2009 IEEE International Symposium on Circuits and Systems 2938-2941 2009/05
- Randomized Online File Allocation on Uniform Ring Networks Yasuyuki Kawamura, Akira Matsubayashi Proceedings of the 7th International Symposium on Parallel and Distributed Computing 449-453 2008/07
- Uniform Page Migration on General Networks Akira Matsubayashi International Journal of Pure and Applied Mathematics 42 2 161-168 2008/01
- Page Migration on Ring Networks Akira Matsubayashi Fourth International Conference of Applied Mathematics and Computing 5 369 2007/08
- Path Coloring on Binary Caterpillars Hiroaki Takai, Takashi Kanatani, Akira Matsubayashi IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E89D 6 1906-1913 2006/06
- Small Congestion Embedding of Separable Graphs into Grids of the Same Size Akira Matsubayashi Proc. 2005 IEEE International Symposium on Circuits and Systems 1354-1357 2005/05
- VLSI Layout of Trees into Grids of Minimum Width Akira Matsubayashi IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E87A 5 1059-1069 2004/05
- VLSI Layout of Trees into Rectangular Grids of Small Width Akira Matsubayashi Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures 75-84 2003/06
- On the Complexity of Minimum Congestion Embedding of Acyclic Graphs into Ladders Akira Matsubayashi IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E84A 5 1218-1226 2001/05
- The Complexity of Embedding of Acyclic Graphs into Grids with Minimum Congestion Akira Matsubayashi, Masaya Yokota IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E83A 11 2390-2394 2000/11
- Minimum Congestion Embedding of Complete Binary Trees into Tori Akira Matsubayashi, Ryo Takasu IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E83A 9 1804-1808 2000/09
- Minimum Congestion Embedding of Complete Binary Trees into Tori Akira Matsubayashi, Ryo Takasu Proceedings of 5th Annual International Computing and Combinatorics Conference 370-378 1999/07
- Small Congestion Embedding of Graphs into Hypercubes Akira Matsubayashi, Shuichi Ueno NETWORKS 33 1 71-77 1999/01
- A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two Akira Matsubayashi, Shuichi Ueno IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E81A 5 729-737 1998/05
- On the Complexity of Embedding of Graphs into Grids with Minimum Congestion Akira Matsubayashi, Shuichi Ueno IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUT E79A 4 469-476 1996/04
Conference Presentations
- A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox(conference：23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023))(2023/09/07)
- Reducing Redundant Transmissions for Message Broadcast in Vehicular Ad-Hoc Networks(conference：IEEE 20th Annual Consumer Communications & Networking Conference)(2023/01/09)
- Non-Greedy Online Steiner Trees on Outerplanar Graphs(conference：14th Workshop on Approximation and Online Algorithms)(2016/08)
- Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids(conference：7th International Workshop on Parallel and Distributed Algorithms and Applications)(2015/12)
- A 3+Omega(1) Lower Bound for Page Migration(conference：7th International Workshop on Parallel and Distributed Algorithms and Applications)(2015/12)
- Asymptotically Optimal Online Page Migration on Three Points(conference：10th Workshop on Approximation and Online Algorithms)(2012/09)
- Minimum Energy Broadcast on Rectangular Grid Wireless Networks(conference：6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities)(2010/07)
- Separator-Based Graph Embedding into Higher-Dimensional Grids with Small Congestion(conference：2009 IEEE International Symposium on Circuits and Systems)(2009/05)
- Randomized Online File Allocation on Uniform Ring Networks(conference：7th International Symposium on Parallel and Distributed Computing)(2008/07)
- Page Migration on Ring Networks(conference：Fourth International Conference of Applied Mathematics and Computing)(2007/08)
- Small Congestion Embedding of Separable Graphs into Grids of the Same Size(conference：2005 IEEE International Symposium on Circuits and Systems)(2005/05)
- VLSI Layout of Trees into Rectangular Grids of Small Width(conference：15th Annual ACM Symposium on Parallelism in Algorithms and Architectures)(2003/06)
- Minimum Congestion Embedding of Complete Binary Trees into Tori(conference：5th Annual International Computing and Combinatorics Conference)(1999/07)
Others
- An asymptotically optimal online algorithm for k-page migration on k+1 points Ikuma Nihei and Akira Matsubayashi 1 223-224 2022/03
- A Polynomial Time Algorithm for Deciding Directed Graphs Invulnerable to Braess's Paradox Yushi Saito and Akira Matsubayashi 1 243-244 2022/03
- Better Embedding of k-Outerplanar Graphs into Random Trees Akira Matsubayashi 2020-AL-177 4 1-8 2020/03
- An Improved Algorithm for Uniform Page Migration on Euclidean Space Akira Matsubayashi 2018-AL-170 2 2018/11
- A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi 115 84 29-36 2015/06
- Better Online Steiner Trees on Outerplanar Graphs Akira Matsubayashi 2015-AL-155 2 2015/11
- Online Steiner Trees on Outerplanar Graphs Akira Matsubayashi 2014-AL-150 8 2014/11
- Bounding Dilation of Separator-Based Graph Embeddings into Grids Akira Matsubayashi 2013-AL-145 18 2013/11
- Minimum Energy Broadcast on Rectangular Grid Wireless Networks Atsushi Murata and Akira Matsubayashi 110 104 29-35 2010/06/25
- Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks Youhei Kouchi and Akira Matsubayashi 111 293 101-106 2011/11/17
- A Lower Bound of Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks Youhei Kouchi and Akira Matsubayashi 112 340 27-31 2012/12/10
- New Bounds for Online Page Migration on Three Points 2008 108 49-56 2008/11/06
- Separator-Based Graph Embedding into Higher-Dimensional Grids with Small Congestion 108 277 11-16 2008/11/05