most citedTreewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2024

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph

Nina Chiarelli, Clément Dallard, Andreas Darmann +4

We consider the task of allocating indivisible items to agents, when the agents' preferences over the items are identical. The preferences are captured by means of a directed acycl…