default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianping Li 0007
Person information
- affiliation: Yunnan University, Kunming, China
Other persons with the same name
- Jianping Li (aka: Jian-Ping Li, Jian-ping Li, Jian Ping Li) — disambiguation page
- Jianping Li 0001
![[0000-0003-4976-4119]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4976-4119")
— University of Chinese Academy of Sciences, School of Public Policy and Management, Beijing, China - Jianping Li 0002 (aka: Jian Ping Li 0002, Jian-Ping Li 0002) — University of Electronic Science and Technology of China, School of Computer Science and Engineering, Chengdu, China
- Jianping Li 0003 — Zhejiang Normal University, Institute of Precision Machinery and Smart Structure, Jinhua, China
- Jianping Li 0004 — Wuhan University, State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, China
- Jianping Li 0005 — Jinan University, Provincial Key Laboratory of Optical Fiber Sensing and Communications, Guangzhou, China
- Jianping Li 0006 (aka: Jian-Ping Li 0006) — University of Bradford, Faculty of Engineering and Informatic, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j24]Li Guan, Jianping Li, Weidong Li, Junran Lichen:
Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38(3): 689-697 (2019)- [c9]Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. AAIM 2019: 192-202 - 2018
- [j23]Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. Inf. Process. Lett. 137: 11-16 (2018) - [c8]Bingfei Dai, Jianping Li, Weidong Li:
Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines. CSAI/ICIMT 2018: 609-614 - 2017
- [j22]Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. Optim. Lett. 11(8): 1663-1675 (2017) - [c7]Haiyan Wang, Weiqi Deng, Binchao Huang, Jianping Li:
The restricted minimum single source shortest path tree expansion problem. ICIS 2017: 63-68 - [c6]Jianping Li, Xiaofei Liu, Weidong Li, Li Guan, Junran Lichen:
Approximation Algorithms for the Generalized Stacker Crane Problem. COCOA (1) 2017: 95-102 - 2016
- [j21]Jianping Li, Li Guan, Honglin Ding, Weidong Li:
Approximations for constructing tree-form structures using specific material with fixed length. Optim. Lett. 10(6): 1337-1345 (2016) - [j20]Weidong Li, Jianping Li, Li Guan, Yaomin Shi:
The Prize-collecting Call Control Problem on Weighted Lines and Rings. RAIRO Oper. Res. 50(1): 39-46 (2016) - 2015
- [j19]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607: 181-192 (2015) - [c5]Li Guan, Jianping Li, Xuejie Zhang, Weidong Li:
The Directed Ring Loading with Penalty Cost. WALCOM 2015: 20-31 - 2014
- [j18]Jianping Li, Yu Ge, Shuai He, Junran Lichen:
Approximation algorithms for constructing some required structures in digraphs. Eur. J. Oper. Res. 232(2): 307-314 (2014) - [j17]Honglin Ding, Jianping Li, Ko-Wei Lih:
Approximation algorithms for solving the constrained arc routing problem in mixed graphs. Eur. J. Oper. Res. 239(1): 80-88 (2014) - [j16]Weidong Li, Jianping Li, Li Guan:
Approximation algorithms for the ring loading problem with penalty cost. Inf. Process. Lett. 114(1-2): 56-59 (2014) - [j15]Jianping Li, Weidong Li, Junran Lichen:
The subdivision-constrained routing requests problem. J. Comb. Optim. 27(1): 152-163 (2014) - [j14]Weidong Li, Jianping Li:
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. Optim. Lett. 8(3): 1093-1099 (2014) - [c4]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). FAW 2014: 158-169 - 2013
- [j13]Jianping Li, Haiyan Wang, Binchao Huang, Junran Lichen:
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$. J. Glob. Optim. 57(3): 783-801 (2013) - 2012
- [j12]Weidong Li, Jianping Li, Tongquan Zhang:
Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision. Asia Pac. J. Oper. Res. 29(5) (2012) - [j11]Jianping Li, Weidong Li, Lusheng Wang:
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. J. Comb. Optim. 24(3): 319-328 (2012) - [j10]Tongquan Zhang, Ying Yin, Jianping Li:
Shortest path problems with left-side time windows. Optim. Lett. 6(8): 1935-1943 (2012) - 2010
- [j9]Tongquan Zhang, Ying Yin, Jianping Li:
An improved approximation algorithm for the maximum TSP. Theor. Comput. Sci. 411(26-28): 2537-2541 (2010)
2000 – 2009
- 2009
- [j8]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision. Discret. Math. Algorithms Appl. 1(3): 355-368 (2009) - [j7]Tongquan Zhang, Weidong Li, Jianping Li:
An improved approximation algorithm for the ATSP with parameterized triangle inequality. J. Algorithms 64(2-3): 74-78 (2009) - [j6]Jianping Li, Weidong Li, Tongquan Zhang, Zhongxu Zhang:
The subdivision-constrained minimum spanning tree problem. Theor. Comput. Sci. 410(8-10): 877-885 (2009) - [c3]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. COCOA 2009: 1-13 - 2007
- [j5]Jianping Li, Lusheng Wang, Hao Zhao:
On packing and coloring hyperedges in a cycle. Discret. Appl. Math. 155(16): 2140-2151 (2007) - [j4]Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang:
Some approximation algorithms for the clique partition problem in weighted interval graphs. Theor. Comput. Sci. 381(1-3): 124-133 (2007) - 2006
- [c2]Jianbo Li, Mingxia Chen, Jianping Li, Weidong Li:
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. COCOON 2006: 459-468 - 2005
- [j3]Jianping Li, Kang Li, Lusheng Wang, Hao Zhao:
Maximizing Profits of Routing in WDM Networks. J. Comb. Optim. 10(2): 99-111 (2005) - [j2]Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li:
On the complexity of finding emerging patterns. Theor. Comput. Sci. 335(1): 15-27 (2005) - [j1]Ying Xu, Lusheng Wang, Hao Zhao, Jianping Li:
Exact matching of RNA secondary structure patterns. Theor. Comput. Sci. 335(1): 53-66 (2005) - 2004
- [c1]Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li:
On the Complexity of Finding Emerging Patterns. COMPSAC Workshops 2004: 126-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
