Shuichi Ueno

Publication Activity (10 Years)

Years Active: 1984-2017
Publications (10 Years): 3

Top Topics

Bipartite Graph

Maximum Cardinality

Top Venues

IEICE Trans. Inf. Syst.

Inf. Process. Lett.

Publications

Satoshi Tayu, Shuichi Ueno
Stable Matchings in Trees. COCOON (2017)
Satoshi Tayu, Toshihiko Takahashi, Eita Kobayashi, Shuichi Ueno
On the Three-Dimensional Channel Routing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2016)
Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
On orthogonal ray trees. Discret. Appl. Math. 201 (2016)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
OBDD Representation of Intersection Graphs. IEICE Trans. Inf. Syst. (4) (2015)
Satoshi Tayu, Shuichi Ueno
On Evasion Games on Graphs. JCDCGG (2015)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
Dominating Sets in Two-Directional Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. (8) (2015)
Asahi Takaoka, Shuichi Ueno
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs. IEICE Trans. Inf. Syst. (8) (2015)
Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno
A Note on Harmonious Coloring of Caterpillars. IEICE Trans. Inf. Syst. (12) (2015)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
Weighted dominating sets and induced matchings in orthogonal ray graphs. CoDIT (2014)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. (12) (2014)
Satoshi Tayu, Shuichi Ueno
A note on the energy-aware mapping for NoCs. APCCAS (2014)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs. IEICE Trans. Inf. Syst. (11) (2013)
Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
Bandwidth of convex bipartite graphs and related graphs. Inf. Process. Lett. 112 (11) (2012)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
On Minimum Feedback Vertex Sets in Graphs. ICNC (2012)
Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
Bandwidth of Convex Bipartite Graphs and Related Graphs. COCOON (2011)
Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno
RRA-based multi-objective optimization to mitigate the worst cases of placement. ASICON (2011)
Anish Man Singh Shrestha, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
On Two Problems of Nano-PLA Design. IEICE Trans. Inf. Syst. (1) (2011)
Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno
Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement. ISVLSI (2011)
Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
On orthogonal ray graphs. Discret. Appl. Math. 158 (15) (2010)
Satoshi Tayu, Shota Fukuyama, Shuichi Ueno
Universal Test Sets for Reversible Circuits. COCOON (2010)
Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
On two-directional orthogonal ray graphs. ISCAS (2010)
Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno
Orthogonal Ray Graphs and Nano-PLA Design. ISCAS (2009)
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno
On the two-dimensional orthogonal drawing of series-parallel graphs. Discret. Appl. Math. 157 (8) (2009)
Satoshi Tayu, Takuya Oshima, Shuichi Ueno
On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. ISCAS (2009)
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
On Fault Testing for Reversible Circuits. IEICE Trans. Inf. Syst. (12) (2008)
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno
Cost-Constrained Minimum-Delay Multicasting. J. Interconnect. Networks 9 (1/2) (2008)
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). ISCAS (2008)
Masahiko Nishimoto, Keiichi Nagayoshi, Shuichi Ueno, Yusuke Kimura
Classification of Landmine-Like Objects Buried under Rough Ground Surfaces Using a Ground Penetrating Radar. IEICE Trans. Electron. (2) (2007)
Satoshi Tayu, Shuichi Ueno
On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). ISCAS (2007)
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
On the Fault Testing for Reversible Circuits. ISAAC (2007)
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno
On the two-dimensional orthogonal drawing of series-parallel graphs. ISCAS (2006)
Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno
On the three-dimensional channel routing. ISCAS (1) (2005)
Koji Goda, Toshinori Yamada, Shuichi Ueno
A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2005)
Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno
On sequential diagnosis of multiprocessor systems. Discret. Appl. Math. 146 (3) (2005)
Kumiko Nomura, Satoshi Tayu, Shuichi Ueno
On the Orthogonal Drawing of Outerplanar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2005)
Kohsuke Ogata, Toshinori Yamada, Shuichi Ueno
A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2005)
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno
Cost-Constrained Minimum-Delay Multicasting. SOFSEM (2005)
Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno
On VLSI decompositions for d-ary de Bruijn graphs (extended abstract). ISCAS (2) (2005)
Kumiko Nomura, Satoshi Tayu, Shuichi Ueno
On the Orthogonal Drawing of Outerplanar Graphs. COCOON (2004)
Toshinori Yamada, Kumiko Nomura, Shuichi Ueno
Sparse networks tolerating random faults. Discret. Appl. Math. 137 (2) (2004)
Toshinori Yamada, Kumiko Nomura, Shuichi Ueno
Optimal adaptive parallel diagnosis for arrays. ISCAS (3) (2003)
Toshinori Yamada, Shuichi Ueno
Optimal fault-tolerant linear arrays. SPAA (2003)
Toshinori Yamada, Nobuaki Fujii, Shuichi Ueno
On three-dimensional layout of pyramid networks. APCCAS (1) (2002)
Suguru Amitani, Toshinori Yamada, Shuichi Ueno
Optimal Layouts of Virtual Paths in Complete Binary Tree Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2002)
Kumiko Nomura, Toshinori Yamada, Shuichi Ueno
On Adaptive Fault Diagnosis for Multiprocessor Systems. ISAAC (2001)
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
On-Line Multicasting in All-Optical Networks. ISAAC (2001)
Toshinori Yamada, Satoshi Imai, Shuichi Ueno
On VLSI decompositions for deBruijn graphs. ISCAS (6) (1999)
Akira Matsubayashi, Shuichi Ueno
Small congestion embedding of graphs into hypercubes. Networks 33 (1) (1999)
Toshinori Yamada, Shuichi Ueno
Sparse Networks Tolerating Random Faults. ISPAN (1999)
Toshinori Yamada, Shuichi Ueno
Fault-tolerant graphs for tori. Networks 32 (3) (1998)
Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
Approximating Steiner trees in graphs with restricted weights. Networks 31 (4) (1998)
Toshinori Yamada, Shuichi Ueno
Fault-Tolerant Meshes with Efficient Layouts. PDPTA (1997)
Toshinori Yamada, Shuichi Ueno
Fault-Tolerant Hypercubes with Small Degree. ISPAN (1997)
Shin-ichiro Tago, Shuichi Ueno
Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections. ISPAN (1997)
Toshinori Yamada, Shuichi Ueno
Fault-Tolerant Graphs for Tori. ISPAN (1996)
Toshinori Yamada, Koji Yamamoto, Shuichi Ueno
Fault-tolerant graphs for hypercubes and tori. HICSS (2) (1995)
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
Mixed Searching and Proper-Path-Width. Theor. Comput. Sci. 137 (2) (1995)
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discret. Math. 127 (1-3) (1994)
Tadashi Arai, Shuichi Ueno, Yoji Kajitani
Generalization of aTheorem on the Parametric Maximum Flow Problem. Discret. Appl. Math. 41 (1) (1993)
Shuichi Ueno, Michihiro Yamazaki
Graph Spanners and Connectivity. ISAAC (1992)
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani
Mixed-Searching and Proper-Path-Width. ISA (1991)
Shuichi Ueno, Yoji Kajitani, Hajime Wada
Minimum augmentation of a tree to a K-edge-connected graph. Networks 18 (1) (1988)
Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano
Ordering of the elements of a matroid such that its consecutive w elements are independent. Discret. Math. 72 (1-3) (1988)
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. Discret. Math. 72 (1-3) (1988)
Yoji Kajitani, Shuichi Ueno
-edge-connected directed graph. Networks 16 (2) (1986)
Yoji Kajitani, Akio Ishizuka, Shuichi Ueno
Characterization of partial 3-trees in terms of three structures. Graphs Comb. 2 (1) (1986)
Yoji Kajitani, Shuichi Ueno
A matroid generalization of theorems of Lewin and Gallai. Discret. Appl. Math. 9 (2) (1984)