default search action
Akira Matsubayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]Akira Matsubayashi, Yushi Saito:
A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox. ATMOS 2023: 12:1-12:19 - [c11]Yu-Ting Wang, Meng-Hsun Tsai, Akira Matsubayashi:
Reducing Redundant Transmissions for Message Broadcast in Vehicular Ad Hoc Networks. CCNC 2023: 969-970 - 2021
- [j9]Akira Matsubayashi
:
Non-Greedy Online Steiner Trees on Outerplanar Graphs. Algorithmica 83(2): 613-640 (2021) - 2020
- [j8]Akira Matsubayashi
A $3+\varOmega (1)$ Lower Bound for Page Migration. Algorithmica 82(9): 2535-2563 (2020)
2010 – 2019
- 2016
- [j7]Amanj Khorramian
Uniform Page Migration Problem in Euclidean Space. Algorithms 9(3): 57 (2016) - [c10]Akira Matsubayashi:
Non-greedy Online Steiner Trees on Outerplanar Graphs. WAOA 2016: 129-141 - [i2]Amanj Khorramian, Akira Matsubayashi:
Online Page Migration on Ring Networks in Uniform Model. CoRR abs/1612.00989 (2016) - 2015
- [j6]Akira Matsubayashi
Asymptotically Optimal Online Page Migration on Three Points. Algorithmica 71(4): 1035-1064 (2015) - [j5]Akira Matsubayashi
Separator-based graph embedding into multidimensional grids with small edge-congestion. Discret. Appl. Math. 185: 119-137 (2015) - [c9]Akira Matsubayashi:
A 3+Omega(1) Lower Bound for Page Migration. CANDAR 2015: 314-320 - [c8]Akira Matsubayashi:
Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids. CANDAR 2015: 321-327 - 2014
- [i1]Akira Matsubayashi:
Separator-Based Graph Embedding into Multidimensional Grids with Small Edge-Congestion. CoRR abs/1402.7293 (2014) - 2012
- [c7]Akira Matsubayashi:
Asymptotically Optimal Online Page Migration on Three Points. WAOA 2012: 107-119 - 2011
- [j4]Atsushi Murata, Akira Matsubayashi
Minimum energy broadcast on rectangular grid wireless networks. Theor. Comput. Sci. 412(39): 5167-5175 (2011) - 2010
- [c6]Atsushi Murata, Akira Matsubayashi:
Minimum Energy Broadcast on Rectangular Grid Wireless Networks. ALGOSENSORS 2010: 34-46
2000 – 2009
- 2009
- [j3]Yasuyuki Kawamura, Akira Matsubayashi
Randomized Online File Allocation on Uniform Cactus Graphs. IEICE Trans. Inf. Syst. 92-D(12): 2416-2421 (2009) - [c5]Akira Matsubayashi:
Separator-based Graph Embedding into Higher-dimensional Grids with Small Congestion. ISCAS 2009: 2938-2941 - 2008
- [c4]Akira Matsubayashi, Yasuyuki Kawamura:
Randomized Online File Allocation on Uniform Ring Networks. ISPDC 2008: 449-453 - 2006
- [j2]Hiroaki Takai, Takashi Kanatani, Akira Matsubayashi
Path Coloring on Binary Caterpillars. IEICE Trans. Inf. Syst. 89-D(6): 1906-1913 (2006) - 2005
- [c3]Akira Matsubayashi:
Small congestion embedding of separable graphs into grids of the same size. ISCAS (2) 2005: 1354-1357 - 2003
- [c2]Akira Matsubayashi:
VLSI layout of trees into grids of minimum width. SPAA 2003: 75-84
1990 – 1999
- 1999
- [j1]Akira Matsubayashi
Small congestion embedding of graphs into hypercubes. Networks 33(1): 71-77 (1999) - [c1]Akira Matsubayashi, Ryo Takasu:
Minimum Congestion Embedding of Complete Binary Trees into Tori. COCOON 1999: 370-378
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: