Narmina Baghirova

According to our database, Narmina Baghirova authored at least 7 papers between 2022 and 2025.

Collaborative distances:

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

2025

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases.

Narmina Baghirova, Esther Galby, Martin Milanic

CoRR, June, 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, March, 2025

Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases.

Narmina Baghirova, Antoine Castillon

Proceedings of the WALCOM: Algorithms and Computation, 2025

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 of maximum size in degree-constrained graphs.

Narmina Baghirova, Antoine Castillon

CoRR, 2024

2022

Locally checkable problems in bounded clique-width graphs.

Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl

CoRR, 2022

Locally Checkable Problems Parameterized by Clique-Width.

Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022