Narmina Baghirova

Narmina Baghirova is a Researcher at the Department of Informatics within the Interfaculty Informatics Department at the University of Fribourg. She holds a bachelor’s degree in Mathematics from the University of Primorska (Slovenia), a master’s in Mathematical Sciences from the same institution, and has completed exchange semesters at Universidad del País Vasco (Spain) and Eötvös Loránd University (Hungary). She is currently pursuing a PhD under Prof. Bernard Ries and Dr. David Schindl.

Her research focuses on Algorithmic Graph Theory, Computational Complexity, and Combinatorial Optimization. Key areas include k-community structure detection in graphs, proportionally dense subgraphs (PDS), and parameterized complexity analysis. Recent work explores efficiently solvable cases for these problems and their applications in social network modeling.

Her publications (2022–2025) span theoretical computer science, discrete mathematics, and bioinformatics, addressing graph partitioning, phylogenetic algorithms, and structural graph properties. She has contributed to both journal articles and conference proceedings.

Baghirova collaborates with international researchers and is affiliated with the Department of Informatics at the University of Fribourg, where she contributes to research on computational complexity and graph-theoretic problems.