Hypergraph k-cut for fixed k in deterministic polynomial time

data structures and algorithms

Audience: researchers in the topic

Frontiers of Parameterized Complexity

Series comments: Link to the zoom meeting: uib.zoom.us/j/4231169675 Meeting ID: 423 116 9675 Password: Name of the W[1]-complete problem, 6 letters, all capital. Also known as a set of pairwise adjacent vertices.