| Approximation algorithms for sorting permutations by extreme block-interchanges | 0 | 0.34 | 2021 |
| Improved upper bound for sorting permutations by prefix transpositions | 0 | 0.34 | 2021 |
| Sorting permutations with transpositions in () amortized time. | 0 | 0.34 | 2019 |
| Sorting permutations with a transposition tree | 0 | 0.34 | 2018 |
| Layered Graphs: Applications and Algorithms. | 0 | 0.34 | 2018 |
| Scheduling Applications Of Dags | 0 | 0.34 | 2018 |
| Counting Chemical Structures Resembling Trees | 0 | 0.34 | 2018 |
| Layered graphs: a class that admits polynomial time solutions for some hard problems. | 0 | 0.34 | 2017 |
| Adjacencies in Permutations. | 0 | 0.34 | 2016 |
| Tighter upper bound for sorting permutations with prefix transpositions. | 1 | 0.36 | 2015 |
| Upper Bounds For Sorting Permutations With A Transposition Tree | 4 | 0.46 | 2013 |
| Upper Bounds For Sorting Permutations With A Transposition Tree (Vol 5, 1350003, 2013) | 0 | 0.34 | 2013 |
| Self consistency grouping: a stringent clustering method. | 6 | 0.37 | 2012 |
| Prediction of candidate genes for neuropsychiatric disorders using feature-based enrichment | 4 | 0.44 | 2012 |
| A Note On Complexity Of Genetic Mutations | 4 | 0.45 | 2011 |
| On Complexity of Transforming Strings | 0 | 0.34 | 2010 |
| Prefix Reversals on Strings | 2 | 0.40 | 2010 |
| ProSMoS server: a pattern-based search using interaction matrix representation of protein structures. | 13 | 0.79 | 2009 |
| Sorting circular permutations by bounded transpositions. | 8 | 0.79 | 2009 |
| Adjacent Swaps on Strings | 3 | 0.44 | 2008 |
| Bounding prefix transposition distance for strings and permutations | 12 | 0.70 | 2008 |
