The SCEAS System
| |||||||

## Search the dblp DataBase
Shuichi Ueno:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kumiko Nomura, Satoshi Tayu, Shuichi Ueno
**On the Orthogonal Drawing of Outerplanar Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2004, pp:300-308 [Conf] - Toshinori Yamada, Koji Yamamoto, Shuichi Ueno
**Fault-tolerant graphs for hypercubes and tori.**[Citation Graph (0, 0)][DBLP] HICSS (2), 1995, pp:499-505 [Conf] - Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
**Mixed-Searching and Proper-Path-Width.**[Citation Graph (0, 0)][DBLP] ISA, 1991, pp:61-71 [Conf] - Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
**On-Line Multicasting in All-Optical Networks.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:99-106 [Conf] - Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
**On Adaptive Fault Diagnosis for Multiprocessor Systems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:86-98 [Conf] - Shuichi Ueno, Michihiro Yamazaki
**Graph Spanners and Connectivity.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:126-134 [Conf] - Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno
**On the three-dimensional channel routing.**[Citation Graph (0, 0)][DBLP] ISCAS (1), 2005, pp:180-183 [Conf] - Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno
**On VLSI decompositions for d-ary de Bruijn graphs (extended abstract).**[Citation Graph (0, 0)][DBLP] ISCAS (2), 2005, pp:1358-1361 [Conf] - Toshinori Yamada, Kumiko Nomura, Shuichi Ueno
**Optimal adaptive parallel diagnosis for arrays.**[Citation Graph (0, 0)][DBLP] ISCAS (3), 2003, pp:854-857 [Conf] - Toshinori Yamada, Shuichi Ueno
**Fault-Tolerant Graphs for Tori.**[Citation Graph (0, 0)][DBLP] ISPAN, 1996, pp:408-414 [Conf] - Toshinori Yamada, Shuichi Ueno
**Fault-Tolerant Hypercubes with Small Degree.**[Citation Graph (0, 0)][DBLP] ISPAN, 1997, pp:179-185 [Conf] - Toshinori Yamada, Shuichi Ueno
**Sparse Networks Tolerating Random Faults.**[Citation Graph (0, 0)][DBLP] ISPAN, 1999, pp:114-118 [Conf] - Shin'ichiro Tago, Shuichi Ueno
**Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections.**[Citation Graph (0, 0)][DBLP] ISPAN, 1997, pp:44-48 [Conf] - Toshinori Yamada, Shuichi Ueno
**Fault-Tolerant Meshes with Efficient Layouts.**[Citation Graph (0, 0)][DBLP] PDPTA, 1997, pp:1623-1632 [Conf] - Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno
**Cost-Constrained Minimum-Delay Multicasting.**[Citation Graph (0, 0)][DBLP] SOFSEM, 2005, pp:330-339 [Conf] - Toshinori Yamada, Shuichi Ueno
**Optimal fault-tolerant linear arrays.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:60-64 [Conf] - Tadashi Arai, Shuichi Ueno, Yoji Kajitani
**Generalization of aTheorem on the Parametric Maximum Flow Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:41, n:1, pp:69-74 [Journal] - Toshinori Yamada, Kumiko Nomura, Shuichi Ueno
**Sparse networks tolerating random faults.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:137, n:2, pp:223-235 [Journal] - Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno
**On sequential diagnosis of multiprocessor systems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:146, n:3, pp:311-342 [Journal] - Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
**Approximating Steiner trees in graphs with restricted weights.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:31, n:4, pp:283-292 [Journal] - Akira Matsubayashi, Shuichi Ueno
**Small congestion embedding of graphs into hypercubes.**[Citation Graph (0, 0)][DBLP] Networks, 1999, v:33, n:1, pp:71-77 [Journal] - Toshinori Yamada, Shuichi Ueno
**Fault-tolerant graphs for tori.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:3, pp:181-188 [Journal] - Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
**Mixed Searching and Proper-Path-Width.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:137, n:2, pp:253-268 [Journal] - Satoshi Tayu, Shuichi Ueno
**On the Complexity of Three-Dimensional Channel Routing (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ISCAS, 2007, pp:3399-3402 [Conf] - S. Tayu, K. Nomura, S. Ueno
**On the two-dimensional orthogonal drawing of series-parallel graphs.**[Citation Graph (0, 0)][DBLP] ISCAS, 2006, pp:- [Conf] - Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano
**Ordering of the elements of a matroid such that its consecutive w elements are independent.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:72, n:1-3, pp:187-194 [Journal] - Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh
**On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:72, n:1-3, pp:355-360 [Journal] - Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
**Minimal acyclic forbidden minors for the family of graphs with bounded path-width.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:1-3, pp:293-304 [Journal] **Universal Test Sets for Reversible Circuits.**[Citation Graph (, )][DBLP]**On the Fault Testing for Reversible Circuits.**[Citation Graph (, )][DBLP]**On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract).**[Citation Graph (, )][DBLP]**On the two-dimensional orthogonal drawing of series-parallel graphs.**[Citation Graph (, )][DBLP]**On orthogonal ray graphs.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |