3 citations · 7 across the 9 of their papers we have counts for
11 papers
A rainbow partition theorem for trees and connected maximin share allocations of chores
Marcin Anholcer, Maciej Bartkowiak, Bartłomiej Bosek +3
Xiao, Qiu, and Huang (AAMAS 2023) and independently Lonc (personal communication) asked whether indivisible chores located at the vertices of a tree can always be allocated to …
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
Michał Dębski, Zbigniew Lonc, Karolina Okrasa +2
For graphs and , an -coloring of is an edge-preserving mapping from to . In the -Coloring problem the graph is fixed and we ask whether an instanc…
Dilworth's Theorem for Borel Posets
Bartłomiej Bosek, Jarosław Grytczuk, Zbigniew Lonc
A famous theorem of Dilworth asserts that any finite poset of width can be decomposed into chains. We study the following problem: given a Borel poset of finite width $…
Maximin share allocations on cycles
Zbigniew Lonc, Miroslaw Truszczynski
The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the case when goods form a graph and the goal is…
Sequences of radius for complete bipartite graphs
Michał Dębski, Zbigniew Lonc, Paweł Rzążewski
A \emph{-radius sequence} for a graph is a sequence of vertices of (typically with repetitions) such that for every edge of vertices and appear at least…
Tight Euler tours in uniform hypergraphs - computational aspects
Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski
By a tight tour in a -uniform hypergraph we mean any sequence of its vertices such that for all the set $e_i=\{w_i,w_{i+1}\ldots,…