Locally Checkable Problems Parameterized by Clique-Width. - Narmina Baghirova; Carolina Lucía Gonzalez; Bernard Ries; David Schindl (ISAAC, 2022)

Locally checkable problems in bounded clique-width graphs. - Narmina Baghirova; Carolina Lucía Gonzalez; David Schindl (CoRR, 2022)

Proportionally dense subgraphs of maximum size in degree-constrained graphs. - Narmina Baghirova; Antoine Castillon (CoRR, 2024)

Finding k-community structures in special graph classes. - Narmina Baghirova; Clément Dallard; Bernard Ries; David Schindl (Discret. Appl. Math., 2024)

Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases. - Narmina Baghirova; Antoine Castillon (WALCOM, 2025)

Explainable Graph-theoretical Machine Learning: with Application to Alzheimer's Disease Prediction. - Narmina Baghirova; Duy-Thanh Vu; Duy-Cat Can; Christelle Schneuwly Diaz; Julien Bodelet; Guillaume Blanc; Georgi Hrusanov; Bernard Ries; Oliver Y. Chén (CoRR, 2025)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases. - Narmina Baghirova; Esther Galby; Martin Milanic (CoRR, 2025)