Wenfeng Lai

According to our database, Wenfeng Lai authored at least 9 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The longest subsequence-duplicated subsequence and related problems.

Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu

Inf. Comput., 2025

Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals.

Wenfeng Lai, Haitao Jiang, Daming Zhu, Binhai Zhu

Proceedings of the Computing and Combinatorics, 2025

2024

The longest letter-duplicated subsequence and related problems.

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Acta Informatica, September, 2024

On Sorting by Unsigned Symmetric Reversals.

Wenfeng Lai, Haitao Jiang, Daming Zhu, Binhai Zhu

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023

The Longest Subsequence-Repeated Subsequence Problem.

Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Beyond the Longest Letter-Duplicated Subsequence Problem.

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Dispersing and grouping points on planar segments.

Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou

Theor. Comput. Sci., 2021

Beyond the Longest Letter-duplicated Subsequence Problem.

Wenfeng Lai, Adiesha Liyange, Binhai Zhu, Peng Zou

CoRR, 2021

2020

Dispersing and Grouping Points on Segments in the Plane.

Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou

Proceedings of the Theory and Applications of Models of Computation, 2020