# Hitting forbidden subgraphs in graphs of bounded treewidth

@inproceedings{Cygan2014HittingFS,
title={Hitting forbidden subgraphs in graphs of bounded treewidth},
author={Marek Cygan and D{\'a}niel Marx and Marcin Pilipczuk and Michal Pilipczuk},
booktitle={Information and Computation},
year={2014}
}
• Published in Information and Computation 25 August 2014
• Mathematics
9 Citations

## Figures from this paper

• Mathematics
MFCS
• 2020
The smallest function $f_H(t)$ such that H-IS-Deletion can be solved in time is determined assuming the Exponential Time Hypothesis (ETH), and it is shown that when $H$ deviates slightly from a clique, the function suffers a sharp jump.
• Computer Science
SODA
• 2016
It is proved that, assuming the counting version of the Strong Exponential-Time Hypothesis (#SETH), the problem of counting perfect matchings • has no (2 --- e)knO(1) time algorithm for any e > 0 on graphs of treewidth k (but it can be solved in time O(nk+1) if a k-expression is given).
• Computer Science, Mathematics
ICALP
• 2016
A matching lower bound is given giving evidence that double-exponential dependence on treewidth may be necessary for the choosability problem, and evidence that an algorithm with running time 2^(2^(o(w)))*n^(O(1)) would violate the Exponential-Time Hypothesis (ETH).
• Mathematics
STACS
• 2018
This work proves for every fixed non-interval graph H that if a tree decomposition of width tw(G) is given in the input, then the problem can be solved in time i^*(H)^{tw(G)} n^{O(1)}.
This thesis shows that editing towards trivially perfect graphs, threshold graphs, and chain graphs are all NP-complete, resolving 15 year old open questions and provides several new results in classical complexity, kernelization complexity, and subexponential parameterized complexity.
• Mathematics
IPEC
• 2021
A common theme of the first two algorithmic results is to represent connectivity properties of the current graph in a state of a dynamic programming algorithm as an auxiliary forest with O(k) nodes, resulting in a 2O(k log k) bound on the number of states for one node of the tree decomposition or cliquewidth expression.
• Mathematics
MFCS
• 2020
This work proves co-NP-hardness results under some assumptions on the graphs in ${\cal H}$, which implies that Contraction ($\pi$) is co- NP-hard even for fixed $k=d=1$ when $\pi$ is the size of a minimum feedback vertex set or an odd cycle transversal.
• Mathematics
Algorithmica
• 2020
It is proved that the problem of finding a largest, in terms of the number of vertices, induced subgraph of a graph G that belongs to $\mathcal{C}$ can be solved in $2^{o(n)$ time.
• Computer Science
ArXiv
• 2023
This work designs exact and approximation algorithms achieving reasonable guarantees on the quality of the matching as well as on the time complexity of proportionally fair matching with more than two groups.

## References

SHOWING 1-10 OF 31 REFERENCES

• Computer Science, Mathematics
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011
It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.
• Computer Science
Inf. Comput.
• 2013
Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented.
Every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm that determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G withtreewidth at mostK.
• Computer Science, Mathematics
ICALP
• 2009
This paper shows how to combine results with combinatorial reductions which use colors and IDs in order to prove kernelization lower bounds for a variety of basic problems, and rules out the existence of compression algorithms for many of the problems in question.
• Computer Science
SODA
• 2014
A dynamic programming algorithm for Weighted Vertex Planarization on graphs of treewidth w with running time 2O(w log w) · n, thereby improving over previous double-exponential algorithms.
• Computer Science
SODA '11
• 2011
Lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth are obtained and the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi are proved.
• Computer Science, Mathematics
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2013
This is the first algorithm providing a constant factor approximation for tree width which runs in time single-exponential in k and linear in n, and can be used to speed up many such algorithms to work in time which is single-Exponential in the tree width andlinear in the input size.
• T. Kloks
• Mathematics
Lecture Notes in Computer Science
• 1994
Testing superperfection of k-trees and triangulating 3-colored graphs results in approximating treewidth and pathwidth for some classes of perfect graphs.