Lianrong Pu

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 10

Top Topics

Polygonal Approximation

Graph Construction

Stochastic Local Search Algorithms

Top Venues

Theor. Comput. Sci.

EURASIP J. Wirel. Commun. Netw.

J. Comput. Syst. Sci.

Publications

Abel C. H. Chen, Wen-Kang Jia, Feng-Jang Hwang, Genggeng Liu, Fangying Song, Lianrong Pu
Machine learning and deep learning methods for wireless network applications. EURASIP J. Wirel. Commun. Netw. 2022 (1) (2022)
Chi-Hua Chen, Kuo-Ming Chao, Feng-Jang Hwang, Chunjia Han, Lianrong Pu
Editorial. Int. J. Distributed Sens. Networks 17 (2) (2021)
Jinhao Zhang, Zehua Zhang, Lianrong Pu, Jijun Tang, Fei Guo
AIEpred: An Ensemble Predictive Model of Classifier Chain to Identify Anti-Inflammatory Peptides. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (5) (2021)
Yael Ben-Ari, Dan Flomin, Lianrong Pu, Yaron Orenstein, Ron Shamir
Improving the efficiency of de Bruijn graph construction using compact universal hitting sets. BCB (2021)
Lianrong Pu, Daming Zhu, Haitao Jiang
A 1.375-approximation algorithm for unsigned translocation sorting. J. Comput. Syst. Sci. 113 (2020)
Lianrong Pu, Yu Lin, Daming Zhu, Haitao Jiang
Can a breakpoint graph be decomposed into none other than 2-cycles? Theor. Comput. Sci. 734 (2018)
Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff, Binhai Zhu
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. COCOON (2018)
Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu, Hong Liu
Approximating Max NAE-k-SAT by anonymous local search. Theor. Comput. Sci. 657 (2017)
Lianrong Pu, Haitao Jiang
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? FAW (2016)
Lianrong Pu, Daming Zhu, Haitao Jiang
A New Approximation Algorithm for Unsigned Translocation Sorting. WABI (2016)
Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu
Local Search to Approximate Max NAE- k k -Sat Tightly. FAW (2015)