4 papers
Patrolling cop vs omniscient robber
Nina Chiarelli, Paul Dorbec, MiloÅ¡ StojakoviÄ +1
We study a variant of the classical Cops and Robbers game with one cop and one robber. The cop follows a fixed walk on the graph, called a patrol, that is chosen before the game be…
On -Roman graphs: complexity of recognition and the case of split graphs
Kenny BeÅ¡ter Å torgel, Kenny Bešter Štorgel, Nina Chiarelli +7
For a positive integer , a -Roman dominating function of a graph is a function satisfying $\sum_{u\in N(v)} f(u) \geq…
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…
Sandwich Monotonicity and the Recognition of Weighted Graph Classes
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler +5
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from…