- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j23 |      | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno: Bandwidth of convex bipartite graphs and related graphs. Inf. Process. Lett. 112(11): 411-417 (2012) |
| c27 | | Asahi Takaoka, Satoshi Tayu, Shuichi Ueno: On Minimum Feedback Vertex Sets in Graphs. ICNC 2012: 429-434 |
| 2011 | ||
| j22 | | Anish Man Singh Shrestha, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno: On Two Problems of Nano-PLA Design. IEICE Transactions 94-D(1): 35-41 (2011) |
| c26 | | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno: Bandwidth of Convex Bipartite Graphs and Related Graphs. COCOON 2011: 307-318 |
| c25 | | Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno: Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement. ISVLSI 2011: 96-101 |
| 2010 | ||
| j21 | | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno: On orthogonal ray graphs. Discrete Applied Mathematics 158(15): 1650-1659 (2010) |
| c24 | | Satoshi Tayu, Shota Fukuyama, Shuichi Ueno: Universal Test Sets for Reversible Circuits. COCOON 2010: 348-357 |
| c23 | | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno: On two-directional orthogonal ray graphs. ISCAS 2010: 1807-1810 |
| 2009 | ||
| j20 | | Satoshi Tayu, Kumiko Nomura, Shuichi Ueno: On the two-dimensional orthogonal drawing of series-parallel graphs. Discrete Applied Mathematics 157(8): 1885-1895 (2009) |
| c22 | | Satoshi Tayu, Takuya Oshima, Shuichi Ueno: On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. ISCAS 2009: 836-839 |
| c21 | | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno: Orthogonal Ray Graphs and Nano-PLA Design. ISCAS 2009: 2930-2933 |
| 2008 | ||
| j19 | | Satoshi Tayu, Shigeru Ito, Shuichi Ueno: On Fault Testing for Reversible Circuits. IEICE Transactions 91-D(12): 2770-2775 (2008) |
| j18 | | Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno: Cost-Constrained Minimum-Delay Multicasting. Journal of Interconnection Networks 9(1/2): 141-155 (2008) |
| c20 | | Satoshi Tayu, Kumiko Nomura, Shuichi Ueno: On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). ISCAS 2008: 212-215 |
| 2007 | ||
| j17 | | Masahiko Nishimoto, Keiichi Nagayoshi, Shuichi Ueno, Yusuke Kimura: Classification of Landmine-Like Objects Buried under Rough Ground Surfaces Using a Ground Penetrating Radar. IEICE Transactions 90-C(2): 327-333 (2007) |
| c19 | | Satoshi Tayu, Shigeru Ito, Shuichi Ueno: On the Fault Testing for Reversible Circuits. ISAAC 2007: 812-821 |
| c18 | | Satoshi Tayu, Shuichi Ueno: On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). ISCAS 2007: 3399-3402 |
| 2006 | ||
| c17 | | Satoshi Tayu, Kumiko Nomura, Shuichi Ueno: On the two-dimensional orthogonal drawing of series-parallel graphs. ISCAS 2006 |
| 2005 | ||
| j16 | | Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno: On sequential diagnosis of multiprocessor systems. Discrete Applied Mathematics 146(3): 311-342 (2005) |
| j15 | | Koji Goda, Toshinori Yamada, Shuichi Ueno: A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems. IEICE Transactions 88-A(4): 1090-1092 (2005) |
| j14 | | Kumiko Nomura, Satoshi Tayu, Shuichi Ueno: On the Orthogonal Drawing of Outerplanar Graphs. IEICE Transactions 88-A(6): 1583-1588 (2005) |
| j13 | | Kohsuke Ogata, Toshinori Yamada, Shuichi Ueno: A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System. IEICE Transactions 88-A(12): 3661-3662 (2005) |
| c16 | | Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno: On the three-dimensional channel routing. ISCAS (1) 2005: 180-183 |
| c15 | | Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno: On VLSI decompositions for d-ary de Bruijn graphs (extended abstract). ISCAS (2) 2005: 1358-1361 |
| c14 | | Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno: Cost-Constrained Minimum-Delay Multicasting. SOFSEM 2005: 330-339 |
| 2004 | ||
| j12 | | Toshinori Yamada, Kumiko Nomura, Shuichi Ueno: Sparse networks tolerating random faults. Discrete Applied Mathematics 137(2): 223-235 (2004) |
| c13 | | Kumiko Nomura, Satoshi Tayu, Shuichi Ueno: On the Orthogonal Drawing of Outerplanar Graphs. COCOON 2004: 300-308 |
| 2003 | ||
| c12 | | Toshinori Yamada, Kumiko Nomura, Shuichi Ueno: Optimal adaptive parallel diagnosis for arrays. ISCAS (3) 2003: 854-857 |
| c11 | | |
| 2001 | ||
| c10 | | Kumiko Nomura, Toshinori Yamada, Shuichi Ueno: On Adaptive Fault Diagnosis for Multiprocessor Systems. ISAAC 2001: 86-98 |
| c9 | | Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno: On-Line Multicasting in All-Optical Networks. ISAAC 2001: 99-106 |
| 1999 | ||
| j11 | | Akira Matsubayashi, Shuichi Ueno: Small congestion embedding of graphs into hypercubes. Networks 33(1): 71-77 (1999) |
| c8 | | |
| 1998 | ||
| j10 | | Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani: Approximating Steiner trees in graphs with restricted weights. Networks 31(4): 283-292 (1998) |
| j9 | | |
| 1997 | ||
| c7 | | Shin-ichiro Tago, Shuichi Ueno: Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections. ISPAN 1997: 44-48 |
| c6 | | |
| c5 |  | |
| 1996 | ||
| c4 | | |
| 1995 | ||
| j8 | | Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani: Mixed Searching and Proper-Path-Width. Theor. Comput. Sci. 137(2): 253-268 (1995) |
| c3 | | Toshinori Yamada, Koji Yamamoto, Shuichi Ueno: Fault-tolerant graphs for hypercubes and tori. HICSS (2) 1995: 499-505 |
| 1994 | ||
| j7 | | Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani: Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Mathematics 127(1-3): 293-304 (1994) |
| 1993 | ||
| j6 | | Tadashi Arai, Shuichi Ueno, Yoji Kajitani: Generalization of aTheorem on the Parametric Maximum Flow Problem. Discrete Applied Mathematics 41(1): 69-74 (1993) |
| 1992 | ||
| c2 | | |
| 1991 | ||
| c1 | | Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani: Mixed-Searching and Proper-Path-Width. ISA 1991: 61-71 |
| 1988 | ||
| j5 | | Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano: Ordering of the elements of a matroid such that its consecutive w elements are independent. Discrete Mathematics 72(1-3): 187-194 (1988) |
| j4 | | 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. Discrete Mathematics 72(1-3): 355-360 (1988) |
| j3 | | Shuichi Ueno, Yoji Kajitani, Hajime Wada: Minimum augmentation of a tree to a K-edge-connected graph. Networks 18(1): 19-25 (1988) |
| 1986 | ||
| j2 | | Yoji Kajitani, Akio Ishizuka, Shuichi Ueno: Characterization of partial 3-trees in terms of three structures. Graphs and Combinatorics 2(1): 233-246 (1986) |
| j1 | | Yoji Kajitani, Shuichi Ueno: The minimum augmentation of a directed tree to a k-edge-connected directed graph. Networks 16(2): 181-197 (1986) |
Colors in the list of coauthors
Last update Fri May 24 21:39:37 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page