Compactors for parameterized counting problems
From MaRDI portal
Recommendations
- Counting problems in parameterized complexity
- The Parameterized Complexity of Counting Problems
- Parameterized counting problems
- scientific article; zbMATH DE number 1929968
- On the parameterized complexity of approximate counting
- On parameterized counting
- scientific article; zbMATH DE number 1979521
- Kernelizations for Parameterized Counting Problems
- Some hard families of parameterized counting problems
- scientific article; zbMATH DE number 3883612
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1979521 (Why is no real title available?)
- scientific article; zbMATH DE number 2151250 (Why is no real title available?)
- scientific article; zbMATH DE number 1834657 (Why is no real title available?)
- scientific article; zbMATH DE number 1405654 (Why is no real title available?)
- scientific article; zbMATH DE number 7075922 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- (Meta) kernelization
- A 4k^2 kernel for feedback vertex set
- Algorithms and Data Structures
- Algorithms – ESA 2004
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensionality and kernels
- Bidimensionality and parameterized algorithms (invited talk)
- Complexity issues on bounded restrictive H-coloring
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- Counting matchings with k unmatched vertices in planar graphs
- Data-compression for parametrized counting problems on sparse graphs
- Easy problems for tree-decomposable graphs
- Efficient algorithms for counting parameterized list H-colorings
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fixed-parameter tractability, definability, and model-checking
- Fundamentals of parameterized complexity
- Graph minors and parameterized algorithm design
- Homomorphisms are a good basis for counting small subgraphs
- Improved upper bounds for vertex cover
- Kernelization. Theory of parameterized preprocessing
- Kernelizations for Parameterized Counting Problems
- Linearity of grid minors in treewidth with applications through bidimensionality
- Logic, graphs, and algorithms
- Methods for algorithmic meta theorems
- Nondeterminism within $P^ * $
- On miniaturized problems in parameterized complexity theory
- On the parameterized complexity of approximate counting
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Parameterized algorithms
- Parameterized counting of trees, forests and matroid bases
- Parameterized counting problems
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Testing first-order properties for subclasses of sparse graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The parameterised complexity of counting connected subgraphs and graph motifs
- The parameterised complexity of counting even and odd induced subgraphs
- The restrictive \(H\)-coloring problem
- The structure of the models of decidable monadic theories of graphs
- Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
- Vertex packings: Structural properties and algorithms
- Weighted counting of \(k\)-matchings is \#W[1]-hard
Cited in
(6)- Data-compression for parametrized counting problems on sparse graphs
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Sub-exponential time lower bounds for \#VC and \#Matching on 3-regular graphs
- Kernelization of counting problems
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
This page was built for publication: Compactors for parameterized counting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826317)
