| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| 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 |
| COMP | 2015-03-09 10:10 |
Kyoto | Ritsumeikan University | A Note on Irreversible 2-Conversion Sets in Subcubic Graphs Asahi Takaoka, Shuichi Ueno (Tokyo Tech) COMP2014-43 |
Irreversible $k$-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or ... [more] | COMP2014-43 pp.9-11 |
| 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-06 17:00 |
Iwate | [Invited Talk]
Orthogonal Ray Graphs with Applications to Nanocircuit Design Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-62 MSS2013-41 |
[more] | CAS2013-62 MSS2013-41 p.71 |
|
| 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 |
| CAS, CS, SIP | 2012-03-09 15:10 |
Niigata | The University of Niigata | On the Complexity of Energy-Aware Mapping for NoCs Satoshi Tayu, Anish Man Singh Shrestha, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2011-146 SIP2011-166 CS2011-138 |
To overcome the complex communication problems that arise as the number of on-chip components increases, NoCs have b... [more] |
CAS2011-146 SIP2011-166 CS2011-138 pp.219-224 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2011-11-30 10:30 |
Miyazaki | NewWelCity Miyazaki | An Improved Simulated Annealing for 3D Packing with Sequence Triple and Quintuple Representations Yiqiang Sheng (Tokyo Inst. of Tech.), Atsushi Takahashi (Osaka Univ.), Shuichi Ueno (Tokyo Inst. of Tech.) VLD2011-88 DC2011-64 |
The 3D packing for VLSI physical design is facing big challenges to get better solution quality with less computational ... [more] | VLD2011-88 DC2011-64 pp.209-214 |
| CAS, MSS | 2011-11-17 13:00 |
Yamaguchi | Univ. of Yamaguchi | On Efficient Universal Quantum Circuits Satoshi Tayu, Tomoki Yamada, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2011-64 MSS2011-33 |
The universal quantum circuit has been studied in the literature as a programmable quantum circuit, which can realize ma... [more] | CAS2011-64 MSS2011-33 pp.1-6 |
[Return to Top Page]