5 citations · 10 across the 13 of their papers we have counts for
8 papers · 1 filter
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…
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler +3
We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultane…
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…
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
Nina Chiarelli, Matjaž Krnc, Martin Milanič +2
We consider the fair allocation of indivisible items to several agents with additional conflict constraints. These are represented by a conflict graph where each item corresponds t…
Bipartite Graphs of Small Readability
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch +4
We study a parameter of bipartite graphs called readability, introduced by Chikhi et al. (Discrete Applied Mathematics, 2016) and motivated by applications of overlap graphs in bio…
On the complexity of the identifiable subgraph problem, revisited
Stefan Kratsch, Martin Milanič
A bipartite graph with at least one edge is said to be identifiable if for every vertex , the subgraph induced by its non-neighbors has a matching of cardinalit…