default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLi Sheng 0001
Person information
- affiliation: Drexel University, Philadelphia, Department of Mathematics
Other persons with the same name
- Li Sheng — disambiguation page
- Li Sheng 0002
![[0000-0003-2940-209X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2940-209X")
— China University of Petroleum (East China), College of Information and Control Engineering, Qingdao, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j20]Ning Wang, Jie Wu, Li Sheng:
Rethink Data Forwarding in Mobile Social Networks Using Movement History Information. Ad Hoc Sens. Wirel. Networks 46(3-4): 163-188 (2020)
2010 – 2019
- 2018
- [c10]Huan Wang, Matthew T. Hueman, Qing Pan, Donald Henson, Arnold M. Schwartz, Li Sheng, Dechang Chen:
Creating Prognostic Systems by the Mann-Whitney Parameter. CHASE 2018: 33-39 - 2017
- [c9]Huan Wang, Dechang Chen, Matthew T. Hueman, Li Sheng, Donald E. Henson:
Clustering Big Cancer Data by Effect Sizes. CHASE 2017: 58-63 - 2016
- [j19]Dechang Chen, Huan Wang, Li Sheng, Matthew T. Hueman, Donald E. Henson, Arnold M. Schwartz, Jigar A. Patel:
An Algorithm for Creating Prognostic Systems for Cancer. J. Medical Syst. 40(7): 160:1-160:10 (2016) - [c8]Dechang Chen, Huan Wang, Donald E. Henson, Li Sheng, Matthew T. Hueman, Arnold M. Schwartz:
Clustering Cancer Data by Areas between Survival Curves. CHASE 2016: 61-66 - 2013
- [j18]Ran Qi, Dengyuan Wu, Li Sheng, Donald Henson, Arnold M. Schwartz, Eric Xu, Kai Xing, Dechang Chen:
On an ensemble algorithm for clustering cancer patient data. BMC Syst. Biol. 7(S-4): S9 (2013) - 2012
- [j17]Joonmo Kim, Li Sheng:
A Note on Balanced Howell Rotations for Twin Prime Power Type. Discret. Math. Algorithms Appl. 4(4) (2012)
2000 – 2009
- 2009
- [j16]David E. Brown, J. Richard Lundgren, Li Sheng:
A characterization of cycle-free unit probe interval graphs. Discret. Appl. Math. 157(4): 762-767 (2009) - 2008
- [j15]C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang:
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment. SIAM J. Comput. 38(3): 946-962 (2008) - [c7]Dechang Chen, Kai Xing, Donald Henson, Li Sheng:
Group Testing in the Development of an Expanded Cancer Staging System. ICMLA 2008: 589-594 - [c6]Dechang Chen, Kai Xing, Donald Henson, Li Sheng, Arnold M. Schwartz, Xiuzhen Cheng:
A Clustering Approach in Developing Prognostic Systems of Cancer Patients. ICMLA 2008: 723-728 - 2007
- [c5]Kai Xing, Donald Henson, Dechang Chen, Li Sheng:
A Clustering-Based Approach to Predict Outcome in Cancer Patients. ICMLA 2007: 541-546 - [c4]C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang:
Approximating the spanning star forest problem and its applications to genomic sequence alignment. SODA 2007: 645-654 - 2006
- [j14]Jennie C. Hansen, Eric Schmutz, Li Sheng:
The Expected Size of the Rule k Dominating Set. Algorithmica 46(3-4): 409-418 (2006) - 2005
- [j13]Jie Wu, Li Sheng:
Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing. J. Supercomput. 31(1): 63-78 (2005) - 2004
- [j12]Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng:
New upper and lower bounds on the channel capacity of read/write isolated memory. Discret. Appl. Math. 140(1-3): 35-48 (2004) - [i1]Jennie C. Hansen, Eric Schmutz, Li Sheng:
Probabilistic Analysis of Rule 2. CoRR cs.DM/0408068 (2004) - 2003
- [j11]Jie Wu, Li Sheng:
Deadlock-Free Routing In Irregular Networks Using Prefix Routing. Parallel Process. Lett. 13(4): 705-720 (2003) - [j10]Jian Shen, Li Sheng, Jie Wu:
Searching for Sorted Sequences of Kings in Tournaments. SIAM J. Comput. 32(5): 1201-1209 (2003) - [j9]Li Sheng:
2-Role assignments on triangulated graphs. Theor. Comput. Sci. 304(1-3): 201-214 (2003) - [j8]Li Sheng, Jie Wu:
Maximum-shortest-path (MSP) is not optimal for a general N×N torus. IEEE Trans. Reliab. 52(1): 22-25 (2003) - 2002
- [j7]Vladimir A. Gurvich, Li Sheng:
Camel sequences and quadratic residues. Discret. Appl. Math. 124(1-3): 73-89 (2002) - 2001
- [j6]Jie Wu, Li Sheng:
An efficient sorting algorithm for a sequence of kings in a tournament. Inf. Process. Lett. 79(6): 297-299 (2001) - [j5]Li Sheng, Chi Wang, Peisen Zhang:
Tagged Probe Interval Graphs. J. Comb. Optim. 5(1): 133-142 (2001) - [j4]Fred S. Roberts, Li Sheng:
How hard is it to determine if a graph has a 2-role assignment? Networks 37(2): 67-73 (2001) - [c3]Jie Wu, Li Sheng:
Deadlock-Free Prefix Multicasting in Irregular Networks. PDCS 2001: 25-30 - 2000
- [j3]Fred S. Roberts, Li Sheng:
Phylogeny numbers for graphs with two triangles. Discret. Appl. Math. 103(1-3): 191-207 (2000) - [j2]Li Sheng, Jie Wu:
A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'. IEEE Trans. Computers 49(9): 1005 (2000)
1990 – 1999
- 1999
- [c2]Li Sheng, Chi Wang, Peisen Zhang:
On the perfectness of tagged probe interval graphs. Discrete Mathematical Problems with Medical Applications 1999: 159-163 - 1998
- [j1]Fred S. Roberts, Li Sheng:
Phylogeny Numbers. Discret. Appl. Math. 87(1-3): 213-228 (1998) - 1996
- [c1]Fred S. Roberts, Li Sheng:
Phylogeny graphs of arbitrary digraphs. Mathematical Hierarchies and Biology 1996: 233-238
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 2025-05-03 01:16 CEST 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:
