Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6972826
@@ Property / zbMATH Open document ID @@
+.68137
@@ Property / zbMATH Open document ID: 1440.68137 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/3029051
@@ Property / DOI: 10.1145/3029051 / rank @@
+Normal rank
@@ Property / published in @@
+ACM Transactions on Algorithms
@@ Property / published in: ACM Transactions on Algorithms / rank @@
+Normal rank
@@ Property / publication date @@
+November 2018Timestamp +2018-11-05T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2018-11-05T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 5 November 2018 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6972826
@@ Property / zbMATH DE Number: 6972826 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2140430392
@@ Property / OpenAlex ID: W2140430392 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bounds
@@ Property / zbMATH Keywords: lower bounds / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minor-free deletion
@@ Property / zbMATH Keywords: minor-free deletion / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+treedepth
@@ Property / zbMATH Keywords: treedepth / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579375
@@ Property / cites work: Q3579375 / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Structural Parameterizations of Pathwidth
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for the grid-minor theorem
@@ Property / cites work: Polynomial bounds for the grid-minor theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of Losing Width
@@ Property / cites work: On the Hardness of Losing Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743378
@@ Property / cites work: Q5743378 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing subgraph and minor problems: when does a small vertex cover help?
+Normal rank
@@ Property / cites work @@
+Q3113683
@@ Property / cites work: Q3113683 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Using Structural Parameters on Sparse Graph Classes
+Normal rank
@@ Property / cites work @@
+Uniform Kernelization Complexity of Hitting Forbidden Minors
+Normal rank
@@ Property / cites work @@
+Q5743381
@@ Property / cites work: Q5743381 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+A Faster Parameterized Algorithm for Treedepth
@@ Property / cites work: A Faster Parameterized Algorithm for Treedepth / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank