We show that no NP-hard vertex deletion problem based on a graph property that is inherited by subgraphs can have kernels consisting of O(k2-ε) edges unless coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level.Expand

Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound.Expand

We show conditional lower bounds for well-studied #P-hard problems: The number of satisfying assignments of a 2-CNF formula with <i>n</i> variables cannot be computed in time exp(<i>o</i>(<i>) and the same is true for computing the number of all independent sets in a graph.Expand

In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge.Expand

In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge reports on the first iteration of the challenge.Expand

In this paper, we show that, in almost the whole plane, the problem of evaluating the cover polynomial is #Phard to evaluate at all but a few special points and curves.Expand

In this paper, we relate a beautiful theory by Lov\'asz with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman algorithm.Expand