Peng Li

11 papers C 1Journal 10
YearRankTypeTitle / Venue / Authors
2025 J jnl
The edge-vertex domination and weighted edge-vertex domination problem.
J. Comb. Optim.
Peng Li, Xinyi Xue, Xingli Zhou
2024 J jnl
On the unit interval graphs which are paired k-disjoint path coverable.
Discret. Math. Algorithms Appl.
Peng Li, Tong Liu, Yangjing Long
2024 J jnl
The k-th Roman domination problem is polynomial on interval graphs.
J. Comb. Optim.
Peng Li
2023 J jnl
A simple optimal algorithm for k-tuple dominating problem in interval graphs.
J. Comb. Optim.
Peng Li, Aifa Wang, Jianhui Shang
2023 J jnl
Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs.
J. Comb. Optim.
Peng Li, Aifa Wang
2022 J jnl
A simple linear time algorithm to solve the MIST problem on interval graphs.
Theor. Comput. Sci.
Peng Li, Jianhui Shang, Yi Shi
2022 C conf
Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs.
AAIM
Peng Li, Aifa Wang
2021 J jnl
The longest cycle problem is polynomial on interval graphs.
Theor. Comput. Sci.
Jianhui Shang, Peng Li, Yi Shi
2017 J jnl
A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs.
SIAM J. Discret. Math.
Peng Li, Yaokun Wu
2014 J jnl
A Four-Sweep LBFS Recognition Algorithm for Interval Graphs.
Discret. Math. Theor. Comput. Sci.
Peng Li, Yaokun Wu
2013 J jnl
Maximal Neighborhood Search and Rigid Interval Graphs.
J. Graph Algorithms Appl.
Peng Li, Yaokun Wu