| 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 # | |
| COMP | 2023-03-02 14:45 |
Tokyo | Ochanomizu University | Correcting the algorithm for a minimum secure dominating set of proper interval graphs Toru Araki, Ryuya Saito (Gunma Univ.)  COMP2022-36 |
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293... [more] | COMP2022-36 pp.16-20 |
| COMP | 2017-08-18 15:55 |
Aomori | Secure Domination in Proper Interval Graphs Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP2017-18 |
A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for eac... [more] | COMP2017-18 pp.41-46 |
|
| COMP | 2006-09-26 10:30 |
Ishikawa | JAIST | Bipancyclicity and edge-bipancyclicity of Cayley graphs generated by transpositions Yuuki Tanaka (Gunma Univ.), Yosuke Kikuchi (Tsuyama National College of Tech.), Toru Araki (Iwate Univ.), Yukio Shibata (Gunma Univ.) |
Cycle is the most fundamental graph class. For a given graph, it is interest to find cycles of various length as subgr... [more] |
COMP2006-25 pp.1-8 |
| COMP | 2005-10-18 14:30 |
Miyagi | Tohoku Univ. | Hamiltonian laceability of bubble-sort graphs with edge faults Toru Araki (Iwate Univ.), Yosuke Kikuchi (JST) |
It is known that the $n$-dimensional bubble-sort graph $B_n$ is bipartite, $(n-1)$-regular, and has $n!$ vertices. We f... [more] |
COMP2005-40 pp.29-35 |
| COMP | 2005-09-15 09:25 |
Osaka | Osaka Univ., Toyonaka Campus | Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs Yosuke Kikuchi (JST), Toru Araki (Iwate Univ.) |
A bipartite graph $G$ is bipancyclic if $G$ has a cycle of length $l$ for every even $4 \leq l \leq |V(G)|$. For a... [more] |
COMP2005-28 pp.1-7 |
[Return to Top Page]