research
∙
05/26/2023
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
For a well-studied family of domination-type problems, in bounded-treewi...
share
research
∙
11/08/2022
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
We investigate how efficiently a well-studied family of domination-type ...
research
∙
08/24/2022
Matchings Under Diversity Constraints
Matching problems with group fairness constraints have numerous applicat...
research
∙
10/18/2021
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
In the general AntiFactor problem, a graph G is given with a set X_v⊆ℕ o...
research
∙
05/20/2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms
We consider the problem of assigning items to platforms in the presence ...
research
∙
05/19/2021