Kernelization of counting problems
From MaRDI portal
Cites work
- \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
- A full complexity dichotomy for immanant families
- A note on max k-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
- A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
- Advice classes of parametrized tractability
- Approximately counting and sampling small witnesses using a colourful decision oracle
- Compactors for parameterized counting problems
- Counting problems in parameterized complexity
- Counting small induced subgraphs with hereditary properties
- Data-compression for parametrized counting problems on sparse graphs
- Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies
- Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts
- Fundamentals of parameterized complexity
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 5948060 (Why is no real title available?)
- scientific article; zbMATH DE number 6737879 (Why is no real title available?)
- scientific article; zbMATH DE number 7788351 (Why is no real title available?)
- Introduction to algorithms
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Kernelizations for Parameterized Counting Problems
- Lossy kernelization
- Lossy kernels for connected dominating set on sparse graphs
- Lossy kernels for graph contraction problems
- Lossy Kernels for Hitting Subgraphs
- New limits to classical and quantum instance compression
- Nondeterminism within $P^ * $
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- On problems without polynomial kernels
- On the parameterized complexity of contraction to generalization of trees
- Paradigms for parameterized enumeration
- Parameterized algorithms
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Parameterized approximation via fidelity preserving transformations
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Representative sets and irrelevant vertices: new tools for kernelization
- Revisiting connected vertex cover: FPT algorithms and lossy kernels
- The complexity of computing the permanent
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
Cited in
(4)
This page was built for publication: Kernelization of counting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906350)
