3 papers
cs.GT2025
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
Nina Chiarelli, Clément Dallard, Andreas Darmann +4
Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the i…
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…
math.CO2025
Avoidability beyond paths
Vladimir Gurvich, Matjaž Krnc, Martin MilaniÄ +1
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, MilaniÄ, and Servatius in 2019 as a common generalization of avoidable vertices and simpl…