2 citations · 3 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
On constrained intersection representations of graphs and digraphs
Ferdinando Cicalese, Clément Dallard, Martin Milanič
We study the problem of determining optimal directed intersection representations of DAGs in a model introduced by Kostochka, Liu, Machado, and Milenkovic [ISIT2019]: vertices are…
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…