default search action
Shuichi Ueno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c34]Satoshi Tayu, Shuichi Ueno:
Stable Matchings in Trees. COCOON 2017: 492-503 - 2016
- [j33]Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On orthogonal ray trees. Discret. Appl. Math. 201: 201-212 (2016) - [j32]Satoshi Tayu, Toshihiko Takahashi, Eita Kobayashi, Shuichi Ueno:
On the Three-Dimensional Channel Routing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(10): 1813-1821 (2016) - 2015
- [j31]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
OBDD Representation of Intersection Graphs. IEICE Trans. Inf. Syst. 98-D(4): 824-834 (2015) - [j30]Asahi Takaoka, Shuichi Ueno:
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs. IEICE Trans. Inf. Syst. 98-D(8): 1589-1591 (2015) - [j29]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Dominating Sets in Two-Directional Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. 98-D(8): 1592-1595 (2015) - [j28]Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno:
A Note on Harmonious Coloring of Caterpillars. IEICE Trans. Inf. Syst. 98-D(12): 2199-2206 (2015) - [c33]Satoshi Tayu, Shuichi Ueno:
On Evasion Games on Graphs. JCDCGG 2015: 253-264 - 2014
- [j27]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. 97-D(12): 3101-3109 (2014) - [c32]Satoshi Tayu, Shuichi Ueno:
A note on the energy-aware mapping for NoCs. APCCAS 2014: 647-650 - [c31]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Weighted dominating sets and induced matchings in orthogonal ray graphs. CoDIT 2014: 69-73 - 2013
- [j26]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs. IEICE Trans. Inf. Syst. 96-D(11): 2327-2332 (2013) - 2012
- [j25]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Bandwidth of convex bipartite graphs and related graphs. Inf. Process. Lett. 112(11): 411-417 (2012) - [c30]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Minimum Feedback Vertex Sets in Graphs. ICNC 2012: 429-434 - 2011
- [j24]Anish Man Singh Shrestha, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Two Problems of Nano-PLA Design. IEICE Trans. Inf. Syst. 94-D(1): 35-41 (2011) - [c29]Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno:
RRA-based multi-objective optimization to mitigate the worst cases of placement. ASICON 2011: 329-332 - [c28]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Bandwidth of Convex Bipartite Graphs and Related Graphs. COCOON 2011: 307-318 - [c27]Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno:
Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement. ISVLSI 2011: 96-101 - 2010
- [j23]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
On orthogonal ray graphs. Discret. Appl. Math. 158(15): 1650-1659 (2010) - [c26]Satoshi Tayu, Shota Fukuyama, Shuichi Ueno:
Universal Test Sets for Reversible Circuits. COCOON 2010: 348-357 - [c25]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
On two-directional orthogonal ray graphs. ISCAS 2010: 1807-1810
2000 – 2009
- 2009
- [j22]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs. Discret. Appl. Math. 157(8): 1885-1895 (2009) - [c24]Satoshi Tayu, Takuya Oshima, Shuichi Ueno:
On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. ISCAS 2009: 836-839 - [c23]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Orthogonal Ray Graphs and Nano-PLA Design. ISCAS 2009: 2930-2933 - 2008
- [j21]Satoshi Tayu, Shigeru Ito, Shuichi Ueno:
On Fault Testing for Reversible Circuits. IEICE Trans. Inf. Syst. 91-D(12): 2770-2775 (2008) - [j20]Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting. J. Interconnect. Networks 9(1/2): 141-155 (2008) - [c22]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). ISCAS 2008: 212-215 - 2007
- [j19]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. 90-C(2): 327-333 (2007) - [c21]Satoshi Tayu, Shigeru Ito, Shuichi Ueno:
On the Fault Testing for Reversible Circuits. ISAAC 2007: 812-821 - [c20]Satoshi Tayu, Shuichi Ueno:
On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). ISCAS 2007: 3399-3402 - 2006
- [c19]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs. ISCAS 2006 - 2005
- [j18]Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno:
On sequential diagnosis of multiprocessor systems. Discret. Appl. Math. 146(3): 311-342 (2005) - [j17]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. 88-A(4): 1090-1092 (2005) - [j16]Kumiko Nomura, Satoshi Tayu, Shuichi Ueno:
On the Orthogonal Drawing of Outerplanar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(6): 1583-1588 (2005) - [j15]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. 88-A(12): 3661-3662 (2005) - [c18]Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno:
On the three-dimensional channel routing. ISCAS (1) 2005: 180-183 - [c17]Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno:
On VLSI decompositions for d-ary de Bruijn graphs (extended abstract). ISCAS (2) 2005: 1358-1361 - [c16]Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting. SOFSEM 2005: 330-339 - 2004
- [j14]Toshinori Yamada, Kumiko Nomura, Shuichi Ueno:
Sparse networks tolerating random faults. Discret. Appl. Math. 137(2): 223-235 (2004) - [c15]Kumiko Nomura, Satoshi Tayu, Shuichi Ueno:
On the Orthogonal Drawing of Outerplanar Graphs. COCOON 2004: 300-308 - 2003
- [c14]Toshinori Yamada, Kumiko Nomura, Shuichi Ueno:
Optimal adaptive parallel diagnosis for arrays. ISCAS (3) 2003: 854-857 - [c13]Toshinori Yamada, Shuichi Ueno:
Optimal fault-tolerant linear arrays. SPAA 2003: 60-64 - 2002
- [j13]Suguru Amitani, Toshinori Yamada, Shuichi Ueno:
Optimal Layouts of Virtual Paths in Complete Binary Tree Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(4): 914-917 (2002) - [c12]Toshinori Yamada, Nobuaki Fujii, Shuichi Ueno:
On three-dimensional layout of pyramid networks. APCCAS (1) 2002: 159-164 - 2001
- [c11]Kumiko Nomura, Toshinori Yamada, Shuichi Ueno:
On Adaptive Fault Diagnosis for Multiprocessor Systems. ISAAC 2001: 86-98 - [c10]Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno:
On-Line Multicasting in All-Optical Networks. ISAAC 2001: 99-106
1990 – 1999
- 1999
- [j12]Akira Matsubayashi, Shuichi Ueno:
Small congestion embedding of graphs into hypercubes. Networks 33(1): 71-77 (1999) - [c9]Toshinori Yamada, Satoshi Imai, Shuichi Ueno:
On VLSI decompositions for deBruijn graphs. ISCAS (6) 1999: 165-169 - [c8]Toshinori Yamada, Shuichi Ueno:
Sparse Networks Tolerating Random Faults. ISPAN 1999: 114-118 - 1998
- [j11]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) - [j10]Toshinori Yamada, Shuichi Ueno:
Fault-tolerant graphs for tori. Networks 32(3): 181-188 (1998) - 1997
- [c7]Shin-ichiro Tago, Shuichi Ueno:
Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections. ISPAN 1997: 44-48 - [c6]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Hypercubes with Small Degree. ISPAN 1997: 179-185 - [c5]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Meshes with Efficient Layouts. PDPTA 1997: 1623-1632 - 1996
- [c4]Toshinori Yamada, Shuichi Ueno:
Fault-Tolerant Graphs for Tori. ISPAN 1996: 408-414 - 1995
- [j9]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
- [j8]Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani:
Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discret. Math. 127(1-3): 293-304 (1994) - 1993
- [j7]Tadashi Arai, Shuichi Ueno, Yoji Kajitani:
Generalization of aTheorem on the Parametric Maximum Flow Problem. Discret. Appl. Math. 41(1): 69-74 (1993) - 1992
- [c2]Shuichi Ueno, Michihiro Yamazaki:
Graph Spanners and Connectivity. ISAAC 1992: 126-134 - 1991
- [c1]Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani:
Mixed-Searching and Proper-Path-Width. ISA 1991: 61-71
1980 – 1989
- 1988
- [j6]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): 187-194 (1988) - [j5]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): 355-360 (1988) - [j4]Shuichi Ueno, Yoji Kajitani, Hajime Wada:
Minimum augmentation of a tree to a K-edge-connected graph. Networks 18(1): 19-25 (1988) - 1986
- [j3]Yoji Kajitani, Akio Ishizuka, Shuichi Ueno:
Characterization of partial 3-trees in terms of three structures. Graphs Comb. 2(1): 233-246 (1986) - [j2]Yoji Kajitani, Shuichi Ueno:
The minimum augmentation of a directed tree to a k-edge-connected directed graph. Networks 16(2): 181-197 (1986) - 1984
- [j1]Yoji Kajitani, Shuichi Ueno:
A matroid generalization of theorems of Lewin and Gallai. Discret. Appl. Math. 9(2): 213-216 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint