66 citations · 323 across the 55 of their papers we have counts for
9 papers · 1 filter
1-perfectly orientable graphs and graph products
Tatiana Romina Hartinger, Martin Milanič
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. g…
Domination parameters with number 2: interrelations and algorithmic consequences
Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo +2
In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which…
Decomposing 1-Sperner hypergraphs
Endre Boros, Vladimir Gurvich, Martin Milanič
A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minima…
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 Equistable, Split, CIS, and Related Classes of Graphs
Endre Boros, Vladimir Gurvich, Martin Milanič
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic st…
On the readability of overlap digraphs
Rayan Chikhi, Paul Medvedev, Martin Milanic +1
We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique stri…
Recognizing k-equistable graphs in FPT time
Eun Jung Kim, Martin Milanic, Oliver Schaudt
A graph is called equistable if there exist a positive integer and a weight function such that is a maximal stable set of …
Equistarable bipartite graphs
Endre Boros, Nina Chiarelli, Martin Milanič
Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges…
Spread of Influence in Weighted Networks under Time and Budget Constraints
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a…