Shuichi Ueno

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