3 citations · 20 across the 48 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
The Complexity of Finding Fair Many-to-One Matchings
Niclas Boehmer, Tomohiro Koana
We analyze the (parameterized) computational complexity of "fair" variants of bipartite many-to-one matching, where each vertex from the "left" side is matched to exactly one verte…
cs.DS2021★ 2 cited
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable
Niclas Boehmer, Robert Bredereck, Dušan Knop +1
We study a variant of Set Cover where each element of the universe has some demand that determines how many times the element needs to be covered. Moreover, we examine two generali…