1 citations · 1 across the 2 of their papers we have counts for
5 papers
Allocation of Indivisible Items with Individual Preference Graphs
Nina Chiarelli, Clément Dallard, Andreas Darmann +5
This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference…
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez Barona, Martin Milanič +2
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques…
New Algorithms for Weighted -Domination and Total -Domination Problems in Proper Interval Graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni +2
Given a positive integer , a -dominating set in a graph is a set of vertices such that every vertex not in the set has at least neighbors in the set. A total -domi…
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
Nina Chiarelli, Tatiana R. Hartinger, Matthew Johnson +2
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Trans…
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…