Maximal Neighborhood Search and Rigid Interval Graphs. - Peng Li 065; Yaokun Wu (J. Graph Algorithms Appl., 2013)

A Four-Sweep LBFS Recognition Algorithm for Interval Graphs. - Peng Li 065; Yaokun Wu (Discret. Math. Theor. Comput. Sci., 2014)

A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs. - Peng Li 065; Yaokun Wu (SIAM J. Discret. Math., 2017)

The longest cycle problem is polynomial on interval graphs. - Jianhui Shang; Peng Li 065; Yi Shi (Theor. Comput. Sci., 2021)

A simple linear time algorithm to solve the MIST problem on interval graphs. - Peng Li 065; Jianhui Shang; Yi Shi (Theor. Comput. Sci., 2022)

Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs. - Peng Li 065; Aifa Wang (J. Comb. Optim., 2023)

A simple optimal algorithm for k-tuple dominating problem in interval graphs. - Peng Li 065; Aifa Wang; Jianhui Shang (J. Comb. Optim., 2023)

The k-th Roman domination problem is polynomial on interval graphs. - Peng Li 065 (J. Comb. Optim., 2024)

On the unit interval graphs which are paired k-disjoint path coverable. - Peng Li 065; Tong Liu; Yangjing Long (Discret. Math. Algorithms Appl., 2024)

The edge-vertex domination and weighted edge-vertex domination problem. - Peng Li 065; Xinyi Xue; Xingli Zhou (J. Comb. Optim., 2025)