Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
Abstract Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies
that there is no time algorithm that can solve 2-CSPs with k constraints (over a domain of …
that there is no time algorithm that can solve 2-CSPs with k constraints (over a domain of …
The complexity of matching games: a survey
Matching games naturally generalize assignment games, a well-known class of cooperative
games. Interest in matching games has grown recently due to some breakthrough results …
games. Interest in matching games has grown recently due to some breakthrough results …
Can You Link Up With Treewidth?
A central result of Marx [ToC'10] proves that there are $ k $-vertex graphs $ H $ of maximum
degree $3 $ such that $ n^{o (k/\log k)} $ time algorithms for detecting colorful $ H …
degree $3 $ such that $ n^{o (k/\log k)} $ time algorithms for detecting colorful $ H …
[HTML][HTML] Manipulating the outcome of stable marriage and roommates problems
The stable marriage and stable roommates problems have been extensively studied due to
their applicability in various real-world scenarios. However, it might happen that no stable …
their applicability in various real-world scenarios. However, it might happen that no stable …
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that
there is no $ f (k)\cdot n^{o (k/\log k)} $ time algorithm that can solve 2-CSPs with $ k …
there is no $ f (k)\cdot n^{o (k/\log k)} $ time algorithm that can solve 2-CSPs with $ k …
Manipulating the outcome of stable matching and roommates problems
The stable marriage and stable roommates problems have been extensively studied due to
their high applicability in various real-world scenarios. However, it might happen that no …
their high applicability in various real-world scenarios. However, it might happen that no …