Program schedule
All times are in CET time zone
At a Glance
Information for speakers
To allow convenient participation from multiple time zones, the scheduled program is between 9:00 and 13:00 CET time.
Talks have 15-minute slots. We ask speakers to allow 1-2 minutes to allow preparation for the next speaker. However, speakers do not need to reserve time for Q&A in their slot: deeper discussion on the topics, including Q&A, can take place in the working sessions, where several rooms will be available for open discussion.
We encourage all participants to engage in the working sessions, and in particular, ask the speakers of each day to be available for questions regarding their talks.
The working session rooms will be available after the scheduled times (24/7 during the days of the event) if you wish to continue your discussions at any time.
Detailed Schedule
Day 1
Monday, December 7th
9:00 – 9:15
Opening
9:15– 10:15
Invited Talk by Bruno Courcelle:
Automata tools for Enumeration
10:15– 10:30
Break
Session 1
10:30 – 10:45
A Framework for Efficiently Listing Equivalence Classes
Yishu Wang, Arnaud Mary, Blerina Sinaimeri and Marie-France Sagot
10:45 – 11:00
Dihypergraph Decomposition: Application to Closure System Representations
Simon Vilmin and Lhouari Nourine
11:00 – 11.15
Enumerating Extractions of Grammar-Based Document Spanners
Liat Peterfreund
11:15 – 11:30
Enumerating the Repairs of Inconsistent Databases
Benny Kimelfeld, Phokion Kolaitis, Reinhard Pichler and Sebastian Skritek
11:30 – 11:45
Genome Assembly, a Universal Theoretical Framework: Unifying and Generalizing the Safe and Complete Algorithms
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt, Alexandru Tomescu and Elia Zirondelli
11:45 – 12:00
Decision Diagrams-based Indexing for Searching in Biomedical Graphs
Nicola Licheri, Vincenzo Bonnici, Marco Beccuti and Rosalba Giugno
Working Session
12:00 – 13:00
Day 2
Tuesday December 8th
9:15 –10:15
Invited Talk by Yann Strozecki:
Enumeration Complexity: A New Look on Tractability
10:15 – 10:30
Break
Session 2
10:30 – 10:45
An Algorithm for Dualization in Distributive Lattices
Khaled Elbassioni
10:45 - 11:00
Enumerating Minimal Dominating Sets in the (in)comparability Graphs of Bounded Dimension Posets
Marthe Bonamy, Oscar Defrain, Piotr Micek and Lhouari Nourine
11:00 – 11:15
Fast Assessment of Eulerian Trails
Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis and Giulia Punzi
11:15 – 11:30
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs
Alessio Conte, Pierluigi Crescenzi, Andrea Marino and Giulia Punzi
11:30 – 11:45
Distribution-based Search: the case of Probabilistic Context-Free Grammars, with Applications to Programming by Example
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann and Akarsh Potta
11:45 – 12:00
Experimental Results of a Dynamic Programming Algorithm for Generating Chemical Isomers Based on Frequency Vectors
Naveed Ahmed Azam, Jianshen Zhu, Ryota Ido, Hiroshi Nagamochi and Tatsuya Akutsu
Working Session
12:00 – 13:00
Day 3
Wednesday, December 9th
Session 3
9:15 – 9:30
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints
Kazuhiro Kurita, Yasuaki Kobayashi and Kunihiro Wasa
9:30 – 9:45
Enumeration of Three-Edge-Connected Spanning Subgraphs in Plane Graphs
Yasuko Matsui and Kenta Ozeki
9:45 – 10:00
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Kazuaki Yamazaki, Mengze Qian and Ryuhei Uehara
10:00 – 10:15
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
Alessio Conte and Etsuji Tomita
10:15 – 10:30
Enumerating Empty Polygons
Shunta Terui, Takashi Hirayama, Takashi Horiyama, Katsuhisa Yamanaka and Takeaki Uno
10:30 – 10:45
Near-Linear Algorithms for the k-colored Rainbow Sets
Vahideh Keikha, Hamidreza Keikha and Ali Mohades
Working session (Discord) - Business Meeting (Zoom)
10:45 – 11.30
11:30 – 12:30
Invited Talk by Nicole Schweikardt:
Constant delay enumeration of database query results
Working session
12:30 – 13:00
Day 4
Thursday, December 10th
9:15 – 10:15
Panel by Takeaki Uno:
The Future of Enumeration
10:15 – 10.30
Break
Talk Session 4
10:30 – 10:45
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
Christian Komusiewicz and Frank Sommer
10:45 – 11:00
Enumerating Maximal Independent Sets in Bounded Treewidth Graphs
Batya Kenig
11:00 – 11:15
Faster Listing of Bonds based on Biconnectivity
Alice Raffaele, Romeo Rizzi and Takeaki Uno
11:15 – 11:30
A Reverse Search Method for the Enumeration of Unordered Forests using DAG Compression
Florian Ingels and Romain Azaïs
11:30 – 11:45
Toward Association Rule Mining on Property Graphs
Yuya Sasaki
11:45 – 12:05
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
Petr Golovach, Christian Komusiewicz, Dieter Kratsch and Van Bang Le
Working Session
12:00 – 1:00