Dániel Marx

most citedConditional lower bounds for sparse parameterized 2-CSP: A streamlined proof

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

collaborators

2 papers

cs.DS2026

Pattern-Sparse Tree Decompositions in $H$ -Minor-Free Graphs

Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk

Given an $H$ -minor-free graph $G$ and an integer $k$ , our main technical contribution is sampling in randomized polynomial time an induced subgraph $G^{'}$ of $G$ and a tree decomposi…

cs.CC2023★ 1 cited

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof

Karthik C. S., Dániel Marx, Marcin Pilipczuk +1

Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f (k) \cdot n^{o (k / l o g k)}$ time algorithm that can solve 2-CSPs with $k$ constra…

Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof

Pattern-Sparse Tree Decompositions in $H$ -Minor-Free Graphs