A proof of a conjecture about Dlambda-paths in graphs with large neighborhood unions. - Jianping Li 007; Feng Tian (Discret. Math., 1996)

Cycles through subsets with large degree sums. - Hajo Broersma; Hao Li 002; Jianping Li 007; Feng Tian 008; Henk Jan Veldman (Discret. Math., 1997)

Parallel Models and Job Characterization for System Scheduling. - Xiaotie Deng; Horace Ho-Shing Ip; Ken C. K. Law; Jianping Li 007; Weimin Zheng; Shanfeng Zhu (International Conference on Computational Science (2), 2001)

Cycles Containing Given Subsets in 1-Tough Graphs. - Jianping Li 007; Ruqun Shen; Feng Tian 008 (Ars Comb., 2001)

Channel Assignment in Wireless Mobile Networks with Frequency Interference Over Distance. - Hung Chim; Xiaotie Deng; Jianping Li 007; Wuyi Yue (Communications in Computing, 2003)

On Packing and Coloring Hyperedges in a Cycle. - Jianping Li 007; Kang Li; Ken C. K. Law; Hao Zhao (COCOON, 2005)

Maximizing Profits of Routing in WDM Networks. - Jianping Li 007; Kang Li; Lusheng Wang 001; Hao Zhao (J. Comb. Optim., 2005)

On the complexity of finding emerging patterns. - Lusheng Wang 001; Hao Zhao; Guozhu Dong; Jianping Li 007 (Theor. Comput. Sci., 2005)

Exact matching of RNA secondary structure patterns. - Ying Xu 002; Lusheng Wang 001; Hao Zhao; Jianping Li 007 (Theor. Comput. Sci., 2005)

Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. - Jianbo Li; Mingxia Chen; Jianping Li 007; Weidong Li 002 (COCOON, 2006)

On packing and coloring hyperedges in a cycle. - Jianping Li 007; Lusheng Wang 001; Hao Zhao (Discret. Appl. Math., 2007)

Some approximation algorithms for the clique partition problem in weighted interval graphs. - Mingxia Chen; Jianbo Li; Jianping Li 007; Weidong Li 002; Lusheng Wang 001 (Theor. Comput. Sci., 2007)

Long paths with endpoints in given vertex-subsets of graphs. - Hao Li 002; Jianping Li 007 (Discret. Math., 2008)

Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision. - Jianping Li 007; Weidong Li 002; Jianbo Li (Discret. Math. Algorithms Appl., 2009)

An improved approximation algorithm for the ATSP with parameterized triangle inequality. - Tongquan Zhang; Weidong Li 002; Jianping Li 007 (J. Algorithms, 2009)

The subdivision-constrained minimum spanning tree problem. - Jianping Li 007; Weidong Li 002; Tongquan Zhang; Zhongxu Zhang (Theor. Comput. Sci., 2009)

An improved approximation algorithm for the maximum TSP. - Tongquan Zhang; Ying Yin; Jianping Li 007 (Theor. Comput. Sci., 2010)

Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision. - Weidong Li 002; Jianping Li 007; Tongquan Zhang (Asia Pac. J. Oper. Res., 2012)

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. - Jianping Li 007; Weidong Li 002; Lusheng Wang 001 (J. Comb. Optim., 2012)

Shortest path problems with left-side time windows. - Tongquan Zhang; Ying Yin; Jianping Li 007 (Optim. Lett., 2012)

Coordination mechanism for selfish scheduling under a grade of service provision. - Li Guan; Jianping Li 007 (Inf. Process. Lett., 2013)

The Capacity Expansion Path Problem in Networks. - Jianping Li 007; Juanping Zhu (J. Appl. Math., 2013)

Approximations for two variants of the Steiner tree problem in the Euclidean plane $${ mathbb{R}^2}$$. - Jianping Li 007; Haiyan Wang; Binchao Huang; Junran Lichen (J. Glob. Optim., 2013)

Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). - Weidong Li 002; Jianping Li 007; Xuejie Zhang 002; Zhibin Chen (FAW, 2014)

Approximation algorithms for solving the constrained arc routing problem in mixed graphs. - Honglin Ding; Jianping Li 007; Ko-Wei Lih (Eur. J. Oper. Res., 2014)

Approximation algorithms for constructing some required structures in digraphs. - Jianping Li 007; Yu Ge; Shuai He; Junran Lichen (Eur. J. Oper. Res., 2014)

Approximation algorithms for the ring loading problem with penalty cost. - Weidong Li 002; Jianping Li 007; Li Guan (Inf. Process. Lett., 2014)

The subdivision-constrained routing requests problem. - Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2014)

Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. - Weidong Li 002; Jianping Li 007 (Optim. Lett., 2014)

The Directed Ring Loading with Penalty Cost. - Li Guan; Jianping Li 007; Xuejie Zhang 002; Weidong Li 002 (WALCOM, 2015)

Penalty cost constrained identical parallel machine scheduling problem. - Weidong Li 002; Jianping Li 007; Xuejie Zhang 002; Zhibin Chen (Theor. Comput. Sci., 2015)

Approximations for constructing tree-form structures using specific material with fixed length. - Jianping Li 007; Li Guan; Honglin Ding; Weidong Li 002 (Optim. Lett., 2016)

The Prize-collecting Call Control Problem on Weighted Lines and Rings. - Weidong Li 002; Jianping Li 007; Li Guan; Yaomin Shi (RAIRO Oper. Res., 2016)

The restricted minimum single source shortest path tree expansion problem. - Haiyan Wang; Weiqi Deng; Binchao Huang; Jianping Li 007 (ICIS, 2017)

Approximation Algorithms for the Generalized Stacker Crane Problem. - Jianping Li 007; Xiaofei Liu; Weidong Li 002; Li Guan; Junran Lichen (COCOA (1), 2017)

Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih (Optim. Lett., 2017)

Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines. - Bingfei Dai; Jianping Li 007; Weidong Li 002 (CSAI/ICIMT, 2018)

Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. - Junran Lichen; Jianping Li 007; Ko-Wei Lih (Inf. Process. Lett., 2018)

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (AAIM, 2019)

Improved approximation algorithms for the combination problem of parallel machine scheduling and path. - Li Guan; Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2019)

On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ2. - Junran Lichen; Jianping Li 007; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (AAIM, 2020)

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. - Jianping Li 007; Suding Liu; Junran Lichen; Wencheng Wang 003; Yujie Zheng (J. Comb. Optim., 2020)

An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem. - Jianping Li 007; Lijian Cai; Junran Lichen; Pengxiang Pan; Wencheng Wang 003; Suding Liu (AAIM, 2021)

On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${ mathbb {R}}^2$. - Jianping Li 007; Yujie Zheng; Junran Lichen; Wencheng Wang 003 (Optim. Lett., 2021)

The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (AAIM, 2022)

1-line minimum rectilinear steiner trees and related problems. - Jianping Li 007; Junran Lichen; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (J. Comb. Optim., 2022)

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. - Junran Lichen; Jianping Li 007; Ko-Wei Lih; Xingxing Yu (J. Comb. Optim., 2022)

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. - Jianping Li 007; Wencheng Wang 003; Junran Lichen; Suding Liu; Pengxiang Pan (J. Glob. Optim., 2022)

Bin packing with divisible item sizes and rejection penalties. - Jianping Li 007; Pengxiang Pan; Lijian Cai; Junran Lichen; Wencheng Wang 003 (Optim. Lett., 2022)

An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem. - Jianping Li 007; Suding Liu; Junran Lichen (COCOA (1), 2023)

The Heterogeneous Rooted Tree Cover Problem. - Pengxiang Pan; Junran Lichen; Ping Yang; Jianping Li 007 (COCOON (2), 2023)

Approximation algorithms for solving the heterogeneous Chinese postman problem. - Jianping Li 007; Pengxiang Pan; Junran Lichen; Lijian Cai; Wencheng Wang 003; Suding Liu (J. Comb. Optim., 2023)

Delay-constrained minimum shortest path trees and related problems. - Junran Lichen; Lijian Cai; Jianping Li 007; Suding Liu; Pengxiang Pan; Wencheng Wang 003 (Theor. Comput. Sci., 2023)

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties. - Jianping Li 007; Runtao Xie; Junran Lichen; Guojun Hu; Pengxiang Pan; Ping Yang (J. Comb. Optim., 2023)

Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. - Jianping Li 007; Lijian Cai; Junran Lichen; Pengxiang Pan (Optim. Lett., 2023)

On the Min-max Heterogeneous Weighted Delivery Problem. - Jianping Li 007; Ping Yang; Junran Lichen (COCOA (1), 2024)

Approximation algorithms for solving the trip-constrained vehicle routing cover problems. - Jianping Li 007; Ping Yang; Junran Lichen; Pengxiang Pan (J. Comb. Optim., 2024)

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem. - Pengxiang Pan; Junran Lichen; Jianping Li 007 (J. Glob. Optim., 2024)

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems. - Pengxiang Pan; Junran Lichen; Ping Yang; Jianping Li 007 (J. Comb. Optim., 2025)