Enqiang Zhu

Orcid: 0000-0002-5245-7905

According to our database1, Enqiang Zhu authored at least 51 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
PHEE: Identifying influential nodes in social networks with a phased evaluation-enhanced search.
Neurocomputing, March, 2024

Playing Extensive Games with Learning of Opponent's Cognition.
Sensors, February, 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

TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.
Sensors, September, 2023

A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem.
CoRR, 2023

2022
Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
IEEE Trans. Cybern., 2022

Exact algorithms for counting 3-colorings of graphs.
Discret. Appl. Math., 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
Optimizing distance constraints frequency assignment with relaxation.
RAIRO Oper. Res., 2021

Exploring the effects of computational costs in extensive games via modeling and simulation.
Int. J. Intell. Syst., 2021

On the star chromatic index of generalized Petersen graphs.
Discuss. Math. Graph Theory, 2021

2020
Neighbor product distinguishing total colorings of 2-degenerate graphs.
J. Comb. Optim., 2020

Biochemical Logic Circuits Based on DNA Combinatorial Displacement.
IEEE Access, 2020

DNA Logic Multiplexing Using Toehold-Mediated Strand Displacement.
IEEE Access, 2020

2019
On Metric Dimension in Some Hex Derived Networks.
Sensors, 2019

Construction of acyclically 4-colourable planar triangulations with minimum degree 4.
Int. J. Comput. Math., 2019

On Upper Total Domination Versus Upper Domination in Graphs.
Graphs Comb., 2019

On graphs with the maximum edge metric dimension.
Discret. Appl. Math., 2019

On the semitotal domination number of line graphs.
Discret. Appl. Math., 2019

A New Modeling of Cooperative Agents from Game-theoretic Perspective.
Proceedings of the 4th International Conference on Mathematics and Artificial Intelligence, 2019

2018
Modeling of Agent Cognition in Extensive Games via Artificial Neural Networks.
IEEE Trans. Neural Networks Learn. Syst., 2018

Extremal problems on weak Roman domination number.
Inf. Process. Lett., 2018

NP-completeness of local colorings of graphs.
Inf. Process. Lett., 2018

On acyclically 4-colorable maximal planar graphs.
Appl. Math. Comput., 2018

Reliability and Diagnosability Analysis of Hyper Bijective Connection Networks.
IEEE Access, 2018

Independent Roman Domination Stable and Vertex-Critical Graphs.
IEEE Access, 2018

On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Metric Dimension and Robot Navigation in Specific Sensor Networks.
Proceedings of the International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2018

2017
A note on uniquely 3-colourable planar graphs.
Int. J. Comput. Math., 2017

Semitotal Domination in Claw-Free Cubic Graphs.
Graphs Comb., 2017

A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable.
Discret. Appl. Math., 2017

Computational ability in games: Individual difference and dynamics.
Appl. Math. Comput., 2017

2016
A logical characterization of extensive games with short sight.
Theor. Comput. Sci., 2016

Acyclic 3-coloring of generalized Petersen graphs.
J. Comb. Optim., 2016

Acyclically 4-colorable triangulations.
Inf. Process. Lett., 2016

On purely tree-colorable planar graphs.
Inf. Process. Lett., 2016

Size of edge-critical uniquely 3-colorable planar graphs.
Discret. Math., 2016

On dominating sets of maximal outerplanar and planar graphs.
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
Tree-core and tree-coritivity of graphs.
Inf. Process. Lett., 2015

A note on local coloring of graphs.
Inf. Process. Lett., 2015

2014
General Vertex-Distinguishing Total Coloring of Graphs.
J. Appl. Math., 2014

A note on the vertex-distinguishing proper edge coloring of graphs.
Ars Comb., 2014

Preference dynamics in games with short sight.
Appl. Math. Comput., 2014

2013
On the Domination Number of Cartesian Product of Two Directed Cycles.
J. Appl. Math., 2013

2010
A note on the vertex-distinguishing proper total coloring of graphs.
Ars Comb., 2010

2009
Adjacent Vertex Reducible Edge-Total Coloring of Graphs.
Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009


  Loading...