A matroid generalization of theorems of Lewin and Gallai. - Yoji Kajitani; Shuichi Ueno (Discret. Appl. Math., 1984)

Characterization of partial 3-trees in terms of three structures. - Yoji Kajitani; Akio Ishizuka; Shuichi Ueno (Graphs Comb., 1986)

The minimum augmentation of a directed tree to a k-edge-connected directed graph. - Yoji Kajitani; Shuichi Ueno (Networks, 1986)

Ordering of the elements of a matroid such that its consecutive w elements are independent. - Yoji Kajitani; Shuichi Ueno; Hiroshi Miyano (Discret. Math., 1988)

On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. - Shuichi Ueno; Yoji Kajitani; Shin'ya Gotoh (Discret. Math., 1988)

Minimum augmentation of a tree to a K-edge-connected graph. - Shuichi Ueno; Yoji Kajitani; Hajime Wada (Networks, 1988)

Mixed-Searching and Proper-Path-Width. - Atsushi Takahashi 001; Shuichi Ueno; Yoji Kajitani (ISA, 1991)

Graph Spanners and Connectivity. - Shuichi Ueno; Michihiro Yamazaki (ISAAC, 1992)

Generalization of aTheorem on the Parametric Maximum Flow Problem. - Tadashi Arai; Shuichi Ueno; Yoji Kajitani (Discret. Appl. Math., 1993)

Minimal acyclic forbidden minors for the family of graphs with bounded path-width. - Atsushi Takahashi 001; Shuichi Ueno; Yoji Kajitani (Discret. Math., 1994)

Fault-tolerant graphs for hypercubes and tori. - Toshinori Yamada; Koji Yamamoto; Shuichi Ueno (HICSS (2), 1995)

Fault-Tolerant Graphs for Tori. - Toshinori Yamada; Shuichi Ueno (ISPAN, 1996)

Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections. - Shin-ichiro Tago; Shuichi Ueno (ISPAN, 1997)

Fault-Tolerant Hypercubes with Small Degree. - Toshinori Yamada; Shuichi Ueno (ISPAN, 1997)

Fault-Tolerant Meshes with Efficient Layouts. - Toshinori Yamada; Shuichi Ueno (PDPTA, 1997)

Approximating Steiner trees in graphs with restricted weights. - Magnús M. Halldórsson; Shuichi Ueno; Hiroshi Nakao; Yoji Kajitani (Networks, 1998)

On VLSI decompositions for deBruijn graphs. - Toshinori Yamada; Satoshi Imai; Shuichi Ueno (ISCAS (6), 1999)

Sparse Networks Tolerating Random Faults. - Toshinori Yamada; Shuichi Ueno (ISPAN, 1999)

Small congestion embedding of graphs into hypercubes. - Akira Matsubayashi; Shuichi Ueno (Networks, 1999)

On-Line Multicasting in All-Optical Networks. - Kenta Hashimoto; Toshinori Yamada; Shuichi Ueno (ISAAC, 2001)

On Adaptive Fault Diagnosis for Multiprocessor Systems. - Kumiko Nomura; Toshinori Yamada; Shuichi Ueno (ISAAC, 2001)

On three-dimensional layout of pyramid networks. - Toshinori Yamada; Nobuaki Fujii; Shuichi Ueno (APCCAS (1), 2002)

Optimal Layouts of Virtual Paths in Complete Binary Tree Networks. - Suguru Amitani; Toshinori Yamada; Shuichi Ueno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Optimal adaptive parallel diagnosis for arrays. - Toshinori Yamada; Kumiko Nomura; Shuichi Ueno (ISCAS (3), 2003)

Optimal fault-tolerant linear arrays. - Toshinori Yamada; Shuichi Ueno (SPAA, 2003)

On the Orthogonal Drawing of Outerplanar Graphs. - Kumiko Nomura; Satoshi Tayu; Shuichi Ueno (COCOON, 2004)

Sparse networks tolerating random faults. - Toshinori Yamada; Kumiko Nomura; Shuichi Ueno (Discret. Appl. Math., 2004)

On the three-dimensional channel routing. - Satoshi Tayu; Patrik Hurtig; Yoshiyasu Horikawa; Shuichi Ueno (ISCAS (1), 2005)

On VLSI decompositions for d-ary de Bruijn graphs (extended abstract). - Toshinori Yamada; Hiroyuki Kawakita; Tadashi Nishiyama; Shuichi Ueno (ISCAS (2), 2005)

Cost-Constrained Minimum-Delay Multicasting. - Satoshi Tayu; Turki Ghazi Al-Mutairi; Shuichi Ueno (SOFSEM, 2005)

On sequential diagnosis of multiprocessor systems. - Toshinori Yamada; Takashi Ohtsuka; Akitsugu Watanabe; Shuichi Ueno (Discret. Appl. Math., 2005)

A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems. - Koji Goda; Toshinori Yamada; Shuichi Ueno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System. - Kohsuke Ogata; Toshinori Yamada; Shuichi Ueno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

On the two-dimensional orthogonal drawing of series-parallel graphs. - Satoshi Tayu; Kumiko Nomura; Shuichi Ueno (ISCAS, 2006)

On the Fault Testing for Reversible Circuits. - Satoshi Tayu; Shigeru Ito; Shuichi Ueno (ISAAC, 2007)

On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). - Satoshi Tayu; Shuichi Ueno (ISCAS, 2007)

Classification of Landmine-Like Objects Buried under Rough Ground Surfaces Using a Ground Penetrating Radar. - Masahiko Nishimoto; Keiichi Nagayoshi; Shuichi Ueno; Yusuke Kimura (IEICE Trans. Electron., 2007)

On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). - Satoshi Tayu; Kumiko Nomura; Shuichi Ueno (ISCAS, 2008)

Orthogonal Ray Graphs and Nano-PLA Design. - Anish Man Singh Shrestha; Satoshi Tayu; Shuichi Ueno (ISCAS, 2009)

On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. - Satoshi Tayu; Takuya Oshima; Shuichi Ueno (ISCAS, 2009)

Universal Test Sets for Reversible Circuits. - Satoshi Tayu; Shota Fukuyama; Shuichi Ueno (COCOON, 2010)

On two-directional orthogonal ray graphs. - Anish Man Singh Shrestha; Satoshi Tayu; Shuichi Ueno (ISCAS, 2010)

On orthogonal ray graphs. - Anish Man Singh Shrestha; Satoshi Tayu; Shuichi Ueno (Discret. Appl. Math., 2010)

RRA-based multi-objective optimization to mitigate the worst cases of placement. - Yiqiang Sheng; Atsushi Takahashi 001; Shuichi Ueno (ASICON, 2011)

Bandwidth of Convex Bipartite Graphs and Related Graphs. - Anish Man Singh Shrestha; Satoshi Tayu; Shuichi Ueno (COCOON, 2011)

Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement. - Yiqiang Sheng; Atsushi Takahashi 001; Shuichi Ueno (ISVLSI, 2011)

On Two Problems of Nano-PLA Design. - Anish Man Singh Shrestha; Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2011)

On Minimum Feedback Vertex Sets in Graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (ICNC, 2012)

On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2013)

A note on the energy-aware mapping for NoCs. - Satoshi Tayu; Shuichi Ueno (APCCAS, 2014)

Weighted dominating sets and induced matchings in orthogonal ray graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (CoDIT, 2014)

Dominating Sets and Induced Matchings in Orthogonal Ray Graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2014)

On Evasion Games on Graphs. - Satoshi Tayu; Shuichi Ueno (JCDCGG, 2015)

A Note on Harmonious Coloring of Caterpillars. - Asahi Takaoka; Shingo Okuma; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2015)

OBDD Representation of Intersection Graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2015)

Dominating Sets in Two-Directional Orthogonal Ray Graphs. - Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (IEICE Trans. Inf. Syst., 2015)

A Note on Irreversible 2-Conversion Sets in Subcubic Graphs. - Asahi Takaoka; Shuichi Ueno (IEICE Trans. Inf. Syst., 2015)

On orthogonal ray trees. - Irina Mustata; Kousuke Nishikawa; Asahi Takaoka; Satoshi Tayu; Shuichi Ueno (Discret. Appl. Math., 2016)

On the Three-Dimensional Channel Routing. - Satoshi Tayu; Toshihiko Takahashi; Eita Kobayashi; Shuichi Ueno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Stable Matchings in Trees. - Satoshi Tayu; Shuichi Ueno (COCOON, 2017)