Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP, IPSJAL 
20210508 13:30 
Online 
Online 
[Invited Talk]
Overview and Prospective Reserch Activities of GrantinAid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shinichi Minato (Kyoto Univ.) COMP20218 
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] 
COMP20218 p.54 
COMP 
20201204 10:00 
Online 
Online 
A Fast ZDDBased Method for Enumerating All Solutions of CostBounded Combinatorial Problems Shinichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP202019 
[more] 
COMP202019 pp.815 
VLD, DC, RECONF, ICD, IPSJSLDM (Joint) [detail] 
20201117 14:25 
Online 
Online 
Variable Ordering for Minimizing Power Consumption of BDDbased Optical Logic Circuits Ryosuke Matsuo, Shinichi Minato (Kyoto Univ) VLD202024 ICD202044 DC202044 RECONF202043 
Optical logic circuits based on integrated nanophotonics have attracted significant interest due to their ultrahighspe... [more] 
VLD202024 ICD202044 DC202044 RECONF202043 pp.7883 
COMP 
20190902 10:50 
Okayama 
Tsushima Campus, Okayama University 
Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shinichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP201910 
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] 
COMP201910 pp.15 
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 
COMP 
20181026 15:45 
Kyoto 
Kyoto University 
Recent Activities of Discrete Structure Manipulation System Project Shinichi Minato (Kyoto Univ.) COMP201828 
After five years execution of ERATO Minato Discrete Structure Manipulation System Project from 2010 to 2015, as the succ... [more] 
COMP201828 p.55 
IN 
20170719 09:40 
Hokkaido 
Japan Red Cross Hokkaido College of Nursing 
Network Reduction Method that Minimizes Total Capacity Change for Virtual Network Embedding Acceleration Toru Mano, Takeru Inoue, Kimihiro Mizutani (NTT), Shinichi Minato (Hokkaido Univ.), Osamu Akashi (NTT) IN201721 
Virtual network (NW) embedding technology is essential for NW virtualization. Although the linear programming relaxation... [more] 
IN201721 pp.1318 
NC, IPSJBIO, IBISML, IPSJMPS [detail] 
20170624 09:30 
Okinawa 
Okinawa Institute of Science and Technology 
Efficient Adversarial Combinatorial Bandit Algorithm via Zerosuppressed Decision Diagrams Shinsaku Sakaue (NTT), Masakazu Ishihata, Shinichi Minato (Hokkaido Univ.) IBISML20171 
We propose an algorithm for the adversarial combinatorial bandit problem, which is a sequential decision problem. The pr... [more] 
IBISML20171 pp.4348 
COMP 
20151201 10:30 
Osaka 

A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shinichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP201531 
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] 
COMP201531 pp.916 
COMP 
20150901 14:30 
Nagano 

Enumerating and Indexing Walks Between Any Pair of Vertices Hiroshi Aoki, Norihito Yasuda, Shinichi Minato (Hokkaido Univ.) COMP201521 
This paper presents a method for enumerating and indexing all the walks between any two points in a given graph.
It is ... [more] 
COMP201521 pp.3539 
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 
COMP 
20141008 15:15 
Tokyo 
Chuo University 
Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shinichi Minato (Hokkaido Univ.) COMP201430 
An Eulerian trail is a trail containing all edges of a given graph exactly once.
Although counting problem of Eulerian ... [more] 
COMP201430 pp.2529 
CS, NS, IN (Joint) 
20140911 10:00 
Miyagi 
Tohoku Univ. Research Institute of Electrical Communication 2gokan 
Packet Classification for Global Network View of SDN with MDDs Takeru Inoue, Toru Mano, Kimihiro Mizutani (NTT), Shinichi Minato (Hokkaido Univ.), Osamu Akashi (NTT) IN201450 
In softwaredefined networking, applications are allowed to access a
global view of the network so as to provide sophis... [more] 
IN201450 pp.16 
COMP 
20131018 10:40 
Aichi 
Nagoya Institute of Technology 
Threeway Indexing ZDDs for Large Scale Sparse Dataset Hiroshi Aoki (Hokkaido Univ.), Takahisa Toda (JST), Shinichi Minato (Hokkaido Univ.) COMP201332 
[more] 
COMP201332 pp.18 
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 