| 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-12-22 13:45 |
Miyazaki | Miyazaki Univ. Machinaka Campus | Polynomial-delay algorithms for enumerating maximal induced subgraphs for subclasses of chordal graphs Rei Sato, Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) |
[more] | |
| COMP, IPSJ-AL | 2023-05-11 14:20 |
Hokkaido | Hokkaido University | Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.)  COMP2023-5 |
Given a graph $G = (V, E)$ with a terminal set $W subseteq V$, a vertex subset $S subseteq V$ is an emph{induced Stein... [more] |
COMP2023-5 pp.22-28 |
| COMP | 2022-12-06 09:30 |
Ehime | Ehime Univ. Media Hall | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) COMP2022-21 |
We consider the reconfiguration and enumeration problems of optimal cyclic ladder lotteries. First, we investigate the t... [more] | COMP2022-21 pp.1-8 |
| 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, IPSJ-AL | 2022-09-15 11:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2022-11 |
Given a graph ???? = (????, ????) with a terminal set ???? ⊆ ????, a vertex subset ???? ⊆ ???? is an induced Steiner sub... [more] | COMP2022-11 pp.3-9 |
| 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-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 10:25 |
Hokkaido | Sapporo Campus, Hokkaido University | Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number Kazuhiro Kurita (Hokkaido Univ.), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (Hokkaido Univ.) COMP2019-19 |
(To be available after the conference date) [more] | COMP2019-19 pp.11-18 |
| COMP | 2018-12-12 10:00 |
Miyagi | Tohoku University | Max-Min Dispersion Problems Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII) COMP2018-31 |
[more] | COMP2018-31 pp.1-6 |
| COMP | 2018-09-18 15:20 |
Fukuoka | Kyusyu Institute of Technology | 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 |
| ISEC, COMP | 2017-12-22 14:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43 |
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] | ISEC2017-89 COMP2017-43 pp.111-117 |
[Return to Top Page]