2 citations · 8 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
Václav Blažej, Dušan Knop, Jan Pokorný +1
We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p p…
cs.GT2024
Individual Rationality in Topological Distance Games is Surprisingly Hard
Argyrios Deligkas, Eduard Eiben, Dušan Knop +1
In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depend…