| 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, IPSJ-AL | 2024-09-05 15:30 |
Hiroshima | Hiroshima Institute of Technology (Hiroshima, Online) (Primary: On-site, Secondary: Online) |
Computing Betweenness Centrality in Time-varying Network using Zero-suppressed Binary Decision Diagram Daiki Ando, Yu Nakahata, Shoji Kasahara (NAIST)  COMP2024-10 |
Betweenness Centrality (BC) is a measure of the importance of the vertices in a network. BC has been extensively studied... [more] | COMP2024-10 pp.1-7 |
| COMP | 2022-03-06 16:00 |
Online | Online (Online) | Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming Yu Nakahata (NAIST) COMP2021-36 |
Enumeration of constrained graphs is important for both graph-theoretical study and testcase generation. We propose a me... [more] | COMP2021-36 pp.26-30 |
| COMP | 2021-12-03 11:10 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Ishikawa, Online) (Primary: On-site, Secondary: Online) |
Token Sliding on Directed Graphs Takehiro Ito (Tohoku Univ), Yuni Iwamasa, Yasuaki Kobayashi (Kyoto Univ), Yu Nakahata (NAIST), Masahiro Takahashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-23 |
given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by... [more] | COMP2021-23 pp.11-18 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University (Kumamoto) | Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| COMP | 2018-10-26 15:55 |
Kyoto | Kyoto University (Kyoto) | [Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29 |
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] | COMP2018-29 p.57 |
| COMP | 2018-09-18 15:20 |
Fukuoka | Kyusyu Institute of Technology (Fukuoka) | Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST) COMP2018-17 |
A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) ... [more] | COMP2018-17 pp.55-62 |
[Return to Top Page]