|
|
Tuesday (November 22)
13h30 - Meet and Greet
14h30-15h30
Nofar Carmelli (Invited talk)
Enumeration and Related Problems in Query Answering
15h30-16h05
Karl Bringmann, Nofar Carmeli et Stefan Mengel
Tight Fine-Grained Bounds for Direct Access on Join Queries
16h05-16h35
Coffee break
16h35-17h10
Antoine Amarilli et Mikaël Monet
Enumerating Regular Languages in Constant Delay
17h10-17h45
Mengze Qian and Ryuhei Uehara
Efficient Enumeration of Non-isomorphic Block-Cutpoint Trees
Wednesday (November 23)
9h30-10h30
Torsten Mütze (Invited talk)
Combinatorial generation via permutation languages
10h30-11h00
Coffee break
11h00-11h35
George Manoussakis
Efficient maximal cliques enumeration in weakly closed graphs
11h35-12h10
Christian Bean, Émile Nadeau, Jay Pantone and Henning Ulfarsson
Using Combinatorial Exploration to sample permutations
12h15-14h00
Lunch
14h00-14h35
Shin-Ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa and Yutaro Yamaguchi
A ZDD-Based Method for Exactly Enumerating All Lower-Cost Solutions of Combinatorial Problems
14h35-15h10
Yudai Enomoto, Kawakami Yuki, Kazuhisa Seto, Takashi Horiyama and Jun Mitani
Counting and ZDD-based Enumeration of Locally Flat-Foldable Box-Pleated Crease Patterns on the 45-Degree Grid System
15h20-15h50
Coffee break
16h00-16h35
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef and Simon Vilmin
On the preferred extensions of argumentation frameworks: bijections with naive sets
16h35-18h00
Working session
18h45-...
Wine & Cheese Party
Thursday (November 24)
9h30-10h30
Florent Capelli (Invited talk)
Geometric Amortization of Enumeration Algorithm
10h30-11h00
Coffee break
11h00-11h35
Yann Strozecki
Space complexity of enumeration
11h35-12h10
Stefan Neubert
Enumeration in P
12h15-14h00
Lunch
13h40-18h40
Guided tour on top of the Puy de Dôme
Friday (November 25)
9h30-10h30
Alessio Conte (Invited talk)
Proximity search: foundations, advancements and (current) limits
10h30-11h00
Coffee break
11h00-11h35
Caroline Brosse, Arnaud Mary and Vincent Limouzy
Polynomial delay algorithm for minimal chordal completions
11h35-12h10
Yasuaki Kobayashi, Kazuhiro Kurita and Kunihiro Wasa
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
12h10-14h00
Lunch
Online user: 2 | Privacy |