| Publication | Date of Publication | Type |
|---|
| Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals | 2024-08-22 | Paper |
| New approximation algorithms for RNA secondary structures prediction problems by local search | 2024-02-09 | Paper |
| A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem | 2022-07-18 | Paper |
| Approximation algorithms for sorting by bounded singleton moves | 2022-05-31 | Paper |
| Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs | 2021-09-27 | Paper |
| Sorting a permutation by best short swaps | 2021-06-30 | Paper |
| On the solution bound of two-sided scaffold filling | 2021-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140777 | 2020-12-16 | Paper |
| A 1.375-approximation algorithm for unsigned translocation sorting | 2020-06-09 | Paper |
| An approximation algorithm for sorting by bounded singleton moves | 2020-02-24 | Paper |
| A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs | 2019-04-26 | Paper |
| Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling | 2019-04-26 | Paper |
| A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling | 2019-04-26 | Paper |
| Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? | 2019-04-26 | Paper |
| A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications | 2018-10-04 | Paper |
| Can a breakpoint graph be decomposed into none other than 2-cycles? | 2018-06-05 | Paper |
| A new approximation algorithm for unsigned translocation sorting | 2018-03-23 | Paper |
| A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction | 2018-02-26 | Paper |
| Improved approximation algorithm for the maximum base pair stackings problem in RNA secondary structures prediction | 2017-10-23 | Paper |
| Genomic scaffold filling revisited | 2017-10-17 | Paper |
| Competitiveness evaluation on the sci-tech human resources in China's regional central city | 2016-08-10 | Paper |
| A 1.5-approximation algorithm for two-sided scaffold filling | 2016-03-23 | Paper |
| A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations | 2015-12-08 | Paper |
| Approximation and nonapproximability for the one-sided scaffold filling problem | 2015-10-29 | Paper |
| An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves | 2015-09-11 | Paper |
| On the exact block cover problem | 2015-05-20 | Paper |
| A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations | 2014-09-02 | Paper |
| A linear kernel for the complementary maximal strip recovery problem | 2014-06-10 | Paper |
| Radiation hybrid map construction problem parameterized | 2014-02-25 | Paper |
| An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies | 2013-06-11 | Paper |
| Radiation hybrid map construction problem parameterized | 2012-11-02 | Paper |
| A linear kernel for the complementary maximal strip recovery problem | 2012-08-14 | Paper |
| A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves | 2012-08-08 | Paper |
| Minimum common string partition revisited | 2012-07-17 | Paper |
| Exact and approximation algorithms for the complementary maximal strip recovery problem | 2012-07-17 | Paper |
| Exponential and polynomial time algorithms for the minimum common string partition problem | 2011-08-12 | Paper |
| Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies | 2011-06-29 | Paper |
| A 14/11-approximation algorithm for sorting by short block-moves | 2011-06-17 | Paper |
| Minimum common string partition revisited | 2010-09-07 | Paper |
| Breakpoint Distance and PQ-Trees | 2010-07-26 | Paper |
| A linear kernel for co-path/cycle packing | 2010-07-20 | Paper |
