Kernelizations for Parameterized Counting Problems

DOI10.1007/978-3-540-72504-6_64MaRDI QIDQ5425483zbMATH OpenOpenAlexFDO

Authors Marc Thurley

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_64

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A kernelization algorithm for \(d\)-hitting set
• A hierarchy of polynomial kernels
• On problems without polynomial kernels
• (Meta) kernelization
• Kernelization Algorithms for d-Hitting Set Problems

Cited in

(10)

• Compactors for parameterized counting problems
• Counting problems in parameterized complexity
• Data-compression for parametrized counting problems on sparse graphs
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
• On the complexity of finding and counting solution-free sets of integers
• Kernelization for counting problems on graphs: preserving the number of minimum solutions
• Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
• Confronting intractability via parameters
• Kernelization of counting problems
• Kernelization for counting problems on graphs: preserving the number of minimum solutions

This page was built for publication: Kernelizations for Parameterized Counting Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425483)