IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 36  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
VLD, HWS, ICD 2024-02-28
15:30
Okinawa
(Primary: On-site, Secondary: Online)
A Template Routing Method Using SMT Solver for Double Via-Constrained Pair Symmetric Routing Problem
Zuan Jo, Satoshi Tayu, Atsushi Takahashi (Tokyo Tech), Mathieu Molongo, Makoto Minami, Katsuya Nishioka (JEDAT) VLD2023-102 HWS2023-62 ICD2023-91
 [more] VLD2023-102 HWS2023-62 ICD2023-91
pp.18-23
VLD, HWS, ICD 2024-02-28
15:55
Okinawa
(Primary: On-site, Secondary: Online)
Three-layer Bottleneck Channel Track Assignment for Pins Placed on Opposite Sides
Kazuya Taniguchi, Satoshi Tayu, Atsushi Takahashi (Tokyo Tech), Mathieu Molongo, Makoto Minami, Katsuya Nishioka (Jedat) VLD2023-103 HWS2023-63 ICD2023-92
In this paper, for a three-layer bottleneck channel routing problem in which pins of each net are placed on the upper or... [more] VLD2023-103 HWS2023-63 ICD2023-92
pp.24-29
HWS, VLD 2023-03-03
09:55
Okinawa
(Primary: On-site, Secondary: Online)
Track Assignment considering Routing Crossing Relations to Improve Feasibility in Bottleneck Channel Routing
Kazuya Taniguchi, Satoshi Tayu, Atsushi Takahashi (Tokyo Tech), Molongo Mathieu, Makoto Minami, Katsuya Nishioka (Jedat) VLD2022-101 HWS2022-72
Design automation that realizes analog integrated circuits to meet performance specifications in a small area is desired... [more] VLD2022-101 HWS2022-72
pp.149-154
HWS, VLD 2023-03-03
10:20
Okinawa
(Primary: On-site, Secondary: Online)
Pair Symmetrical Routing in Common Centroid Placement with Common Signal Constraints
Zuan Jo, Satoshi Tayu, Atsushi Takahashi (Tokyo Tech), Molongo Mathieu, Makoto Minami, Katsuya Nishioka (JEDAT) VLD2022-102 HWS2022-73
In analog integrated circuits, designs usually rely on the relative accuracy of device characteristics. The purpose of t... [more] VLD2022-102 HWS2022-73
pp.155-160
VLD, HWS [detail] 2022-03-07
09:35
Online Online Bottleneck Channel Routing to Reduce the Area of Analog VLSI
Kazuya Taniguchi, Satoshi Tayu, Atsushi Takahashi (Tokyo Tech), Yukichi Todoroki, Makoto Minami (Jedat) VLD2021-77 HWS2021-54
Design automation that realizes analog integrated circuits to meet performance specifications in a small area is desired... [more] VLD2021-77 HWS2021-54
pp.7-12
CAS, MSS, IPSJ-AL [detail] 2017-11-16
11:20
Tokyo   [Invited Talk] On the Recognition of Unit Grid Intersection Graphs
Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2017-44 MSS2017-28
We show that the recognition problem for unit grid intersection graphs is NP-complete. [more] CAS2017-44 MSS2017-28
pp.15-20
MSS, CAS, IPSJ-AL [detail] 2016-11-25
09:25
Hyogo Kobe Institute of Computing A Note on the Spanning Subgraph Isomorphism Problem
Satoshi Tayu, Kenji Ichikawa, Shuichi Ueno (Tokyo Tech) CAS2016-69 MSS2016-49
We consider the subgraph isomorphism problem of two graphs which is to decide if a pattern graph is isomorphic to a subg... [more] CAS2016-69 MSS2016-49
pp.83-88
MSS, CAS, IPSJ-AL [detail] 2016-11-25
09:50
Hyogo Kobe Institute of Computing On the Complexity of Finding a Largest Common Subtree of Trees
Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-70 MSS2016-50
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] CAS2016-70 MSS2016-50
pp.89-92
MSS, CAS, IPSJ-AL [detail] 2016-11-25
10:15
Hyogo Kobe Institute of Computing A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs
Yuta Inaba, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-71 MSS2016-51
(To be available after the conference date) [more] CAS2016-71 MSS2016-51
pp.93-96
MSS, CAS, IPSJ-AL [detail] 2015-11-20
16:20
Kagoshima Ibusuki CityHall On Evasion Games on Graphs
Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2015-52 MSS2015-26
We consider an evasion game on a connected simple graph. We first show that the pursuit number of a graph G, the smalles... [more] CAS2015-52 MSS2015-26
pp.59-64
MSS, CAS, SIP, VLD 2015-06-17
13:20
Hokkaido Otaru University of Commerce On the Complexity of Mining Maximal Frequent Subgraphs
Satoshi Tayu, Shuni Go, Shuichi Ueno (Tokyo Tech) CAS2015-7 VLD2015-14 SIP2015-38 MSS2015-7
 [more] CAS2015-7 VLD2015-14 SIP2015-38 MSS2015-7
pp.37-42
CAS, MSS, IPSJ-AL [detail] 2014-11-20
15:00
Okinawa Nobumoto Ohama Memorial Hall (Ishigaki island) Harmonious Coloring of Caterpillars
Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-93 MSS2014-57
The harmonious coloring of a simple graph is a vertex coloring such that adjacent vertices are assigned different colors... [more] CAS2014-93 MSS2014-57
pp.57-62
CAS, MSS, IPSJ-AL [detail] 2014-11-20
15:20
Okinawa Nobumoto Ohama Memorial Hall (Ishigaki island) On the Bipartite Dense Subgraph Problem
Satoshi Tayu, Asahi Takaoka, Dai Ito, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-94 MSS2014-58
 [more] CAS2014-94 MSS2014-58
pp.63-68
CAS, SIP, MSS, VLD, SIS [detail] 2014-07-09
13:40
Hokkaido Hokkaido University Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10
pp.45-48
CAS, SIP, MSS, VLD, SIS [detail] 2014-07-09
14:00
Hokkaido Hokkaido University A Note on the 3-D IC TSV Assignment Problem
Satoshi Tayu, Toshiyuki Hongo, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-11 VLD2014-20 SIP2014-32 MSS2014-11 SIS2014-11
 [more] CAS2014-11 VLD2014-20 SIP2014-32 MSS2014-11 SIS2014-11
pp.49-54
MSS, CAS, IPSJ-AL [detail] 2013-11-07
09:55
Iwate   A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] CAS2013-65 MSS2013-44
pp.99-104
SIP, CAS, MSS, VLD 2013-07-12
15:00
Kumamoto Kumamoto Univ. On Unit Grid Intersection Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31
This paper shows that the recognition problem for unit grid intersection graphs is NP-complete. We also show that any gr... [more] CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31
pp.171-175
CAS 2013-01-28
13:30
Oita Beppu International Convention Center On Orthogonal Ray Trees
Kousuke Nishikawa, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2012-72
This paper shows several characterizations of orthogonal ray trees, which imply a linear time recognition algorithm. [more] CAS2012-72
pp.35-40
MSS, CAS 2012-11-01
13:55
Iwate Iwate University A Note on the Energy-Aware Mapping for NoCs
Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2012-51 MSS2012-31
 [more] CAS2012-51 MSS2012-31
pp.5-10
VLD, CAS, MSS, SIP 2012-07-03
09:50
Kyoto Kyoto Research Park On Minimum Feedback Vertex Sets in Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16
For the minimum feedback vertex set problem, we show a linear time algorithm for bipartite permutation graphs, the NP-ha... [more] CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16
pp.87-92
 Results 1 - 20 of 36  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan