Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20230302 11:00 
Tokyo 
Ochanomizu University 
Finding Forcing on ZDD by Dynamic Programming Takashi Harada, Shogo Takeuchi (Kochi Univ. of Tech.) COMP202233 
Exact cover problem takes a set S and a subset F of the power set of S as an input and determines whether there exists a... [more] 
COMP202233 pp.16 
IT, ISEC, RCC, WBS 
20220311 16:25 
Online 
Online 
An Efficient Method for Constructing Garbled Circuits Using Linked Lists Guangjian Liu, Hikaru Morita (Graduate School of Kanagawa Univ) IT2021131 ISEC202196 WBS202199 RCC2021106 
Since the proposal of the Garbled Circuit by Yao, a number of construction methods for secret circuits have been propose... [more] 
IT2021131 ISEC202196 WBS202199 RCC2021106 pp.281284 
ISEC, IT, WBS 
20200311 12:10 
Hyogo 
University of Hyogo (Cancelled but technical report was issued) 
A Construction Method of Garbled Circuits for ZDD Takayuki Masui, Hikaru Morita (Graduate Schoool, Kanagawa Univ) IT2019114 ISEC2019110 WBS201963 
Kruger et al proposed a new method to construct Garbled Circuits for BDD, which gives a compression expression of logic... [more] 
IT2019114 ISEC2019110 WBS201963 pp.167170 
SITE 
20191206 13:50 
Kanagawa 

Deciding Equivalence of The Rule List Policies via SAT solver Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) SITE201982 
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] 
SITE201982 pp.1319 
COMP, IPSJAL 
20190511 10:40 
Kumamoto 
Kumamoto University 
Enumerating and Indexing Graph Subdivisions using Zerosuppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shinichi Minato (Kyoto Univ.) COMP20193 
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$.
In this paper, when ... [more] 
COMP20193 pp.5158 
VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJSLDM, IPSJEMB, IPSJARC (Joint) [detail] 
20171106 13:25 
Kumamoto 
KumamotoKenminkouryukan Parea 
RECONF201738 
Graph processing has memory access with low locality, and it is not easy to process largescale graphs which have the mi... [more] 
RECONF201738 pp.712 
SIP, CAS, MSS, VLD 
20170619 14:10 
Niigata 
Niigata University, Ikarashi Campus 
Computing the Number of Packets that match A Filtering Rule via MTZDDs Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS20179 VLD201712 SIP201733 MSS20179 
A filtering policy is denoted as a filtering rule list and is achieved by linear search of the rule list. The increase i... [more] 
CAS20179 VLD201712 SIP201733 MSS20179 pp.4550 
DC, SS 
20161027 11:00 
Shiga 
Hikone KinroFukushi Kaikan Bldg. 
ZDDbased test case generation method for high strength combinatorial interaction testing Teru Ohashi, Tatsuhiro Tsuchiya (Osaka Univ) SS201618 DC201620 
Combinatorial interaction testing is a well practiced software testing method.
This method requires any $t$wise para... [more] 
SS201618 DC201620 pp.16 
COMP, IPSJAL 
20160624 15:45 
Ishikawa 

Enumerating Letter Graphs by Zerosuppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP20168 
A zerosuppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] 
COMP20168 pp.3340 
IN, NV (Joint) 
20150717 11:15 
Hokkaido 
Hokkaido University 
[Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN201534 
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] 
IN201534 pp.6772 
COMP 
20150423 14:10 
Miyagi 

Frontier Method for Enumerating and Indexing the Vertex Induced Subgraphs Hirofumi Suzuki, Shinichi Minato (Hokkaido Univ.) COMP20153 
(To be available after the conference date) [more] 
COMP20153 pp.1520 
COMP 
20150309 11:10 
Kyoto 
Ritsumeikan University 
ZDD Construction for Maximal Independent Set Enumeration on Hypergraph Teruji Sugaya (OUJ), Takahisa Toda (UEC), Shinichi Minato (HU) COMP201445 
In this paper, we present an efficient algorithm to enumerate maximal independent sets in hypergraph.
In the presented... [more] 
COMP201445 pp.1927 
IBISML 
20141118 15:00 
Aichi 
Nagoya Univ. 
[Poster Presentation]
Enumerating all the optimal solutions of multiple travelling salesman problem by using simpath algorithm Masashi Ogawa, Masato Inoue (Waseda Univ.) IBISML201478 
In this manuscript, we propose an exact method which answers all the optimal solutions of "multiple traveling salesman p... [more] 
IBISML201478 pp.321328 
IN, NV (Joint) 
20130718 14:55 
Hokkaido 
Hokkaido Univ. Faculty of Eng. Academic Lounge 3 
[Invited Talk]
Graphillion: Software Library for Very Large Sets of Graphs Takeru Inoue (JST ERATO) IN201343 
Several graph libraries have been developed in the past few decades,
but they were designed to work with a few graphs e... [more] 
IN201343 pp.4347 
COMP, IPSJAL 
20130517 15:05 
Hokkaido 
Otaru University of Commerce 
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP201312 
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] 
COMP201312 pp.6370 
COMP 
20130318 13:20 
Gifu 
Gifu University 
Auxiliary Skip Links for Quick Traversal of ZDDs to Manipulate LargeScale Sparse Matrices Shinichi Minato (Hokkaido Univ.) COMP201255 
ZDD (Zerosuppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating ... [more] 
COMP201255 pp.1522 
COMP 
20130318 13:45 
Gifu 
Gifu University 
Compact and Fast Indices Based on ZeroSuppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shinichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP201256 
In many reallife problems, we are often faced with manipulating families of sets. Manipulation of largescale set famil... [more] 
COMP201256 pp.2330 
VLD, DC, IPSJSLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] 
20121126 10:55 
Fukuoka 
Centennial Hall Kyushu University School of Medicine 
An Efficient ZDD Construction Method Using Recursive Specifications Hiroaki Iwashita, Jun Kawahara (JST), Shinichi Minato (Hokkaido Univ.) VLD201263 DC201229 
In recent years, new enumeration methods using zerosuppressed binary decision diagrams (ZDDs) has been attracting atten... [more] 
VLD201263 DC201229 pp.2529 
CS 
20121121 11:30 
Hokkaido 
Kitayuzawa Meisuitei, Hokkaido 
[Special Invited Talk]
ERATO MINATO Discrete Structure Manipulation System Project and Future Prospects Shinichi Minato (Hokkaido Univ.) CS201270 
Discrete structure manipulation is a fundamental technique for many problems solved by computers. Recently, BDD (Binary ... [more] 
CS201270 pp.3540 
IN, NV (Joint) 
20120719 16:25 
Hokkaido 
Hokkaido Univ. 
[Invited Talk]
Frontierbased Method: Efficient Graph Enumeration and Indexing Using BDDs/ZDDs Shinichi Minato (Hokkaido Univ./JST) IN201238 
Discrete structure manipulation is a fundamental technique for many problems solved by computers. Recently, BDD/ZDD attr... [more] 
IN201238 pp.3136 