| 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-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:55 |
Ehime | Ehime Univ. Media Hall | COMP2022-22 |
組合せ遷移，グラフアルゴリズム，点素パス [more] | COMP2022-22 pp.9-13 |
| 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 |
| IBISML | 2022-03-08 14:25 |
Online | Online | [Invited Talk]
--- Yuichi Yoshida (NII) IBISML2021-36 |
(To be available after the conference date) [more] | IBISML2021-36 p.29 |
| IN, CCS (Joint) |
2020-08-04 14:55 |
Online | Online | Landmark Decision Method Combining Random Walk and Betweenness Centrality Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2020-19 |
Abstract Highly reproducible presentations of important nodes near the node of interest are useful in determin- ing land... [more] | IN2020-19 pp.59-64 |
| NS, IN (Joint) |
2020-03-06 15:10 |
Okinawa | Royal Hotel Okinawa Zanpa-Misaki (Cancelled but technical report was issued) |
Optimal Scheduling of Identity Verification Process on Decentralized Identity Ecosystem Koki Inoue, Dai Suzuki, Toshihiko Kurita, Satoshi Imai (Fujitsu Labs.) IN2019-141 |
Several working groups are coping with an ecosystem where a user manages his/her own digital IDinformation among differe... [more] | IN2019-141 pp.375-380 |
| NS | 2019-10-10 16:10 |
Aichi | Nagoya Institute of Technology | [Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019-113 |
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] | NS2019-113 pp.59-62 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University | 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-12-12 10:25 |
Miyagi | Tohoku University | Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2018-32 |
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] | COMP2018-32 pp.7-14 |
| COMP | 2018-10-26 15:55 |
Kyoto | Kyoto University | [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 |
| MVE | 2018-09-06 16:20 |
Osaka | [Invited Talk]
* Jiro Iwanaga (Retty, Inc.) MVE2018-19 |
(To be available after the conference date) [more] | MVE2018-19 p.37 |
|
| COMP, IPSJ-AL | 2018-05-25 16:20 |
Aichi | Nagoya Institute of Technology | Optimal partition of a tree with social distance Masahiro Okubo (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) COMP2018-3 |
Given a graph $G=(V,E)$, a partition ${C_1,C_2, ldots, C_k}$ of $V$ is called a graph partition. We consider a social we... [more] | COMP2018-3 pp.37-44 |
| ISEC, COMP | 2017-12-21 11:25 |
Kochi | Eikokuji Campus, Kochi University of Technology | O(n^{1/3})-space algorithm for the grid graph reachability problem Ryo Ashida, Kotaro Nakagawa (Tokyo Tech) ISEC2017-75 COMP2017-29 |
The directed graph reachability problem is a canonical complete problem for class NL. The best known polynomial time al... [more] |
ISEC2017-75 COMP2017-29 pp.19-24 |
| 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, IPSJ-AL | 2016-06-24 15:45 |
Ishikawa | Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8 |
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] | COMP2016-8 pp.33-40 |
|
| COMP | 2015-04-23 15:25 |
Miyagi | Computational Complexity of Generalized Makespan Minimization Problem Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo) COMP2015-4 |
We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan mi... [more] | COMP2015-4 pp.21-25 |
|
| CPSY | 2014-11-14 09:50 |
Hiroshima | Hiroshima University | Parallel Breadth-First Search for Middle Scale Graph on GPU-BOX Takuji Mitsuishi (Keio Univ.), Jun Suzuki, Yuki Hayashi, Masaki Kan (NEC), Hideharu Amano (Keio Univ.) CPSY2014-66 |
Breadth First Search(BFS) has been applied in various fields related to big-data processing, and its acceleration with m... [more] | CPSY2014-66 pp.69-74 |
| 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 |
| CPSY, IPSJ-EMB, IPSJ-SLDM, DC [detail] | 2014-03-16 09:25 |
Okinawa | Accelerating Breadth First Search on GPU-BOX Takuji Mitsuishi, Shimpei Nomura, Takaaki Miyajima (Keio Univ.), Jun Suzuki, Yuki Hayashi, Masaki Kan (NEC), Hideharu Amano (Keio Univ.) CPSY2013-108 DC2013-95 |
The graph analysis has been applied in various fields related to big-data processing and actively researched in recent y... [more] | CPSY2013-108 DC2013-95 pp.235-240 |
|
[Return to Top Page]