66 citations
- University of LjubljanaSI66 papers
- Institute of Mathematics, Physics, and MechanicsSI50 papers
- The University of Western AustraliaAU11 papers
- Centre National de la Recherche ScientifiqueFR10 papers
- University of Milano-BicoccaIT10 papers
- University of NisRS9 papers
- Eötvös Loránd UniversityHU7 papers
- Mississippi State UniversityUS7 papers
- National Research University Higher School of EconomicsRU7 papers
- University of MariborSI7 papers
- AGH University of KrakowPL6 papers
- École Normale Supérieure de LyonFR6 papers
Showing 2017 · cs.DMShow all
3 papers · 2 filters
cs.DM2017★ 4 cited
On Almost Well-Covered Graphs of Girth at Least 6
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-co…
cs.DM2017★ 8 cited
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
Didem Gözüpek, Ademir Hujdurović, Martin Milanič
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-…
cs.DM2017★ 5 cited
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič +2
Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurović et al. (IEEE TCBB, to appear) introduced the minimum confli…