| 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 | 2023-09-07 10:30 |
Osaka | Osaka Metropolitan Univ. (Primary: On-site, Secondary: Online) |
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Yasuko Matsui (Tokai Univ.), Hirotaka Ono (Nagoya Univ.)  COMP2023-10 |
[more] | COMP2023-10 pp.14-21 |
| COMP | 2022-12-06 11:25 |
Ehime | Ehime Univ. Media Hall | Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) COMP2022-25 |
(To be available after the conference date) [more] | COMP2022-25 pp.21-28 |
| COMP | 2022-12-06 15:25 |
Ehime | Ehime Univ. Media Hall | COMP2022-29 |
(To be available after the conference date) [more] | COMP2022-29 pp.40-47 |
| ICTSSL, IN, NWS, IEE-SMF | 2022-10-27 14:55 |
Nagano | Shinshu University (Primary: On-site, Secondary: Online) |
Data Security Verification in Supply Chain Keizo Sugiyama, Yuto Nakano, Yasuaki Kobayashi, Toru Nakamura, Haruki Ota, Takao Kojima, Yutaka Miyake, Shinsaku Kiyomoto (KDDI Research) ICTSSL2022-19 |
Highly sensitive data such as inspection data, design data, program module are often handled in a supply chain. As speci... [more] | ICTSSL2022-19 pp.12-17 |
| COMP | 2022-10-26 14:30 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17 |
In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] | COMP2022-17 pp.21-28 |
| COMP | 2022-03-06 16:30 |
Online | Online | Fixed-parameter tractability of linear extension diameter Tesshu Hanaka (Nagoya Univ), Yasuaki Kobayashi (Kyoto Univ) COMP2021-37 |
[more] | COMP2021-37 pp.31-35 |
| IN, IA (Joint) |
2021-12-16 15:05 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Examination of Real-Time AR Snow Cover Visualization System Considering Shooting Conditions Yasuaki Kobayashi, Tomoya Kawakami (Univ. of Fukui), Satoru Matsumoto, Tomoki Yoshihisa (Osaka Univ.), Yuuichi Teranishi (NICT/Osaka Univ.), Shinji Shimojo (Osaka Univ.) IA2021-33 |
The snow cover image superimposed on the camera image using AR technology changes depending on the image shooting condit... [more] | IA2021-33 pp.24-25 |
| COMP | 2021-12-03 10:30 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Complexity of reconfiguration of regular induced subgraphs Hiroshi Eto, Takehiro Ito (Tohoku Univ), Yasuaki Kobayashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech) COMP2021-22 |
[more] | COMP2021-22 pp.9-10 |
| COMP | 2021-12-03 11:10 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (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 | 2020-12-04 15:50 |
Online | Online | An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion Yuuki Aoike (Yokohama City Univ.), Tatsuya Gima (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Masashi Kiyomi (Yokohama City Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Yota Otachi (Nagoya Univ.) COMP2020-25 |
[more] | COMP2020-25 pp.33-38 |
| ICSS | 2020-11-26 14:00 |
Online | Online | Malware detection for IoT devices using whitelist and Isolation Forest Masataka Nakahara, Norihiro Okui, Yasuaki Kobayashi, Yutaka Miyake (KDDI Research) ICSS2020-20 |
As the number of IoT (Internet of Things) devices increases, the countermeasures against cyberattacks related to IoT dev... [more] | ICSS2020-20 pp.7-12 |
| COMP | 2020-10-23 17:05 |
Osaka | Osaka Univ. (Primary: On-site, Secondary: Online) |
Polynomial Delay Enumeration for Steiner Problems Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) COMP2020-17 |
Let $G = (V, E)$ be a undirected graph and let $W subseteq V$ be a set of terminals. A emph{Steiner subgraph} of $(G, W)... [more] | COMP2020-17 pp.39-46 |
| COMP | 2019-10-25 16:10 |
Hokkaido | Sapporo Campus, Hokkaido University | COMP2019-27 |
[more] | COMP2019-27 pp.63-70 |
| COMP, IPSJ-AL | 2019-05-10 15:40 |
Kumamoto | Kumamoto University | On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. ... [more] |
COMP2019-2 pp.15-22 |
| COMP, IPSJ-AL | 2019-05-11 15:50 |
Kumamoto | Kumamoto University | COMP2019-8 |
The {em dimension} of a partially ordered set (poset) is known to be one of the fundamental complexity measures of poset... [more] | COMP2019-8 pp.91-95 |
| COMP, IPSJ-AL | 2019-05-11 16:40 |
Kumamoto | Kumamoto University | Subgraph Isomorphism on Graph Classes that Exclude a Substructure Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.) COMP2019-9 |
[more] | COMP2019-9 pp.103-104 |
| COMP | 2018-09-18 14:55 |
Fukuoka | Kyusyu Institute of Technology | COMP2018-16 |
Node Kayles is a well-known two-player impartial game on graphs. Given a graph, each player alternately chooses a vertex... [more] | COMP2018-16 pp.49-53 |
[Return to Top Page]