Short proofs for cut-and-paste sorting of permutations (Q2461214): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2007.01.011
@@ Property / DOI: 10.1016/j.disc.2007.01.011 / rank @@
-Normal rank
@@ Property / cites work @@
+Sorting by insertion of leading elements
@@ Property / cites work: Sorting by insertion of leading elements / rank @@
+Normal rank
@@ Property / cites work @@
+On the problem of sorting burnt pancakes
@@ Property / cites work: On the problem of sorting burnt pancakes / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting a bridge hand
@@ Property / cites work: Sorting a bridge hand / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for sorting by prefix reversal
@@ Property / cites work: Bounds for sorting by prefix reversal / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234063
@@ Property / cites work: Q4234063 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
+Normal rank
@@ Property / cites work @@
+On the Diameter of the Pancake Network
@@ Property / cites work: On the Diameter of the Pancake Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501812
@@ Property / cites work: Q5501812 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2007.01.011
@@ Property / DOI: 10.1016/J.DISC.2007.01.011 / rank @@
+Normal rank