| 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 # | |
| NC, MBE, NLP, MICT (Joint) [detail] |
2024-01-25 17:30 |
Tokushima | Naruto University of Education | Stability analysis of partial amplitude death in delay-coupled oscillator networks with complete k-partite graph Ryuya Kawano (Ibaraki Univ.), Yoshiki Sugitani (Osaka Metropolitan Univ.)  NLP2023-120 MICT2023-75 MBE2023-66 |
In this report, we investigate partial amplitude death in delay-coupled oscillator networks with complete k-partite grap... [more] | NLP2023-120 MICT2023-75 MBE2023-66 pp.170-173 |
| NLP | 2022-11-25 13:50 |
Shiga | (Primary: On-site, Secondary: Online) |
Stability analysis of partial amplitude death in delay-coupled oscillator networks with complete bipartite topologies Ryuya Kawano, Yoshiki Sugitani (Ibaraki Univ) NLP2022-75 |
In this report, we analyze the stability of partial amplitude death in delay-coupled oscillator networks with complete b... [more] | NLP2022-75 pp.82-86 |
| 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 |
| COMP | 2014-10-08 14:45 |
Tokyo | Chuo University | Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29 |
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] | COMP2014-29 pp.19-24 |
| CAS, CS, SIP | 2009-03-03 13:10 |
Gifu | Nagaragawa Convention Center | [Poster Presentation]
A Note on Two Problems of Nano-PLA Design Anish Man Singh Shrestha, Tomoki Yamada, Satoshi Tayu, Shuichi Ueno (Tokyo Inst of Tech) CAS2008-133 SIP2008-196 CS2008-107 |
This paper shows that the subgraph isomorphism problem is NP-hard even for bipartite permutation graphs, while the balan... [more] | CAS2008-133 SIP2008-196 CS2008-107 pp.183-184 |
| COMP | 2008-09-11 09:30 |
Aichi | Nagoya Inst. of Tech. | Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP2008-24 |
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs in an $n$-vertex $m$-edge undirected graph $... [more] |
COMP2008-24 pp.9-16 |
| COMP | 2007-06-29 14:40 |
Hokkaido | Hokkaido University | On the complexity of planar n/k-coloring problems Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25 |
This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a subproblem of the $H$-color... [more] |
COMP2007-25 pp.55-62 |
| COMP | 2004-12-10 16:00 |
Chiba | Toho University | Constructions of Cluttered Orderings for the Complete Bipartite Graph to speed up RAID Tomoko Adachi (Toho Univ.) |
The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks (R... [more] | COMP2004-59 pp.37-44 |
[Return to Top Page]