Peng Li

According to our database, Peng Li authored at least 10 papers between 2013 and 2025.

Collaborative distances:

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

2025

The edge-vertex domination and weighted edge-vertex domination problem.

Peng Li, Xinyi Xue, Xingli Zhou

J. Comb. Optim., March, 2025

2024

On the unit interval graphs which are paired k-disjoint path coverable.

Peng Li, Tong Liu, Yangjing Long

Discret. Math. Algorithms Appl., November, 2024

The k-th Roman domination problem is polynomial on interval graphs.

Peng Li

J. Comb. Optim., October, 2024

2023

A simple optimal algorithm for k-tuple dominating problem in interval graphs.

Peng Li, Aifa Wang, Jianhui Shang

J. Comb. Optim., 2023

Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs.

Peng Li, Aifa Wang

J. Comb. Optim., 2023

2022

A simple linear time algorithm to solve the MIST problem on interval graphs.

Peng Li, Jianhui Shang, Yi Shi

Theor. Comput. Sci., 2022

2021

The longest cycle problem is polynomial on interval graphs.

Jianhui Shang, Peng Li, Yi Shi

Theor. Comput. Sci., 2021

2017

A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs.

Peng Li, Yaokun Wu

SIAM J. Discret. Math., 2017

2014

A Four-Sweep LBFS Recognition Algorithm for Interval Graphs.

Peng Li, Yaokun Wu

Discret. Math. Theor. Comput. Sci., 2014

2013

Maximal Neighborhood Search and Rigid Interval Graphs.

Peng Li, Yaokun Wu

J. Graph Algorithms Appl., 2013