Q5091010 (Q5091010): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.ISAAC.2018.20
@@ Property / DOI: 10.4230/LIPIcs.ISAAC.2018.20 / rank @@
-Normal rank
@@ Property / author @@
-Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
-Normal rank
@@ Property / author @@
+Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction algorithms for graphs of small treewidth
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+Lower bounds for kernelizations and other preprocessing procedures
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255109
@@ Property / cites work: Q4255109 / rank @@
+Normal rank
@@ Property / cites work @@
+AND-compression of NP-complete problems: streamlined proof and minor observations
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for counting parameterized list \(H\)-colorings
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+New Limits to Classical and Quantum Instance Compression
+Normal rank
@@ Property / cites work @@
+Testing first-order properties for subclasses of sparse graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability, Definability, and Model-Checking
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Generalized model-checking over locally tree-decomposable classes
+Normal rank
@@ Property / cites work @@
+Q4938635
@@ Property / cites work: Q4938635 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086928
@@ Property / cites work: Q3086928 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3118384
@@ Property / cites work: Q3118384 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding First-Order Properties of Nowhere Dense Graphs
+Normal rank
@@ Property / cites work @@
+Losing Treewidth by Separating Subsets
@@ Property / cites work: Losing Treewidth by Separating Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Algorithmic Meta-theorems
@@ Property / cites work: Algorithmic Meta-theorems / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of the models of decidable monadic theories of graphs
+Normal rank
@@ Property / cites work @@
+Q5284545
@@ Property / cites work: Q5284545 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelizations for Parameterized Counting Problems
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ISAAC.2018.20
@@ Property / DOI: 10.4230/LIPICS.ISAAC.2018.20 / rank @@
+Normal rank