Mohamed Yosri Sayadi

According to our database, Mohamed Yosri Sayadi authored at least 6 papers between 2017 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

PhD thesis, 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

On the maximum number of minimal connected dominating sets in convex bipartite graphs.

Mohamed Yosri Sayadi

CoRR, 2019

2017

Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs.

Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Enumerating Minimal Tropical Connected Sets.

Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Enumeration of Maximal Irredundant Sets for Claw-Free Graphs.

Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017