Li Sheng

Ad Hoc Sens. Wirel. Networks, 2020

2018

Creating Prognostic Systems by the Mann-Whitney Parameter.

[BibT_eX]

[DOI]

Proceedings of the Third IEEE/ACM International Conference on Connected Health: Applications, 2018

2017

Clustering Big Cancer Data by Effect Sizes.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE/ACM International Conference on Connected Health: Applications, 2017

2016

An Algorithm for Creating Prognostic Systems for Cancer.

[BibT_eX]

[DOI]

J. Medical Syst., 2016

Clustering Cancer Data by Areas between Survival Curves.

[BibT_eX]

[DOI]

Proceedings of the First IEEE International Conference on Connected Health: Applications, 2016

2013

On an ensemble algorithm for clustering cancer patient data.

[BibT_eX]

[DOI]

BMC Syst. Biol., 2013

2012

A Note on Balanced Howell Rotations for Twin Prime Power Type.

[BibT_eX]

[DOI]

Joonmo Kim

Discret. Math. Algorithms Appl., 2012

2009

A characterization of cycle-free unit probe interval graphs.

[BibT_eX]

[DOI]

David E. Brown

J. Richard Lundgren

Discret. Appl. Math., 2009

2008

Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

A Clustering Approach in Developing Prognostic Systems of Cancer Patients.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Machine Learning and Applications, 2008

Group Testing in the Development of an Expanded Cancer Staging System.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Machine Learning and Applications, 2008

2007

Approximating the spanning star forest problem and its applications to genomic sequence alignment.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Clustering-Based Approach to Predict Outcome in Cancer Patients.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Machine Learning and Applications, 2007

2006

The Expected Size of the Rule k Dominating Set.

[BibT_eX]

[DOI]

Jennie C. Hansen

Eric Schmutz

Algorithmica, 2006

2005

Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing.

[BibT_eX]

[DOI]

J. Supercomput., 2005

2004

New upper and lower bounds on the channel capacity of read/write isolated memory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Probabilistic Analysis of Rule 2

[BibT_eX]

[DOI]

Jennie C. Hansen

Eric Schmutz

CoRR, 2004

2003

Maximum-shortest-path (MSP) is not optimal for a general N×N torus.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2003

2-Role assignments on triangulated graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Searching for Sorted Sequences of Kings in Tournaments.

[BibT_eX]

[DOI]

Jian Shen

SIAM J. Comput., 2003

Deadlock-Free Routing In Irregular Networks Using Prefix Routing.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2003

2002

Camel sequences and quadratic residues.

[BibT_eX]

[DOI]

Vladimir A. Gurvich

Discret. Appl. Math., 2002

2001

How hard is it to determine if a graph has a 2-role assignment?

[BibT_eX]

[DOI]

Networks, 2001

Tagged Probe Interval Graphs.

[BibT_eX]

[DOI]

Chi Wang

Peisen Zhang

J. Comb. Optim., 2001

An efficient sorting algorithm for a sequence of kings in a tournament.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Deadlock-Free Prefix Multicasting in Irregular Networks.

[BibT_eX]

Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, 2001

2000

A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2000

Phylogeny numbers for graphs with two triangles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

On the perfectness of tagged probe interval graphs.

[BibT_eX]

[DOI]

Chi Wang

Peisen Zhang

Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998

Phylogeny Numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1996

Phylogeny graphs of arbitrary digraphs.

[BibT_eX]

[DOI]