Heping Zhang
Orcid: 0000-0001-5385-6687
According to our database1,
Heping Zhang
authored at least 171 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Math., April, 2024
Theor. Comput. Sci., 2024
Efficient multi-scale object detection model with space-to-depth convolution and BiFPN combined with FasterNet: a high-performance model for precise steel surface defect detection.
J. Electronic Imaging, 2024
On restricted matching extension of 1-embeddable graphs in surfaces with small genus.
Discret. Math., 2024
Appl. Math. Comput., 2024
2023
Comput. J., December, 2023
Discret. Appl. Math., October, 2023
J. Comb. Optim., September, 2023
J. Comb. Optim., May, 2023
J. Supercomput., March, 2023
J. Supercomput., 2023
Discret. Appl. Math., 2023
A Consistent and Scalable Algorithm for Best Subset Selection in Single Index Models.
CoRR, 2023
Identification of Key Nodes in Complex Networks Based on Network Representation Learning.
IEEE Access, 2023
2022
J. Comb. Optim., 2022
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
The Star-Structure Connectivity and Star-Substructure Connectivity of Hypercubes and Folded Hypercubes.
Comput. J., 2022
Super-taxon in human microbiome are identified to be associated with colorectal cancer.
BMC Bioinform., 2022
iProbiotics: a machine learning platform for rapid identification of probiotic properties from whole-genome primary sequences.
Briefings Bioinform., 2022
Appl. Math. Comput., 2022
2021
Discret. Appl. Math., 2021
Contributions Discret. Math., 2021
Issues of Z-factor and an approach to avoid them for quality control in high-throughput screening studies.
Bioinform., 2021
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l<sub>∞ </sub>-norm.
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
J. Glob. Optim., 2020
J. Comb. Optim., 2020
2019
J. Interconnect. Networks, 2019
Bioinform., 2019
2018
Int. J. Comput. Math. Comput. Syst. Theory, 2018
Int. J. Comput. Math., 2018
Discuss. Math. Graph Theory, 2018
Discret. Appl. Math., 2018
Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures.
Discret. Appl. Math., 2018
Ars Math. Contemp., 2018
Construction for Trees without vertices contained in all minimum dominating sets.
Ars Comb., 2018
Proceedings of the Bio-inspired Computing: Theories and Applications, 2018
2017
Discret. Math. Theor. Comput. Sci., 2017
Discuss. Math. Graph Theory, 2017
Discret. Appl. Math., 2017
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs.
Discret. Appl. Math., 2017
Discret. Appl. Math., 2017
Bioinform., 2017
2016
Int. J. Comput. Math. Comput. Syst. Theory, 2016
The restricted edge-connectivity and restricted connectivity of augmented <i>k</i>-ary <i>n</i>-cubes.
Int. J. Comput. Math., 2016
The bondage number of the strong product of a complete graph with a path and a special starlike tree.
Discret. Math. Algorithms Appl., 2016
Discret. Appl. Math., 2016
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges.
Discret. Appl. Math., 2016
Appl. Math. Comput., 2016
Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial.
Appl. Math. Comput., 2016
2015
Theor. Comput. Sci., 2015
Computing Affine Combinations, Distances, and Correlations for Recursive Partition Functions.
CoRR, 2015
Bioinform., 2015
Some analytical properties of the permanental polynomial of a graph.
Ars Comb., 2015
Two types of matchings extend to Hamiltonian cycles in hypercubes.
Ars Comb., 2015
Australas. J Comb., 2015
2014
J. Appl. Math., 2014
Discuss. Math. Graph Theory, 2014
Discret. Math., 2014
Electron. J. Comb., 2014
Fibonacci (p, r)-cubes which are partial cubes.
Ars Comb., 2014
5-factor-critical graphs on the torus.
Ars Comb., 2014
2013
NeuroImage, 2013
Discret. Math., 2013
Discret. Appl. Math., 2013
2012
Discret. Math., 2012
Discret. Appl. Math., 2012
2011
WIREs Data Mining Knowl. Discov., 2011
Sex differences in grey matter atrophy patterns among AD and aMCI patients: Results from ADNI.
NeuroImage, 2011
Discret. Math., 2011
Discret. Appl. Math., 2011
Discret. Appl. Math., 2011
l<sub>1</sub>-Embeddability of Hexagonal and Quadrilateral Mobius graphs.
Ars Comb., 2011
On Diameter Stability of the Johnson Graph.
Ars Comb., 2011
2010
Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph.
Order, 2010
Discret. Math., 2010
2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes.
Discret. Appl. Math., 2010
A note on path factors in claw-free graphs.
Ars Comb., 2010
Smallest generalized cuts and diameter-increasing sets of Johnson graphs.
Ars Comb., 2010
2009
Discret. Math., 2009
Degree conditions for graphs to be lambda<sub>3</sub>-optimal and super-lambda<sub>3</sub>.
Discret. Math., 2009
Discret. Appl. Math., 2009
BMC Bioinform., 2009
The Laplacian spectral radius of unicyclic graphs with k pendent vertices.
Ars Comb., 2009
A Note on Path-Matchings.
Ars Comb., 2009
2008
Theor. Comput. Sci., 2008
SIAM J. Discret. Math., 2008
Discret. Math., 2008
Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system.
Discret. Appl. Math., 2008
Discret. Appl. Math., 2008
Discret. Appl. Math., 2008
Bioinform., 2008
2007
Sufficient conditions for graphs to be <i>lambda'</i>-optimal and super-<i>lambda'</i>.
Networks, 2007
Resonance of Plane Bipartite Graphs.
Ars Comb., 2007
2006
Discret. Math., 2006
2005
Case Report: A High Productivity/Low Maintenance Approach to High-performance Computation for Biomedicine: Four Case Studies.
J. Am. Medical Informatics Assoc., 2005
k-factor-covered Regular Graphs.
Ars Comb., 2005
Proceedings of the Discrete Geometry, 2005
2004
Discret. Math., 2004
Discret. Appl. Math., 2004
Correcting the loss of cell-cycle synchrony in clustering analysis of microarray data using weights.
Bioinform., 2004
Appl. Math. Lett., 2004
2003
Order, 2003
Cell rotation graphs of strongly connected orientations of plane graphs with an application.
Discret. Appl. Math., 2003
2000
Electron. Notes Discret. Math., 2000
1999
Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs.
Ars Comb., 1999
1997
The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials.
Discret. Math., 1997
Discret. Appl. Math., 1997
Discret. Appl. Math., 1997
1996
Discret. Math., 1996
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph.
Discret. Math., 1996
1993