Authors	Title
Yu Nakahata	Matroid Transformation Algorithms using Family Algebra over Zero-suppressed Binary Decision Diagrams
Waseem Akram and Katsuhisa Yamanaka	Efficient Enumeration of At Most k-Out Polygons
Zhidan Feng, Henning Fernau and Kevin Mann	Enumerating Minimal Defensive Alliances
Aito Ochi, Katsuhisa Yamanaka and Takashi Hirayama	The Computational Complexity of Minimal Distance k-Dominating Set Enumeration
Shoon Mineyoshi, Kazuhisa Seto and Takashi Horiyama	On the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries
Arnaud Mary	Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
Muhammad Ilyas and Naveed Ahmed Azam	Counting Multigraphs with Tree Skeleton
Masashi Gorobe, Kazuhisa Seto and Takashi Horiyama	On the enumeration of common developments of orthogonal boxes by utilizing cycles on the surfaces
Giulia Punzi	A Theorem on Retaining Biconnectivity under Node Removals
Usama Waheed and Naveed Ahmed Azam	Enumeration of Cospectral Graphs
Giovanni Buzzega, Alessio Conte, Roberto Grossi and Giulia Punzi	Experiments on Maximal Common Subsequences
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno and Kunihiro Wasa	Amortized Enumeration of Graphlets
Yasuaki Kobayashi, Kazuhiro Kurita and Kunihiro Wasa	Polynomial-Delay and Polynomial-Space Enumeration of Heavy Maximal Matchings
Naoya Taguchi and Toshiki Saitoh	Efficient Implementation of Frontier-based Search for Path Counting by Relaxing Degree Constraint
Teruyuki Miyamoto, Jun Kawahara and Shin-Ichi Minato	An Efficient ZDD Construction Algorithm for Enumerating All Cost-Bounded Solutions of Weighted Vertex Cover Problems
Yuki Akagawa, Jun Kawahara and Shin-Ich Minato	Best-First Enumeration Using ZDDs and A* Search