List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On sorting signed permutations by flanked DCJs | 2025-06-17 | Paper |
| A 1.375-approximation algorithm for unsigned translocation sorting Journal of Computer and System Sciences | 2020-06-09 | Paper |
| Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? Frontiers in Algorithmics | 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? Theoretical Computer Science | 2018-06-05 | Paper |
| A new approximation algorithm for unsigned translocation sorting | 2018-03-23 | Paper |
| Approximating Max NAE-\(k\)-SAT by anonymous local search Theoretical Computer Science | 2017-02-06 | Paper |
| Local search to approximate MAX NAE-k-SAT tightly Frontiers in Algorithmics | 2015-11-12 | Paper |
Research outcomes over time
This page was built for person: Lianrong Pu
