default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Tayu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Kazuya Taniguchi, Satoshi Tayu, Atsushi Takahashi, Mathieu Molongo, Makoto Minami, Katsuya Nishioka:
Two-layer Bottleneck Channel Track Assignment for Analog VLSI. IPSJ Trans. Syst. LSI Des. Methodol. 17: 67-76 (2024)
2010 – 2019
- 2017
- [c24]Satoshi Tayu, Shuichi Ueno:
Stable Matchings in Trees. COCOON 2017: 492-503 - 2016
- [j16]Irina Mustata, Kousuke Nishikawa, Asahi Takaoka
, Satoshi Tayu, Shuichi Ueno:
On orthogonal ray trees. Discret. Appl. Math. 201: 201-212 (2016) - [j15]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
- [j14]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
OBDD Representation of Intersection Graphs. IEICE Trans. Inf. Syst. 98-D(4): 824-834 (2015) - [j13]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Dominating Sets in Two-Directional Orthogonal Ray Graphs. IEICE Trans. Inf. Syst. 98-D(8): 1592-1595 (2015) - [j12]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) - [c23]Satoshi Tayu, Shuichi Ueno:
On Evasion Games on Graphs. JCDCGG 2015: 253-264 - 2014
- [j11]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) - [c22]Satoshi Tayu, Shuichi Ueno:
A note on the energy-aware mapping for NoCs. APCCAS 2014: 647-650 - [c21]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
Weighted dominating sets and induced matchings in orthogonal ray graphs. CoDIT 2014: 69-73 - 2013
- [j10]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
- [j9]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Bandwidth of convex bipartite graphs and related graphs. Inf. Process. Lett. 112(11): 411-417 (2012) - [c20]Asahi Takaoka, Satoshi Tayu, Shuichi Ueno:
On Minimum Feedback Vertex Sets in Graphs. ICNC 2012: 429-434 - 2011
- [j8]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) - [c19]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Bandwidth of Convex Bipartite Graphs and Related Graphs. COCOON 2011: 307-318 - 2010
- [j7]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
On orthogonal ray graphs. Discret. Appl. Math. 158(15): 1650-1659 (2010) - [c18]Satoshi Tayu, Shota Fukuyama, Shuichi Ueno:
Universal Test Sets for Reversible Circuits. COCOON 2010: 348-357 - [c17]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
On two-directional orthogonal ray graphs. ISCAS 2010: 1807-1810
2000 – 2009
- 2009
- [j6]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs. Discret. Appl. Math. 157(8): 1885-1895 (2009) - [c16]Satoshi Tayu, Takuya Oshima, Shuichi Ueno:
On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. ISCAS 2009: 836-839 - [c15]Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
Orthogonal Ray Graphs and Nano-PLA Design. ISCAS 2009: 2930-2933 - 2008
- [j5]Satoshi Tayu, Shigeru Ito, Shuichi Ueno:
On Fault Testing for Reversible Circuits. IEICE Trans. Inf. Syst. 91-D(12): 2770-2775 (2008) - [j4]Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting. J. Interconnect. Networks 9(1/2): 141-155 (2008) - [c14]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). ISCAS 2008: 212-215 - 2007
- [c13]Satoshi Tayu, Shigeru Ito, Shuichi Ueno:
On the Fault Testing for Reversible Circuits. ISAAC 2007: 812-821 - [c12]Satoshi Tayu, Shuichi Ueno:
On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). ISCAS 2007: 3399-3402 - 2006
- [c11]Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs. ISCAS 2006 - 2005
- [j3]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) - [c10]Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno:
On the three-dimensional channel routing. ISCAS (1) 2005: 180-183 - [c9]Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno:
Cost-Constrained Minimum-Delay Multicasting. SOFSEM 2005: 330-339 - 2004
- [c8]Kumiko Nomura, Satoshi Tayu, Shuichi Ueno:
On the Orthogonal Drawing of Outerplanar Graphs. COCOON 2004: 300-308 - 2003
- [c7]Satoshi Tayu:
A simulated annealing approach with sequence-pair encoding using a penalty function for the placement problem with boundary constraints. ASP-DAC 2003: 319-324 - 2002
- [j2]Satoshi Tayu:
Scheduling Trees onto Hypercubes and Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 1011-1019 (2002) - [j1]Satoshi Tayu, Mineo Kaneko:
Characterization and Computation of Steiner Routing Based on Elmore's Delay Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(12): 2764-2774 (2002) - [c6]Satoshi Tayu, Mineo Kaneko:
Characterization and computation of Steiner wiring based on Elmore's delay model. APCCAS (2) 2002: 335-340 - [c5]Mineo Kaneko, Jun'ichi Yokoyama, Satoshi Tayu:
3D scheduling based on code space exploration for dynamically reconfigurable systems. ISCAS (5) 2002: 465-468 - 2000
- [c4]Koji Ohashi, Mineo Kaneko, Satoshi Tayu:
Assignment-Space Exploration Approach to Concurrent Data-Path/Floorplan Synthesis. ICCD 2000: 370-375 - [c3]Mineo Kaneko, Yoshitaka Nishio, Satoshi Tayu:
Exact and heuristic methods of assignment driven scheduling for data-path synthesis applications. ISCAS 2000: 57-60 - [c2]Satoshi Tayu, Motoyasu Katsura, Mineo Kaneko:
An Approximation Algorithm for Multiprocessor Scheduling of Trees with Communication Delays. ISPAN 2000: 114-120
1990 – 1999
- 1999
- [c1]Satoshi Tayu:
Scheduling Trees onto Hypercubes and Grids Is NP-complete. COCOON 1999: 251-260
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 2025-01-09 13:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
