activity
20212026
most citedTight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing cs.LOShow all

Nothing from them under that filter.

Their other years and fields are still on the left.