Updated on 2025/02/28

写真a

 
TAYU SATOSHI
 
Organization
School of Engineering Assistant Professor
Title
Assistant Professor
External link

Degree

  • Doctor of Engineering ( Tokyo Institute of Technology )

Research Interests

  • Combinatorial Optimization

  • Parallel Computation

  • 組合せ最適化

  • 並列計算

Research Areas

  • Informatics / Theory of informatics

Education

  • Tokyo Institute of Technology   Science of Engineering

    - 1997

      More details

    Country: Japan

    researchmap

  • Tokyo Institute of Technology   Graduate School, Division of Science and Engineering

    - 1997

      More details

  • Tokyo Institute of Technology   School of Engineering

    - 1992

      More details

    Country: Japan

    researchmap

Research History

  • -:Tokyo Institute of Technology Graduate School of Science and Engineering Research Associate

    2003

      More details

  • -:東京工業大学 大学院理工学研究科

    2003

      More details

  • :北陸先端科学技術大学院大学 情報科学研究科 助手

    1997 - 2003

      More details

  • :Japan Advanced Institute of Science and Technology School of Information Science Research Associate

    1997 - 2003

      More details

Professional Memberships

Committee Memberships

  • 情報処理学会   アルゴリズム研究会運営委員  

    2004   

      More details

    Committee type:Academic society

    情報処理学会

    researchmap

  • 電子情報通信学会   電子情報通信学会 査読委員  

    2001   

      More details

    Committee type:Academic society

    電子情報通信学会

    researchmap

MISC

  • On the two-dimensional orthogonal drawing of series-parallel graphs

    Satoshi Tayu, Kumiko Nomura, Shuichi Ueno

    Discrete Applied Mathematics   157 ( 8 )   1885 - 1895   2009.4

     More details

    Language:English  

    It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing, with the only exception being the octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception being K4, and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing. © 2009 Elsevier B.V. All rights reserved.

    DOI: 10.1016/j.dam.2008.12.010

    Scopus

    researchmap

  • On the two-dimensional orthogonal drawing of series-parallel graphs

    Satoshi Tayu, Kumiko Nomura, Shuichi Ueno

    DISCRETE APPLIED MATHEMATICS   157 ( 8 )   1885 - 1895   2009.4

     More details

    Language:English   Publisher:ELSEVIER SCIENCE BV  

    It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing, with the only exception being the octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception being K(4), and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing. (C) 2009 Elsevier B.V. All rights reserved.

    DOI: 10.1016/j.dam.2008.12.010

    Web of Science

    researchmap

  • On Fault Testing for Reversible Circuits

    Satoshi Tayu, Shigeru Ito, Shuichi Ueno

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E91D ( 12 )   2770 - 2775   2008.12

     More details

    Language:English   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    It has been known that testing of reversible circuits is relatively easier than conventional irreversible circuits in the sense that few test vectors are needed to cover all stuck-at faults. This paper shows, however. that it is NP-hard to generate a minimum complete test set for stuck-at faults oil the wires of a reversible circuit using a polynomial time reduction from 3SAT to the problem. We also show non-trivial lower hounds for the size of a minimum complete test set.

    DOI: 10.1093/ietisy/e91-d.12.2770

    Web of Science

    researchmap

  • Cost-Constrained Minimum-Delay Multicasting

    Satoshi Tayu, Truki Al-Mutairi, Shuichi UENO

    Journal of Interconnection Networks   9 ( 1&2 )   141 - 155   2008

     More details

  • On Fault Testing for Reversible Circuits

    田湯 智, 伊東 滋, 上野修一

    電子情報通信学会英語論文誌D   E91-D ( 12 )   2770 - 2775   2008

  • Cost-Constrained Minimum-Delay Multicasting

    Satoshi Tayu, Truki Al-Mutairi, Shuichi UENO

    Journal of Interconnection Networks   9 ( 1&2 )   141 - 155   2008

     More details

  • On the orthogonal drawing of outerplanar graphs

    K Nomura, S Tayut, S Ueno

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E88A ( 6 )   1583 - 1588   2005.6

     More details

    Language:English   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.

    DOI: 10.1093/ietfec/e88-a.6.1583

    Web of Science

    researchmap

  • On the Orthogonal Drawing of Outerplanar Graphs

    Kumiko Nomura, Satoshi Tayu, Shuichi Ueno

    IEICE Trans. Fundamentals   E88-A ( 6 )   1583 - 1588   2005

  • Charactorization and Computation of Steiner Wiring Based on Elmore's Delay Model

    Satoshi TAYU, Mineo KANEKO

    IEICE Trans. Fundamentals   E85-A ( 12 )   2764 - 2774   2002

     More details

  • Scheduling Trees onto Hypercubes and Grids

    Satoshi Tayu

    IEICE Trans. Fundamentals   E85-A ( 5 )   1011 - 1019   2002

     More details

  • Charactorization and Computation of Steiner Wiring Based on Elmore's Delay Model

    Satoshi TAYU, Mineo KANEKO

    IEICE Trans. Fundamentals   E85-A ( 12 )   2764 - 2774   2002

     More details

  • Scheduling Trees onto Hypercubes and Grids

    Satoshi Tayu

    IEICE Trans. Fundamentals   E85-A ( 5 )   1011 - 1019   2002

     More details

  • Embedding Binary Trees into Hypercubes

    IEICE Trans. Fundamentals   E81-A ( 4 )   682 - 695   1998

     More details

  • 2分木のハイパーキューブへの埋め込み

    田湯智, 上野修一

    電子情報通信学会和文論文誌A   E81-A ( 4 )   682 - 695   1998

     More details

  • Efficient Embedding of Binary Trees with Bounded Pathwidth into Paths and Grid

    Satoshi TAYU, Shuichi UENO

    IEICE Trans. Fundamentals   E80-A ( 1 )   1997

     More details

  • Efficient Embedding of Binary Trees with Bounded Pathwidth into Paths and Grid

    Satoshi TAYU, Shuichi UENO

    IEICE Trans. Fundamentals   E80-A ( 1 )   1997

     More details

▼display all

Presentations

  • Lower Bounds for the Height of Three-Dimensional Channel Routing

    2008 IEICE General Conference  2008 

     More details

  • On Orthogonal Ray Graphs

    The First AAAC(Asian Association for Algorithms and Computation) Annual Meeting  2008 

     More details

  • On the Three-Dimensional Orthogoanl Drawing of Seiries-Parallel Graphs

    IEEE International Symposium on Circuits and Systems  2008 

     More details

  • An Efficient Quantum Addition Circuit

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • The Complexity of Three-Dimensional Channel Routing

    The 5th Hungarian-Japanese Symposium on Discrete Mathematicas and Its Applications  2007 

     More details

  • On Orthogonal Ray Graphs

    Technical Report of the IPSJ  2008 

     More details

  • On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs

    Technical Report of the IPSJ  2008 

     More details

  • Orthogonal Ray Graphs and Nano-PLA Design

    Technical Report of the IEICE  2008 

     More details

  • On the Three-Dimensional Single-Active-Layer Routing

    Technical Report of the IEICE  2008 

     More details

  • On the Permutation Routing in All-Optical Caterpillar Networks

    Technical Committee on Circuits and Systems, IEICE  2007 

     More details

  • On the Fault Testing for Reversible Circuits

    International Computing and Combinatorics Conference  2007 

     More details

  • The Complexity of Three-Dimensional Channel Routing

    The 5th Hungarian-Japanese Symposium on Discrete Mathematicas and Its Applications  2007 

     More details

  • On the Complexity of Three-Dimensional Channel Routing

    IEEE International Symposium on Circuits and Systems  2007 

     More details

  • On the Complexity of Three-Dimensional Channel Routing

    IEEE International Symposium on Circuits and Systems  2007 

     More details

  • On the Fault Testing for Reversible Circuits

    情報処理学会アルゴリズム研究会  2007 

     More details

  • On Orthogonal Ray Graphs with Applications to NanoPLA Design

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • An Efficient Quantum Addition Circuit

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On Orthogonal Ray Graphs with Applications to NanoPLA Design

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Lower Bounds for the Height of Three-Dimensional Channel Routing

    2008 IEICE General Conference  2008 

     More details

  • On Orthogonal Ray Graphs

    The First AAAC(Asian Association for Algorithms and Computation) Annual Meeting  2008 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    Japan Conference on Comutational Geometry and Graphs  2009 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    IPSJ SIGAL  2009 

     More details

  • Universal Test Sets for Reversible Circuits

    2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On the Three-Dimensional Orthogoanl Drawing of Outerplanar Graphs (Extended Abstract)

    IEEE International Symposium on Circuits and Systems  2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Orthogonal Ray Graphs and Nano-PLA Design

    IEEE International Symposium on Circuits and Systems  2009 

     More details

  • Universal Test Sets for Reversible Circuits

    2009 IEICE Society Conference  2009 

     More details

  • Characterizations of Two-Directional Orthogonal Ray Graphs

    2009 IEICE Society Conference  2009 

     More details

  • Universal Reversible Circuits

    2009 IEICE General Conference  2009 

     More details

  • Fault Testing for Linear Reversible Circuits

    2009 IEICE General Conference  2009 

     More details

  • Universal Test Sets for Reversible Circuits

    International Computing and Combinatorics Conference  2010 

     More details

  • A Note on Two Problems of Nano-PLA Design

    Technical Committee on Circuits and Systems, IEICE  2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On the Three-Dimensional Single-Active-Layer Routing with Dual Channels

    2010 IEICE General Conference  2010 

     More details

  • A Necessary Condition for Orthogonal Ray Graphs

    2010 IEICE General Conference  2010 

     More details

  • A Note on a Problem of Nano-PLA Design

    2010 IEICE General Conference  2010 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    IEEE International Symposium on Circuits and Systems  2010 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    IEEE International Symposium on Circuits and Systems  2010 

     More details

  • Universal Test Sets for Reversible Circuits

    International Computing and Combinatorics Conference  2010 

     More details

  • A Note on Fault Testing for Reversible Circuits

    2010 IEICE General Conference  2010 

     More details

  • On the Three-Dimensional Orthogonal Face Routing

    2010 IEICE General Conference  2010 

     More details

  • A Note on Two Problems of Nano-PLA Design

    Technical Committee on Circuits and Systems, IEICE  2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Characterizations of Two-Directional Orthogonal Ray Graphs

    2009 IEICE Society Conference  2009 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    Japan Conference on Comutational Geometry and Graphs  2009 

     More details

  • On Two-Directional Orthogonal Ray Graphs

    IPSJ SIGAL  2009 

     More details

  • Universal Test Sets for Reversible Circuits

    2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Fault Testing for Linear Reversible Circuits

    2009 IEICE General Conference  2009 

     More details

  • On the Three-Dimensional Orthogoanl Drawing of Outerplanar Graphs (Extended Abstract)

    IEEE International Symposium on Circuits and Systems  2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Orthogonal Ray Graphs and Nano-PLA Design

    IEEE International Symposium on Circuits and Systems  2009 

     More details

  • Universal Test Sets for Reversible Circuits

    2009 IEICE Society Conference  2009 

     More details

  • Universal Reversible Circuits

    2009 IEICE General Conference  2009 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    2004 IEICE Society Conference  2004 

     More details

  • On the Orthogonal Drawing of Series-Parallel Graphs

    情報処理学会 アルゴリズム研究会  2004 

     More details

  • On the Three-Dimensional Channel Routing

    情報処理学会 アルゴリズム研究会  2004 

     More details

  • On the Three-Dimensional Single-Active-Layer Routing with Dual Channels

    2010 IEICE General Conference  2010 

     More details

  • A Necessary Condition for Orthogonal Ray Graphs

    2010 IEICE General Conference  2010 

     More details

  • A Note on a Problem of Nano-PLA Design

    2010 IEICE General Conference  2010 

     More details

  • A Note on Fault Testing for Reversible Circuits

    2010 IEICE General Conference  2010 

     More details

  • On the Three-Dimensional Orthogonal Face Routing

    2010 IEICE General Conference  2010 

     More details

  • On the Three-Dimensional Channel Routing

    IEEE International Symposium on Circuits and Systems  2005 

     More details

  • On the Complexity of Fault Testing for Reversible Circuits

    2005 IEICE Society Conference  2005 

     More details

  • A Note on the Three-Dimensional Channel Routing

    the 2005 IEICE General Conference  2005 

     More details

  • On the Three-Dimensional Channel Routing

    IEEE International Symposium on Circuits and Systems  2005 

     More details

  • On the Complexity of Fault Testing for Reversible Circuits

    2005 IEICE Society Conference  2005 

     More details

  • On the Three-Dimensional Layout of Butterfly Networks

    2005 IEICE Society Conference  2005 

     More details

  • On the Complexity of Fault Testing for Reversible Circuits

    電子情報通信学会 回路とシステム研究会  2005 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    電子情報通信学会 回路とシステム研究会  2005 

     More details

  • Cost-Constrained Minimum-Delay Multicasting

    International Conference on Current Trends in Theory and Practice of Informatics  2005 

     More details

  • A Note on Sparse Networks Tolerating Random Faults for Cycles

    the 2005 IEICE General Conference  2005 

     More details

  • On the Three-Dimensional Layout of Butterfly Networks

    2005 IEICE Society Conference  2005 

     More details

  • On the Complexity of Fault Testing for Reversible Circuits

    電子情報通信学会 回路とシステム研究会  2005 

     More details

  • On the Three-Dimensional Channel Routing

    情報処理学会 アルゴリズム研究会  2004 

     More details

  • Cost-Constrained Minimum-Delay Multicasting

    電子情報通信学会VLD, DSP, CAS 合同研究会  2004 

     More details

  • On the Orthogonal Drawing of Outerplanar Graphs

    International Computing and Combinatorics Conference  2004 

     More details

  • On the Three-Dimensional Channel Routing

    2004 IEICE Society Conference  2004 

     More details

  • On the Orthogonal Drawing of Outerplanar Graphs

    International Computing and Combinatorics Conference  2004 

     More details

  • On the Three-Dimensional Channel Routing

    2004 IEICE Society Conference  2004 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    2004 IEICE Society Conference  2004 

     More details

  • On the Orthogonal Drawing of Series-Parallel Graphs

    情報処理学会 アルゴリズム研究会  2004 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    電子情報通信学会 回路とシステム研究会  2005 

     More details

  • Cost-Constrained Minimum-Delay Multicasting

    電子情報通信学会VLD, DSP, CAS 合同研究会  2004 

     More details

  • On the Fault Testing for Reversible Circuits

    情報処理学会アルゴリズム研究会  2007 

     More details

  • On the Permutation Routing in All-Optical Caterpillar Networks

    Technical Committee on Circuits and Systems, IEICE  2007 

     More details

  • On the Fault Testing for Reversible Circuits

    International Computing and Combinatorics Conference  2007 

     More details

  • On the Three-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    電子情報通信学会 回路とシステム研究会  2006 

     More details

  • On the Three-Dimensional Layout of Hypercubes

    2006 IEICE Society Conference  2006 

     More details

  • Three-Dimensional Channel Routeing is in NP

    2006 IEICE Society Conference  2006 

     More details

  • The Complexity of Fault Testing for Reversible Circuits

    2006 IEICE Society Conference  2006 

     More details

  • The Complexity of Three-Dimensional Channel Routeing

    回路とシステム研究会  2006 

     More details

  • On the Complexity of Three-Dimensional Channel Routing

    情報処理学会弟68回全国大会  2006 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    IEEE International Symposium on Circuits and Systems  2006 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On the Complexity of Fault Testing for Reversible Circuits

    Technical Report of IPSJ  2006 

     More details

  • On the Three-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    電子情報通信学会 回路とシステム研究会  2006 

     More details

  • On the Complexity of Three-Dimensional Channel Routing

    情報処理学会弟68回全国大会  2006 

     More details

  • On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs

    IEEE International Symposium on Circuits and Systems  2006 

     More details

    Presentation type:Poster presentation  

    researchmap

  • The Complexity of Three-Dimensional Channel Routeing

    回路とシステム研究会  2006 

     More details

  • Cost-Constrained Minimum-Delay Multicasting

    International Conference on Current Trends in Theory and Practice of Informatics  2005 

     More details

  • A Note on Sparse Networks Tolerating Random Faults for Cycles

    the 2005 IEICE General Conference  2005 

     More details

  • A Note on the Three-Dimensional Channel Routing

    the 2005 IEICE General Conference  2005 

     More details

  • On the Complexity of Fault Testing for Reversible Circuits

    Technical Report of IPSJ  2006 

     More details

  • On the Three-Dimensional Layout of Hypercubes

    2006 IEICE Society Conference  2006 

     More details

  • Three-Dimensional Channel Routeing is in NP

    2006 IEICE Society Conference  2006 

     More details

  • The Complexity of Fault Testing for Reversible Circuits

    2006 IEICE Society Conference  2006 

     More details

  • On the Three-Dimensional Single-Active-Layer Routing

    Technical Report of the IEICE  2008 

     More details

  • On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • On the Three-Dimensional Orthogoanl Drawing of Seiries-Parallel Graphs

    IEEE International Symposium on Circuits and Systems  2008 

     More details

  • On Orthogonal Ray Graphs

    Technical Report of the IPSJ  2008 

     More details

  • On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs

    Technical Report of the IPSJ  2008 

     More details

  • Orthogonal Ray Graphs and Nano-PLA Design

    Technical Report of the IEICE  2008 

     More details

▼display all

Research Projects

  • Efficient Solution space searchnig

      More details

    Grant type:Competitive

    researchmap

  • グラフ描画

      More details

    Grant type:Competitive

    researchmap

  • 効率的解空間探索

      More details

    Grant type:Competitive

    researchmap

  • Graph Drawing

      More details

    Grant type:Competitive

    researchmap