| 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 # | |
| ISEC | 2023-05-17 14:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | BDD enumeration for Module-LWE using lattice rotation structure Togo Sakurai, Atsushi Takayasu (The Univ. of Tokyo)  ISEC2023-10 |
Module-LWE is the analog of LWE that includes algebraic structures. In July 2022, two cryptographic schemes based on Mod... [more] | ISEC2023-10 pp.54-61 |
| 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:00 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Enumeration of Transversal Edge-Partitions Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.) COMP2022-16 |
In this paper, we consider the problem of enumerating transversal edge-partition of an irreducible triangulation. We pro... [more] | COMP2022-16 pp.14-20 |
| 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, IPSJ-AL | 2021-05-08 13:30 |
Online | Online | [Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.) COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] | COMP2021-8 p.54 |
| COMP | 2020-12-04 10:40 |
Online | Online | Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20 |
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] | COMP2020-20 pp.16-23 |
| 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, IPSJ-AL | 2020-05-09 15:10 |
Online | Online | Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES Etsuji Tomita (Univ. Electro-Comm.), Alessio Conte (Univ. of Pisa) COMP2020-1 |
We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. It is... [more] |
COMP2020-1 pp.1-8 |
| 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-03-18 09:30 |
Tokyo | The University of Tokyo | Range Mode Query and Solution Enumeration Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo) COMP2018-43 |
The range mode query problem is constructing a data structure from the given array of $n$ terms which can efficiently an... [more] | COMP2018-43 pp.1-8 |
| 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 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2018-06-13 16:15 |
Okinawa | Okinawa Institute of Science and Technology | Enumeration of Distinct Support Vectors for Model Selection Kentaro Kanamori (Hokaido Univ.), Satoshi Hara (Osaka Univ.), Masakazu Ishihata (NTT), Hiroki Arimura (Hokaido Univ.) IBISML2018-12 |
In ordinary machine learning problems, the learning algorithm outputs a single model that optimizes its learning objecti... [more] | IBISML2018-12 pp.81-88 |
| 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 |
| 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 |
|
| MSS | 2016-03-04 11:00 |
Yamaguchi | KAIKYO MESSE SHIMONOSEKI | CAME: A Novel Fast Connectivity-Aware MER Enumeration Algorithm for the Online Task Placement on Partially Reconfigurable Device Tieyuan Pan, Lian Zeng (Waseda Univ.), Yasuhiro Takashima (Univ. of Kitakyushu), Takahiro Watanabe (Waseda Univ.) MSS2015-82 |
In this paper, we propose a novel fast connectivity-aware Maximal Empty Rectangle(MER) enumeration algorithm for the onl... [more] | MSS2015-82 pp.79-84 |
| COMP | 2015-04-23 14:10 |
Miyagi | Frontier Method for Enumerating and Indexing the Vertex Induced Subgraphs Hirofumi Suzuki, Shin-ichi Minato (Hokkaido Univ.) COMP2015-3 |
(To be available after the conference date) [more] | COMP2015-3 pp.15-20 |
|
| COMP | 2014-10-08 15:15 |
Tokyo | Chuo University | Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.) COMP2014-30 |
An Eulerian trail is a trail containing all edges of a given graph exactly once. Although counting problem of Eulerian ... [more] |
COMP2014-30 pp.25-29 |
| IN, NV (Joint) |
2012-07-19 16:25 |
Hokkaido | Hokkaido Univ. | [Invited Talk]
Frontier-based Method: Efficient Graph Enumeration and Indexing Using BDDs/ZDDs Shin-ichi Minato (Hokkaido Univ./JST) IN2012-38 |
Discrete structure manipulation is a fundamental technique for many problems solved by computers. Recently, BDD/ZDD attr... [more] | IN2012-38 pp.31-36 |
[Return to Top Page]