We stand with Ukraine  

Akira Matsubayashi

Orcid: 0000-0002-7861-4876

According to our database1, Akira Matsubayashi authored at least 19 papers between 1999 and 2023.

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

Timeline

2000
2005
2010
2015
2020
0
1
2
3
4
5
1
1
2
2
1
1
1
1
2
2
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Reducing Redundant Transmissions for Message Broadcast in Vehicular Ad Hoc Networks.
[BibTeX]
[DOI]
Yu-Ting Wang
,
Meng-Hsun Tsai
,
Akira Matsubayashi
Proceedings of the 20th IEEE Consumer Communications & Networking Conference, 2023

A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox.
[BibTeX]
[DOI]
Akira Matsubayashi
,
Yushi Saito
Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2021
Non-Greedy Online Steiner Trees on Outerplanar Graphs.
[BibTeX]
[DOI]
Akira Matsubayashi
Algorithmica, 2021

2020
A $3+\varOmega (1)$ Lower Bound for Page Migration.
[BibTeX]
[DOI]
Akira Matsubayashi
Algorithmica, 2020

2016
Online Page Migration on Ring Networks in Uniform Model.
[BibTeX]
[DOI]
Amanj Khorramian
,
Akira Matsubayashi
CoRR, 2016

Uniform Page Migration Problem in Euclidean Space.
[BibTeX]
[DOI]
Amanj Khorramian
,
Akira Matsubayashi
Algorithms, 2016

2015
Separator-based graph embedding into multidimensional grids with small edge-congestion.
[BibTeX]
[DOI]
Akira Matsubayashi
Discret. Appl. Math., 2015

Asymptotically Optimal Online Page Migration on Three Points.
[BibTeX]
[DOI]
Akira Matsubayashi
Algorithmica, 2015

Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids.
[BibTeX]
[DOI]
Akira Matsubayashi
Proceedings of the Third International Symposium on Computing and Networking, 2015

A 3+Omega(1) Lower Bound for Page Migration.
[BibTeX]
[DOI]
Akira Matsubayashi
Proceedings of the Third International Symposium on Computing and Networking, 2015

2011
Minimum energy broadcast on rectangular grid wireless networks.
[BibTeX]
[DOI]
Atsushi Murata
,
Akira Matsubayashi
Theor. Comput. Sci., 2011

2009
Randomized Online File Allocation on Uniform Cactus Graphs.
[BibTeX]
[DOI]
Yasuyuki Kawamura
,
Akira Matsubayashi
IEICE Trans. Inf. Syst., 2009

Separator-based Graph Embedding into Higher-dimensional Grids with Small Congestion.
[BibTeX]
[DOI]
Akira Matsubayashi
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

2008
Randomized Online File Allocation on Uniform Ring Networks.
[BibTeX]
[DOI]
Akira Matsubayashi
,
Yasuyuki Kawamura
Proceedings of the 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 2008

2006
Path Coloring on Binary Caterpillars.
[BibTeX]
[DOI]
Hiroaki Takai
,
Takashi Kanatani
,
Akira Matsubayashi
IEICE Trans. Inf. Syst., 2006

2005
Small congestion embedding of separable graphs into grids of the same size.
[BibTeX]
[DOI]
Akira Matsubayashi
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2003
VLSI layout of trees into grids of minimum width.
[BibTeX]
[DOI]
Akira Matsubayashi
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

1999
Small congestion embedding of graphs into hypercubes.
[BibTeX]
[DOI]
Akira Matsubayashi
,
Shuichi Ueno
Networks, 1999

Minimum Congestion Embedding of Complete Binary Trees into Tori.
[BibTeX]
[DOI]
Akira Matsubayashi
,
Ryo Takasu
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999


  Loading...