Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Muršič, Peter"'
Autor:
Beisegel, Jesse, Chiarelli, Nina, Köhler, Ekkehard, Milanič, Martin, Muršič, Peter, Scheffler, Robert
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 simultaneous representation problem for interval graphs and defined as the smal
Externí odkaz:
http://arxiv.org/abs/2404.10670
Autor:
Lima, Paloma T., Milanič, Martin, Muršič, Peter, Okrasa, Karolina, Rzążewski, Paweł, Štorgel, Kenny
For a tree decomposition $\mathcal{T}$ of a graph $G$, by $\mu(\mathcal{T})$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathcal{T}$. Induced matching treewidth of a graph $G$ is the minimum value
Externí odkaz:
http://arxiv.org/abs/2402.15834
Autor:
Chiarelli, Nina, Dallard, Clément, Darmann, Andreas, Lendl, Stefan, Milanič, Martin, Muršič, Peter, Pferschy, Ulrich
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 items are assumed to be identical. We consider a very recent measure fo
Externí odkaz:
http://arxiv.org/abs/2402.00921
Autor:
Chiarelli, Nina, Dallard, Clément, Darmann, Andreas, Lendl, Stefan, Milanič, Martin, Muršič, Peter, Pferschy, Ulrich
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 acyclic graph, with vertices representing items and an edge $(a,b)$, meanin
Externí odkaz:
http://arxiv.org/abs/2312.01804
Given an integer partition of $n$, we consider the impartial combinatorial game LCTR in which moves consist of removing either the left column or top row of its Young diagram. We show that for both normal and mis\`ere play, the optimal strategy can c
Externí odkaz:
http://arxiv.org/abs/2207.05599
Autor:
Chiarelli, Nina, Dallard, Clément, Darmann, Andreas, Lendl, Stefan, Milanič, Martin, Muršič, Peter, Pferschy, Ulrich, Pivač, Nevena
This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference graph represent the subset of items approved of by the respective agen
Externí odkaz:
http://arxiv.org/abs/2202.04465
Publikováno v:
In Discrete Applied Mathematics 31 March 2024 346:154-169
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural and algorit
Externí odkaz:
http://arxiv.org/abs/2006.13822
Autor:
Chiarelli, Nina, Dallard, Clément, Darmann, Andreas, Lendl, Stefan, Milanič, Martin, Muršič, Peter, Pferschy, Ulrich, Pivač, Nevena
Publikováno v:
In Discrete Applied Mathematics 31 July 2023 334:45-62
We consider a generalization of the classical game of $NIM$ called hypergraph $NIM$. Given a hypergraph $\cH$ on the ground set $V = \{1, \ldots, n\}$ of $n$ piles of stones, two players alternate in choosing a hyperedge $H \in \cH$ and strictly decr
Externí odkaz:
http://arxiv.org/abs/1804.03692