Data-compression for parametrized counting problems on sparse graphs
From MaRDI portal
Publication:5091010
Recommendations
Cites work
- scientific article; zbMATH DE number 1323192 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 1405654 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- (Meta) kernelization
- Algorithmic Meta-theorems
- Algorithms and Data Structures
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensionality and kernels
- Easy problems for tree-decomposable graphs
- Efficient algorithms for counting parameterized list \(H\)-colorings
- Fixed-parameter tractability, definability, and model-checking
- Fundamentals of parameterized complexity
- Generalized model-checking over locally tree-decomposable classes
- Infeasibility of instance compression and succinct PCPs for NP
- Kernelization -- preprocessing with a guarantee
- Kernelization Lower Bounds by Cross-Composition
- Kernelizations for Parameterized Counting Problems
- Logic, graphs, and algorithms
- Losing Treewidth by Separating Subsets
- Lower bounds for kernelizations and other preprocessing procedures
- Methods for algorithmic meta theorems
- Monadic second-order evaluations on tree-decomposable graphs
- New limits to classical and quantum instance compression
- On problems without polynomial kernels
- On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Parameterized algorithms
- Parametrized complexity theory.
- Reduction algorithms for graphs of small treewidth
- Testing first-order properties for subclasses of sparse graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The structure of the models of decidable monadic theories of graphs
Cited in
(7)- Data-compression for Parametrized Counting Problems on Sparse graphs
- Compactors for parameterized counting problems
- A Retrospective on (Meta) Kernelization
- Faster parameterized algorithms for modification problems to minor-closed classes
- Sparse obstructions for minor-covering parameters
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Bidimensionality and kernels
This page was built for publication: Data-compression for parametrized counting problems on sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091010)
