Moussa Abdenbi

According to our database, Moussa Abdenbi authored at least 4 papers between 2018 and 2025.

Collaborative distances:

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

2025

Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem.

Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Odile Marcotte

RAIRO Theor. Informatics Appl., 2025

2024

Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees.

Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Mélodie Lapointe, Martin Lavoie

RAIRO Theor. Informatics Appl., 2024

On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality.

Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Odile Marcotte

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

2018

On the maximal number of leaves in induced subtrees of series-parallel graphs.

Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018