scientific article; zbMATH DE number 7378599
From MaRDI portal
Publication:5009475
DOI10.4230/LIPIcs.IPEC.2018.13MaRDI QIDQ5009475
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1807.03604
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- A kernel of order \(2k - c\) for Vertex Cover
- Advice classes of parametrized tractability
- A cubic kernel for feedback vertex set and loop cutset
- The complexity of satisfiability problems: Refining Schaefer's theorem
- Matching is as easy as matrix inversion
- A kernel of order \(2k-c\log k\) for vertex cover
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parametrized complexity theory.
- Vertex Cover: Further Observations and Further Improvements
- Complexity and approximability of the maximum flow problem with minimum quantities
- Kernel Bounds for Structural Parameterizations of Pathwidth
- Backdoors to Satisfaction
- Parity, circuits, and the polynomial-time hierarchy
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Problems complete for deterministic logarithmic space
- Some Lower Bounds in Parameterized AC^0.
- Parallel Multivariate Meta-Theorems
- Treedepth Parameterized by Vertex Cover Number.
- Properties of vertex packing and independence system polyhedra
- Point Line Cover
- Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
- Bipartite perfect matching is in quasi-NC
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication:
