La (≤ k)-demi-reconstructibilite des graphes pour 7 ≤ k ≤ 12. - Nadia El Amri (Ars Comb., 2015)

Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for k ∈ {3, 4}. - Rim Ben Hamadou; Youssef Boudabbous; Nadia El Amri; Gérard Lopez (Graphs Comb., 2016)

Self-Duality of Modules and Reconstruction of Tournaments Up to Duality. - Youssef Boudabbous; Abderrahim Boussaïri; Abdelhak Chaïchaâ; Nadia El Amri (J. Multiple Valued Log. Soft Comput., 2016)

Recognizing Indecomposability for Tournaments. - Rim Ben Hamadou; Imed Boudabbous; Nadia El Amri (J. Multiple Valued Log. Soft Comput., 2018)

(≤ k)-hereditarily Reconstructible Digraphs. - Nadia El Amri (J. Multiple Valued Log. Soft Comput., 2020)