Satoshi TAYU


On the Three-Dimensional Channel Routing
Satoshi TAYU Toshihiko TAKAHASHI Eita KOBAYASHI Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/10/01
Vol. E99-A  No. 10  pp. 1813-1821
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
3-D channelNP-completerouting algorithmSteiner tree
 Summary | Full Text:PDF(1.3MB)

A Note on Harmonious Coloring of Caterpillars
Asahi TAKAOKA Shingo OKUMA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/12/01
Vol. E98-D  No. 12  pp. 2199-2206
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
caterpillarsEulerian trailharmonious coloringharmonious chromatic numberpathwidth
 Summary | Full Text:PDF(414.3KB)

Dominating Sets in Two-Directional Orthogonal Ray Graphs
Asahi TAKAOKA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/08/01
Vol. E98-D  No. 8  pp. 1592-1595
Type of Manuscript:  LETTER
Category: Fundamentals of Information Systems
Keyword: 
Boolean-widthdominating setdynamic programmingtwo-directional orthogonal ray graphs
 Summary | Full Text:PDF(99KB)

OBDD Representation of Intersection Graphs
Asahi TAKAOKA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/04/01
Vol. E98-D  No. 4  pp. 824-834
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
implicit representation of graphsordered binary decision diagramsorthogonal ray graphspermutation graphs
 Summary | Full Text:PDF(426.3KB)

Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
Asahi TAKAOKA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/12/01
Vol. E97-D  No. 12  pp. 3101-3109
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
boolean-widthdominating setinduced matchingorthogonal ray graphsstrong edge coloring
 Summary | Full Text:PDF(338.8KB)

On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
Asahi TAKAOKA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/11/01
Vol. E96-D  No. 11  pp. 2327-2332
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
3-regular graphbipartite permutation graphfeedback vertex setgrid intersection graphnonseparating independent set
 Summary | Full Text:PDF(352.9KB)

On Two Problems of Nano-PLA Design
Anish Man Singh SHRESTHA Asahi TAKAOKA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/01/01
Vol. E94-D  No. 1  pp. 35-41
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
biclique problemnano-crossbarnano-PLAorthogonal ray graphssubraph isomorphism problem
 Summary | Full Text:PDF(985.6KB)

On Fault Testing for Reversible Circuits
Satoshi TAYU Shigeru ITO Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/12/01
Vol. E91-D  No. 12  pp. 2770-2775
Type of Manuscript:  PAPER
Category: Complexity Theory
Keyword: 
3-SATCNOT gatecomplete test setfault testingNP-completereversible circuitstuck-at faulttest vector
 Summary | Full Text:PDF(261.4KB)

On the Orthogonal Drawing of Outerplanar Graphs
Kumiko NOMURA Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/06/01
Vol. E88-A  No. 6  pp. 1583-1588
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
orthogonal drawingbendouterplanar graph
 Summary | Full Text:PDF(213.1KB)

Characterization and Computation of Steiner Routing Based on Elmore's Delay Model
Satoshi TAYU Mineo KANEKO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/12/01
Vol. E85-A  No. 12  pp. 2764-2774
Type of Manuscript:  Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Category: Timing Analysis
Keyword: 
Elmore's delaySteiner treenetbinary treeManhattan distance
 Summary | Full Text:PDF(1.2MB)

Scheduling Trees onto Hypercubes and Grids
Satoshi TAYU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A  No. 5  pp. 1011-1019
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
task schedulingtreehypercubegridcommunication delay
 Summary | Full Text:PDF(451KB)

Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids
Satoshi TAYU Shuichi UENO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/01/25
Vol. E80-A  No. 1  pp. 183-193
Type of Manuscript:  PAPER
Category: Reliability and Fault Analysis
Keyword: 
embeddingbinarytreesproper pathwidthbandwidthgrids
 Summary | Full Text:PDF(712.3KB)