On the descriptive complexity of vertex deletion problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A survey of parameterized algorithms and the complexity of edge modification
- An improved kernelization algorithm for trivially perfect editing
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Distance from triviality 2.0: hybrid parameterizations
- Engineering Kernelization for Maximum Cut
- Existential second-order logic over graphs: a complete complexity-theoretic classification
- Existential second-order logic over graphs: charting the tractability frontier
- Existential second-order logic over graphs: parameterized complexity
- Existential second-order logic over strings
- Finite Model Theory
- Hitting topological minors is FPT
- Node-Deletion NP-Complete Problems
- Node-and edge-deletion NP-complete problems
- On the parameterized complexity of graph modification to first-order logic properties
- Parameterized algorithms
- Parameterized and Exact Computation
- Parametrized complexity theory.
- The node-deletion problem for hereditary properties is NP-complete
- There and back again: on applying data reduction rules by undoing others
This page was built for publication: On the descriptive complexity of vertex deletion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241015)
