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

← Older edit Newer 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