 | 2009 |
|---|
| 14 |       | Satoshi Tayu,
Kumiko Nomura,
Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs.
Discrete Applied Mathematics 157(8): 1885-1895 (2009) |
| 2008 |
|---|
| 13 | | Satoshi Tayu,
Kumiko Nomura,
Shuichi Ueno:
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract).
ISCAS 2008: 212-215 |
| 12 | | Satoshi Tayu,
Shigeru Ito,
Shuichi Ueno:
On Fault Testing for Reversible Circuits.
IEICE Transactions 91-D(12): 2770-2775 (2008) |
| 11 | | Satoshi Tayu,
Turki Ghazi Al-Mutairi,
Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting.
Journal of Interconnection Networks 9(1/2): 141-155 (2008) |
| 2007 |
|---|
| 10 | | Satoshi Tayu,
Shigeru Ito,
Shuichi Ueno:
On the Fault Testing for Reversible Circuits.
ISAAC 2007: 812-821 |
| 9 | | Satoshi Tayu,
Shuichi Ueno:
On the Complexity of Three-Dimensional Channel Routing (Extended Abstract).
ISCAS 2007: 3399-3402 |
| 2006 |
|---|
| 8 | | Satoshi Tayu,
Kumiko Nomura,
Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs.
ISCAS 2006 |
| 2005 |
|---|
| 7 | | Satoshi Tayu,
Patrik Hurtig,
Yoshiyasu Horikawa,
Shuichi Ueno:
On the three-dimensional channel routing.
ISCAS (1) 2005: 180-183 |
| 6 | | Satoshi Tayu,
Turki Ghazi Al-Mutairi,
Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting.
SOFSEM 2005: 330-339 |
| 5 | | Kumiko Nomura,
Satoshi Tayu,
Shuichi Ueno:
On the Orthogonal Drawing of Outerplanar Graphs.
IEICE Transactions 88-A(6): 1583-1588 (2005) |
| 2004 |
|---|
| 4 | | Kumiko Nomura,
Satoshi Tayu,
Shuichi Ueno:
On the Orthogonal Drawing of Outerplanar Graphs.
COCOON 2004: 300-308 |
| 2000 |
|---|
| 3 | | Koji Ohashi,
Mineo Kaneko,
Satoshi Tayu:
Assignment-Space Exploration Approach to Concurrent Data-Path/Floorplan Synthesis.
ICCD 2000: 370- |
| 2 | | Satoshi Tayu,
Motoyasu Katsura,
Mineo Kaneko:
An Approximation Algorithm for Multiprocessor Scheduling of Trees with Communication Delays.
ISPAN 2000: 114-120 |
| 1999 |
|---|
| 1 | | Satoshi Tayu:
Scheduling Trees onto Hypercubes and Grids Is NP-complete.
COCOON 1999: 251-260 |
