Top > Publications

Publications

Selected Papers

• Akira Matsubayashi and Yushi Saito, A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), Open Access Series in Informatics (OASIcs), vol. 115, pp. 12:1-12:19, 2023. DOI:10.4230/OASIcs.ATMOS.2023.12. [Best Paper Award]
• Akira Matsubayashi, Non-Greedy Online Steiner Trees on Outerplanar Graphs, Algorithmica, vol. 83, no. 2, pp. 613-640, February 2021 (published online 16 October 2020). DOI:10.1007/s00453-020-00768-6. Preliminary version appeared in WAOA 2016 (LNCS 10138).
• Akira Matsubayashi, A 3+Omega(1) Lower Bound for Page Migration, Algorithmica, vol. 82, no. 9, pp. 2535-2563, September 2020 (published online 23 March 2020). DOI:10.1007/s00453-020-00696-5. Preliminary version appeared in CANDAR 2015.
• Amanj Khorramian and Akira Matsubayashi, Uniform Page Migration Problem in Euclidean Space, Algorithms vol. 9, no. 3, 57:1-7, August 2016. DOI:10.3390/a9030057. (manuscript)
• Akira Matsubayashi, Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids, Proceedings of the 3rd International Symposium on Computing and Networking (CANDAR 2015), pp. 321-327, 2015. DOI: 10.1109/CANDAR.2015.59. [presented at 7th International Workshop on Parallel and Distributed Algorithms and Applications and selected as Best Paper]
• Akira Matsubayashi, Separator-Based Graph Embedding into Multidimensional Grids with Small Edge-Congestion, Discrete Applied Mathematics, vol. 185, pp. 119-137, April 2015 (published online 12 December 2014). DOI: 10.1016/j.dam.2014.11.024. (manuscript)
• Akira Matsubayashi, Asymptotically Optimal Online Page Migration on Three Points, Algorithmica, vol. 71, no 4, pp. 1035-1064, April 2015 (published online 17 October 2013). DOI: 10.1007/s00453-013-9841-9. (manuscript). Preliminary version appeared in WAOA 2012 (LNCS 7846).
• Atsushi Murata and Akira Matsubayashi, Minimum Energy Broadcast on Rectangular Grid Wireless Networks, Theoretical Computer Science, vol. 421, no. 39, pp. 5167-5175, September 2011. DOI: 10.1016/j.tcs.2011.05.024. (manuscript). Preliminary version appeared in ALGOSENSORS 2010 (LNCS 6451).
• Yasuyuki Kawamura and Akira Matsubayashi, Randomized Online File Allocation on Uniform Cactus Graphs, IEICE Transactions on Information and Systems, vol. E92-D, no. 12, pp. 2416-2421, December 2009. DOI:10.1587/transinf.E92.D.2416. (manuscript). Preliminary version appeared in ISPDC 2008.
• Akira Matsubayashi, Uniform Page Migration on General Networks, International Journal of Pure and Applied Mathematics, vol. 42, no. 2, pp. 161-168, 2008. (info) (full text)
• Hiroaki Takai, Takashi Kanatani, and Akira Matsubayashi, Path Coloring on Binary Caterpillars, IEICE Transactions on Information and Systems, vol. E89-D, no. 6, pp. 1906-1913, June 2006. DOI:10.1093/ietisy/e89-d.6.1906. (manuscript)
• Akira Matsubayashi, VLSI Layout of Trees into Grids of Minimum Width, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E87-A, no. 5, pp. 1059-1069, May 2004. (manuscript). Preliminary version appeared in SPAA 2003 (DOI:10.1145/777412.777425).
• Akira Matsubayashi, On the Complexity of Minimum Congestion Embedding of Acyclic Graphs into Ladders, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E84-A, no. 5, pp. 1218-1226, May 2001. (manuscript)
• Akira Matsubayashi and Ryo Takasu, Minimum Congestion Embedding of Complete Binary Trees into Tori, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E83-A, no. 9, pp. 1804-1808, September 2000. (manuscript). Preliminary version appeared in COCOON 1999 (LNCS 1627).
• Akira Matsubayashi and Shuichi Ueno, Small Congestion Embedding of Graphs into Hypercubes, Networks, vol. 33, no. 1, pp. 71-77, January 1999. DOI: 10.1002/(SICI)1097-0037(199901)33:1<71::AID-NET5>3.0.CO;2-3. (manuscript)
• Akira Matsubayashi and Shuichi Ueno, A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E81-A, no. 5, pp. 729-737, May 1998. (manuscript)

    Top > Publications