13 citations · 31 across the 7 of their papers we have counts for
12 papers
On some problems regarding distance-balanced graphs
Blas Fernandez, Ademir Hujdurovic
A graph is said to be distance-balanced if for any edge of , the number of vertices closer to than to is equal to the number of vertices closer to than to $…
Mind the Independence Gap
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum…
Strong cliques in vertex-transitive graphs
Ademir Hujdurovic
A clique (resp., independent set) in a graph is strong if it intersects every maximal independent sets (resp., every maximal cliques). A graph is CIS if all of its maximal cliques…
Detecting strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliq…
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…
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-…
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…
Graphs vertex-partitionable into strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called loca…
On Color Preserving Automorphisms of Cayley Graphs of Odd Square-free Order
Edward Dobson, Ademir Hujdurović, Klavdija Kutnar +1
An automorphism of a Cayley graph of a group with connection set is color-preserving if or for every edge $(g,gs)\in E(Cay(G…
Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples
Ademir Hujdurović, Urša Kačar, Martin Milanič +2
Recently, Hajirasouliha and Raphael (WABI 2014) proposed a model for deconvoluting mixed tumor samples measured from a collection of high-throughput sequencing reads. This is relat…
On colour-preserving automorphisms of Cayley graphs
Ademir Hujdurović, Klavdija Kutnar, Dave Witte Morris +1
We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every con…
Vertex-transitive CIS graphs
Edward Dobson, Ademir Hujdurović, Martin Milanič +1
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-co…