1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2026
When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?
Timo Fritsch, Marvin Künnemann, Mirza Redzic +1
Consider the fundamental task of finding independent sets of (constant) size in a given -node hypergraph. How is the time complexity affected by the sparsity of the input, i…
cs.CC2025★ 1 cited
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
Nick Fischer, Marvin Künnemann, Mirza Redžić +1
Is detecting a -clique in -partite regular (hyper-)graphs as hard as in the general case? Intuition suggests yes, but proving this -- especially for hypergraphs -- poses nota…