Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
On Approximate MMS Allocations on Restricted Graph Classes
Václav Blažej, Michał Dębski, Zbigniew Lonc +2
We study the problem of fair division of a set of indivisible goods with connectivity constraints. Specifically, we assume that the goods are represented as vertices of a connected…
cs.DM2022
Efficient attack sequences in m-eternal domination
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
We study the m-eternal domination problem from the perspective of the attacker. For many graph classes, the minimum required number of guards to defend eternally is known. By defin…
cs.DM2019
On Induced Online Ramsey Number of Paths, Cycles, and Trees
Václav Blažej, Pavel Dvořák, Tomáš Valla
An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph and a graph of an infinite set of independent vertices. In each ro…