8 citations · 12 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition
Martin Milanič, Nevena Pivač
A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the…
cs.MA2022★ 1 cited
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…