Personal Information

Professor

Paper Publications

[1] 王雨阳. Minimize Maximum Coverage of Fragment Alignment Selection. 2023.
[2] 周培衍. Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. Theoretical Computer Science, 888, 22-30, 2021.
[3] 蒲莲蓉. Can a breakpoint graph be decomposed into none other than 2-cycles?. Theoretical Computer Science, 2018.
[4] 周培衍. Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. Theoretical Computer Science, 888, 22, 2021.
[5] 张舒. Sorting a Permutation by Best Short Swaps. Algorithmica (New York), 2021.
[6] 马静静. On the solution bound of two-sided scaffold filling. Theoretical Computer Science, 873, 47, 2021.
[7] 蒲莲容. A 1.375-approximation algorithm for unsigned translocation sorting. Journal of Computer and System Sciences, 113, 163, 2020.
[8] 刘李鑫. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding. 27, 200, 2020.
[9] 姜海涛. Breakpoint distance and PQ-trees. INFORMATION AND COMPUTATION, 275, 2020.
[10] zhudaming and jianghaitao. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding. 2019.

total59 1/6

firstpreviousnext last Page

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click:Times MOBILE Version
The Founding Time : ..
The Last Update Time : ..

Mobile phone sweep

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

Personal Information

Paper Publications