On the parametric complexity of schedules to minimize tardy tasks. (Q1874274): Difference between revisions

@@ Property / Wikidata QID @@
+Q57360052
@@ Property / Wikidata QID: Q57360052 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear extensions of random orders
@@ Property / cites work: Linear extensions of random orders / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of short computation and factorization
+Normal rank
@@ Property / cites work @@
+Advice classes of parametrized tractability
@@ Property / cites work: Advice classes of parametrized tractability / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank