Enumerating Minimal Tropical Connected Sets. - Dieter Kratsch; Mathieu Liedloff; Mohamed Yosri Sayadi (SOFSEM, 2017)

On the maximum number of minimal connected dominating sets in convex bipartite graphs. - Mohamed Yosri Sayadi (CoRR, 2019)

Enumeration and maximum number of maximal irredundant sets for chordal graphs. - Petr A. Golovach; Dieter Kratsch; Mathieu Liedloff; Mohamed Yosri Sayadi (Discret. Appl. Math., 2019)

Enumeration and maximum number of minimal dominating sets for chordal graphs. - Petr A. Golovach; Dieter Kratsch; Mathieu Liedloff; Mohamed Yosri Sayadi (Theor. Comput. Sci., 2019)

Enumeration of maximal irredundant sets for claw-free graphs. - Petr A. Golovach; Dieter Kratsch; Mohamed Yosri Sayadi (Theor. Comput. Sci., 2019)

Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive. (Design and analysis of exact exponential algorithms : input-sensitive enumeration). - Mohamed Yosri Sayadi (2019)