Compactors for parameterized counting problems
type: Item
instance of: scholarly article
title: Compactors for parameterized counting problems
author: Dimitrios M. Thilikos
published in: Computer Science Review
publication date: 2021-12-20T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 7449915
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: counting algorithms
zbMATH Keywords: compactor
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.cosrev.2020.100344
OpenAlex ID: W3120337329
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4281497
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Parameterized Algorithms
cites work: On miniaturized problems in parameterized complexity theory
cites work: Fundamentals of parameterized complexity
cites work: Kernelization
cites work: Parameterized counting problems
cites work: Q4427867
cites work: Block interpolation: a framework for tight exponential-time counting complexity
cites work: Q4636623
cites work: Homomorphisms are a good basis for counting small subgraphs
cites work: Q4967222
cites work: Q4606302
cites work: Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
cites work: Weighted Counting of k-Matchings Is #W[1]-Hard
cites work: Parameterized counting of trees, forests and matroid bases
cites work: On the parameterized complexity of approximate counting
cites work: The parameterised complexity of counting even and odd induced subgraphs
cites work: The parameterised complexity of counting connected subgraphs and graph motifs
cites work: Q5091010
cites work: Kernelizations for Parameterized Counting Problems
cites work: Algorithms – ESA 2004
cites work: Efficient algorithms for counting parameterized list \(H\)-colorings
cites work: Algorithms and Data Structures
cites work: (Meta) Kernelization
cites work: Bidimensionality and Geometric Graphs
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Improved upper bounds for vertex cover
cites work: Vertex packings: Structural properties and algorithms
cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
cites work: A 4 k 2 kernel for feedback vertex set
cites work: Q4091421
cites work: Nondeterminism within $P^ * $
cites work: The restrictive \(H\)-coloring problem
cites work: Q4660720
cites work: Complexity issues on bounded restrictive \(H\)-coloring
cites work: Q4779153
cites work: Q3118384
cites work: Q3086928
cites work: The structure of the models of decidable monadic theories of graphs
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: Easy problems for tree-decomposable graphs
cites work: Q5284545
cites work: Fixed-parameter tractability, definability, and model-checking
cites work: Q4938635
cites work: Testing first-order properties for subclasses of sparse graphs
cites work: Deciding First-Order Properties of Nowhere Dense Graphs
cites work: Q5111863
cites work: Linearity of grid minors in treewidth with applications through bidimensionality
cites work: Bidimensionality and Parameterized Algorithms (Invited Talk)
cites work: Graph Minors and Parameterized Algorithm Design
DOI: 10.1016/J.COSREV.2020.100344
Recommended article: Q5009461
Recommended article: The Parameterized Complexity of Counting Problems
Recommended article: Parameterized counting problems
Recommended article: Q4708603
Recommended article: On the parameterized complexity of approximate counting
Recommended article: Q3539937
Recommended article: Q4427867

Compactors for parameterized counting problems (Recommended article)
Recommended article: Kernelizations for Parameterized Counting Problems
Similarity Score: 0.8840636
Recommender Run: Recommender Run 3

Compactors for parameterized counting problems (Recommended article)
Recommended article: Some hard families of parameterized counting problems
Similarity Score: 0.88029075
Recommender Run: Recommender Run 3

Compactors for parameterized counting problems (Recommended article)
Recommended article: Q3217604
Similarity Score: 0.8786982
Recommender Run: Recommender Run 3