Enqiang Zhu
Orcid: 0000-0002-5245-7905
According to our database1,
Enqiang Zhu
authored at least 54 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
ACM Trans. Knowl. Discov. Data, July, 2024
PHEE: Identifying influential nodes in social networks with a phased evaluation-enhanced search.
Neurocomputing, March, 2024
Sensors, February, 2024
Knowl. Based Syst., 2024
Improving Critical Node Detection Using Neural Network-based Initialization in a Genetic Algorithm.
CoRR, 2024
2023
iLSGRN: inference of large-scale gene regulatory networks based on multi-model fusion.
Bioinform., October, 2023
Sensors, September, 2023
Proceedings of the 2023 2nd International Symposium on Computing and Artificial Intelligence, 2023
2022
Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
IEEE Trans. Cybern., 2022
An Adaptive Repeated-Intersection-Reduction Local Search for the Maximum Independent Set Problem.
CoRR, 2022
PHEE: A phased hybrid evaluation-enhanced approach for identifying influential users in social networks.
CoRR, 2022
Characterization, verification and generation of strategies in games with resource constraints.
Autom., 2022
2021
RAIRO Oper. Res., 2021
Exploring the effects of computational costs in extensive games via modeling and simulation.
Int. J. Intell. Syst., 2021
Discuss. Math. Graph Theory, 2021
2020
J. Comb. Optim., 2020
IEEE Access, 2020
2019
Construction of acyclically 4-colourable planar triangulations with minimum degree 4.
Int. J. Comput. Math., 2019
Proceedings of the 4th International Conference on Mathematics and Artificial Intelligence, 2019
2018
IEEE Trans. Neural Networks Learn. Syst., 2018
IEEE Access, 2018
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018
Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2018
2017
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable.
Discret. Appl. Math., 2017
Appl. Math. Comput., 2017
2016
Theor. Comput. Sci., 2016
Discret. Appl. Math., 2016
Star coloring of Cartesian product of paths and cycles.
Ars Comb., 2016
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016
2015
2014
A note on the vertex-distinguishing proper edge coloring of graphs.
Ars Comb., 2014
2013
J. Appl. Math., 2013
2010
A note on the vertex-distinguishing proper total coloring of graphs.
Ars Comb., 2010
2009
Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009