Cheng Zhao

Affiliations:
  • Indiana State University, Department of Mathematics and Computer Sciences, Terre Haute, IN, USA
  • Jilin University, Institute of Mathematics, Changchun, China (former)
  • University of Reading, Department of Mathematics, Whiteknights, UK (former)
  • West Virginia University, Department of Mathematics, Morgantown, WV, USA (former)


According to our database1, Cheng Zhao authored at least 33 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework.
Proc. VLDB Endow., April, 2024

Exploring Performance and Cost Optimization with ASIC-Based CXL Memory.
Proceedings of the Nineteenth European Conference on Computer Systems, 2024

2023
ByteGAP: A Non-continuous Distributed Graph Computing System using Persistent Memory.
Proceedings of the Joint Proceedings of Workshops at the 49th International Conference on Very Large Data Bases (VLDB 2023), Vancouver, Canada, August 28, 2023

2022
On the maxima of motzkin-straus programs and cliques of graphs.
J. Glob. Optim., 2022

2018
A continuous characterization of the maximum vertex-weighted clique in hypergraphs.
J. Comb. Optim., 2018

2017
On Motzkin-Straus type results for non-uniform hypergraphs.
J. Comb. Optim., 2017

2016
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs.
Optim. Lett., 2016

A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System.
Entropy, 2016

An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications.
Discret. Appl. Math., 2016

2015
On Lagrangians of r-uniform hypergraphs.
J. Comb. Optim., 2015

On Finding Lagrangians of 3-uniform Hypergraphs.
Ars Comb., 2015

2014
On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.
J. Optim. Theory Appl., 2014

On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges.
J. Optim. Theory Appl., 2014

Some results on Lagrangians of hypergraphs.
Discret. Appl. Math., 2014

2013
A novel image encryption-compression scheme using hyper-chaos and Chinese remainder theorem.
Signal Process. Image Commun., 2013

A Motzkin-Straus Type Result for 3-Uniform Hypergraphs.
Graphs Comb., 2013

A novel iris and chaos-based random number generator.
Comput. Secur., 2013

2009
On non-strong jumping numbers and density structures of hypergraphs.
Discret. Math., 2009

2008
Generating non-jumping numbers recursively.
Discret. Appl. Math., 2008

2007
Characterization of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2007

2005
On incomparable and uncomplemented families of sets.
Australas. J Comb., 2005

2004
An Intelligent Design Method of Product Scheme Innovation.
Proceedings of the Applied Soft Computing Technologies: The Challenge of Complexity, Proceedings of the 9th Online World Conference on Soft Computing in Industrial Applications (WSC9), September 20th, 2004

Individual Product Customization Based On Multi-agent Technology.
Proceedings of the Applied Soft Computing Technologies: The Challenge of Complexity, Proceedings of the 9th Online World Conference on Soft Computing in Industrial Applications (WSC9), September 20th, 2004

2003
The total chromatic numbers of joins of sparse graphs.
Australas. J Comb., 2003

2001
The Overfull Conjecture and the Conformability Conjecture.
Discret. Math., 2001

On a conjecture of Hilton.
Australas. J Comb., 2001

2000
Approximation Algorithms for Some Graph Partitioning Problems.
J. Graph Algorithms Appl., 2000

Estimation of the Mutation Rate During Error-prone Polymerase Chain Reaction.
J. Comput. Biol., 2000

1996
A new bound on the feedback vertex sets in cubic graphs.
Discret. Math., 1996

Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle.
Discret. Appl. Math., 1996

1994
Smallest (1, 2)-eulerian weight and shortest cycle covering.
J. Graph Theory, 1994

1993
A sufficient condition for a regular graph to be class 1.
J. Graph Theory, 1993

1992
The chromatic index of a graph whose core has maximum degree two.
Discret. Math., 1992


  Loading...