Program

  • Note: The following program is tentative. There may be changes in the future. The program was fixed.
  • Invited talk: 60min, Contribution talk: 25min
  • We will prepare lunch boxes every lunch break.

October 19, 2024

13:00-13:30 Opening
13:30-14:30 Invited talk 1
  • Masaaki Nishino, Decision Diagram and Its Applications
14:30 - 15:00 Coffee break
15:00 - 15:50 Session 1 (Contribution talks)
  1. Teruyuki Miyamoto, Jun Kawahara and Shin-Ichi Minato, An Efficient ZDD Construction Algorithm for Enumerating All Cost-Bounded Solutions of Weighted Vertex Cover Problems
  2. Yuki Akagawa, Jun Kawahara and Shin-Ich Minato, Best-First Enumeration Using ZDDs and A* Search
15:50 - 16:10 Coffee break
16:10 - 17:00 Session 2 (Contribution talks)
  1. Yu Nakahata, Matroid Transformation Algorithms using Family Algebra over Zero-suppressed Binary Decision Diagrams
  2. Naoya Taguchi and Toshiki Saitoh, Efficient Implementation of Frontier-based Search for Path Counting by Relaxing Degree Constraint (Presentor: Shiota Takumi)

October 20, 2024

9:00 - 10:00 Invited talk 2
  • Endre Boros, Certificates of Duality
10:00 - 10:30 Coffee break
10:30 - 11:45 Session 3 (Contribution talks)
  1. Zhidan Feng, Henning Fernau and Kevin Mann, Enumerating Minimal Defensive Alliances
  2. Aito Ochi, Katsuhisa Yamanaka and Takashi Hirayama, The Computational Complexity of Minimal Distance k-Dominating Set Enumeration
  3. Arnaud Mary, Enumeration of Minimal Transversals of Hypergraphs of Bounded VC-Dimension
11:45 - 14:00 Lunch & Business meeting
14:00 - 14:50 Session 4 (Contribution talks)
  1. Giovanni Buzzega, Alessio Conte, Roberto Grossi and Giulia Punzi, Experiments on Maximal Common Subsequences
  2. Giulia Punzi, A Theorem on Retaining Biconnectivity under Node Removals
14:50 - 15:20 Coffee break
15:20 - 16:10 Session 5 (Contribution talks)
  1. Muhammad Ilyas and Naveed Ahmed Azam, Counting Multigraphs with Tree Skeleton
  2. Usama Waheed and Naveed Ahmed Azam, Enumeration of Cospectral Graphs

October 21, 2024

9:00 - 9:50 Session 6 (Contribution talks)
  1. Yasuaki Kobayashi, Kazuhiro Kurita, and Kunihiro Wasa, Polynomial-Delay and Polynomial-Space Enumeration of Heavy Maximal Matchings
  2. Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno and Kunihiro Wasa, Amortized Enumeration of Graphlets
9:50 - 10:30 Coffee break
10:30 - 11:45 Session 7 (Contribution talks)
  1. 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
  2. Masashi Gorobe, Kazuhisa Seto and Takashi Horiyama, On the Enumeration of Common Developments of Orthogonal Boxes by Utilizing Cycles on the Surfaces
  3. Waseem Akram and Katsuhisa Yamanaka, Efficient Enumeration of At Most k-Out Polygons
11:45-13:30 Group photo & Lunch
13:30-17:00 Excursion
18:00- Banquet

October 22, 2024

9:30 - 10:30 Invited talk 3
  • Yutaro Yamaguchi, Fast Algorithms for Finding a Maximum Matching: Centralized and Distributed
10:30 - 11:00 Coffee break
11:00 - 12:00 Invited talk 4 (On-line)
  • Nicolas Bousquet, Connectivity of Configuration Graphs
12:00 - 13:30 Lunch
13:30 - 17:00 Working session

Last update: Oct 8, 2024