![]() | ![]() |
| 2011 | ||
|---|---|---|
| 10 | Atsushi Murata, Akira Matsubayashi: Minimum energy broadcast on rectangular grid wireless networks. Theor. Comput. Sci. 412(39): 5167-5175 (2011) | |
| 2010 | ||
| 9 | Atsushi Murata, Akira Matsubayashi: Minimum Energy Broadcast on Rectangular Grid Wireless Networks. ALGOSENSORS 2010: 34-46 | |
| 2009 | ||
| 8 | Akira Matsubayashi: Separator-based Graph Embedding into Higher-dimensional Grids with Small Congestion. ISCAS 2009: 2938-2941 | |
| 7 | Yasuyuki Kawamura, Akira Matsubayashi: Randomized Online File Allocation on Uniform Cactus Graphs. IEICE Transactions 92-D(12): 2416-2421 (2009) | |
| 2008 | ||
| 6 | Akira Matsubayashi, Yasuyuki Kawamura: Randomized Online File Allocation on Uniform Ring Networks. ISPDC 2008: 449-453 | |
| 2006 | ||
| 5 | Hiroaki Takai, Takashi Kanatani, Akira Matsubayashi: Path Coloring on Binary Caterpillars. IEICE Transactions 89-D(6): 1906-1913 (2006) | |
| 2005 | ||
| 4 | Akira Matsubayashi: Small congestion embedding of separable graphs into grids of the same size. ISCAS (2) 2005: 1354-1357 | |
| 2003 | ||
| 3 | Akira Matsubayashi: VLSI layout of trees into grids of minimum width. SPAA 2003: 75-84 | |
| 1999 | ||
| 2 | Akira Matsubayashi, Ryo Takasu: Minimum Congestion Embedding of Complete Binary Trees into Tori. COCOON 1999: 370-378 | |
| 1 | Akira Matsubayashi, Shuichi Ueno: Small congestion embedding of graphs into hypercubes. Networks 33(1): 71-77 (1999) | |
| 1 | Takashi Kanatani | [5] |
| 2 | Yasuyuki Kawamura | [6] [7] |
| 3 | Atsushi Murata | [9] [10] |
| 4 | Hiroaki Takai | [5] |
| 5 | Ryo Takasu | [2] |
| 6 | Shuichi Ueno | [1] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page