On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Pancake problems with restricted prefix reversals and some corresponding Cayley networks
Journal of Parallel and Distributed Computing
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science
Rearrangement Models and Single-Cut Operations
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Prefix reversals on binary and ternary strings
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Fault-tolerant routing in burnt pancake graphs
Information Processing Letters
A quadratic lower bound for Topswops
Theoretical Computer Science
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
On average and highest number of flips in pancake sorting
Theoretical Computer Science
Polynomial-time sortable stacks of burnt pancakes
Theoretical Computer Science
Discrete Applied Mathematics
A routing algorithm of pairwise disjoint paths in a burnt pancake graph
Proceedings of the Second Symposium on Information and Communication Technology
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Cluster-fault-tolerant routing in burnt pancake graphs
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The (conditional) matching preclusion for burnt pancake graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |