An asymptotically optimal algorithm for online stacking (Q6040850): Difference between revisions

@@ Property / cites work @@
+Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
+Normal rank
@@ Property / cites work @@
+Container ship stowage problem complexity and connection to the coloring of circle graphs
+Normal rank
@@ Property / cites work @@
+On the distribution of the length of the longest increasing subsequence of random permutations
+Normal rank
@@ Property / cites work @@
+Online rules for container stacking
@@ Property / cites work: Online rules for container stacking / rank @@
+Normal rank
@@ Property / cites work @@
+Track assignment
@@ Property / cites work: Track assignment / rank @@
+Normal rank
@@ Property / cites work @@
+A note on online colouring problems in overlap graphs and their complements
+Normal rank
@@ Property / cites work @@
+On the online track assignment problem
@@ Property / cites work: On the online track assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+The mutual exclusion scheduling problem for permutation and comparability graphs.
+Normal rank
@@ Property / cites work @@
+Solutions to Real-World Instances of PSPACE-Complete Stacking
+Normal rank
@@ Property / cites work @@
+Descending subsequences of random permutations
@@ Property / cites work: Descending subsequences of random permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Tree search for the stacking problem
@@ Property / cites work: Tree search for the stacking problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of container stowage planning problems
+Normal rank