2025
HyColor: An Efficient Heuristic Algorithm for Graph Coloring.
CoRR, June, 2025
Dna coding theory and algorithms.
Artif. Intell. Rev., June, 2025
2024
A Faster Algorithm for the 4-Coloring Problem.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
A Space Efficient Algorithm for Multiset Multicover with Multiplicity Constraints Problem via Algebraic Method.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024
2022
Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
IEEE Trans. Cybern., 2022
Matrix Multiplication with Less Arithmetic Complexity and IO Complexity.
CoRR, 2022
The graph-based behavior-aware recommendation for interactive news.
Appl. Intell., 2022
A Novel Approach for Bounded Model Checking Through Full Parallelism.
Proceedings of the 22nd IEEE International Conference on Software Quality, 2022
2021
Optimizing distance constraints frequency assignment with relaxation.
RAIRO Oper. Res., 2021
A Fully Parallel Approach of Model Checking Via Probe Machine.
Int. J. Softw. Eng. Knowl. Eng., 2021
A Novel Approach of CTL Model Checking Based on Probe Machine.
Proceedings of the 33rd International Conference on Software Engineering and Knowledge Engineering, 2021
2020
A named entity topic model for news popularity prediction.
Knowl. Based Syst., 2020
AEGCN: An Autoencoder-Constrained Graph Convolutional Network.
CoRR, 2020
DNA Logic Multiplexing Using Toehold-Mediated Strand Displacement.
IEEE Access, 2020
Reluplex made more practical: Leaky ReLU.
Proceedings of the IEEE Symposium on Computers and Communications, 2020
2019
Construction of acyclically 4-colourable planar triangulations with minimum degree 4.
Int. J. Comput. Math., 2019
On graphs with the maximum edge metric dimension.
Discret. Appl. Math., 2019
2018
A topic model for co-occurring normal documents and short texts.
World Wide Web, 2018
A New Type of Graphical Passwords Based on Odd-Elegant Labelled Graphs.
Secur. Commun. Networks, 2018
Weak {2}-domination number of Cartesian products of cycles.
J. Comb. Optim., 2018
NP-completeness of local colorings of graphs.
Inf. Process. Lett., 2018
Graph Theory Towards New Graphical Passwords In Information Networks.
CoRR, 2018
The Domination Complexity and Related Extremal Values of Large 3D Torus.
Complex., 2018
On Generalized Total Graceful Labellings of Graphs.
Ars Comb., 2018
On acyclically 4-colorable maximal planar graphs.
Appl. Math. Comput., 2018
On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018
FI-GRL: Fast Inductive Graph Representation Learning via Projection-Cost Preservation.
Proceedings of the IEEE International Conference on Data Mining, 2018
2017
Fast Parallel Path Concatenation for Graph Extraction.
IEEE Trans. Knowl. Data Eng., 2017
A characterization of trees with equal independent domination and secure domination numbers.
Inf. Process. Lett., 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
On the signed Roman k-domination: Complexity and thin torus graphs.
Discret. Appl. Math., 2017
Frequency assignment problem in networks with limited spectrum.
Central Eur. J. Oper. Res., 2017
Some Cryptography Models Designed by Double Odd-Edge Labelling of Trees.
Proceedings of the 2017 IEEE International Conference on Computer and Information Technology, 2017
2016
IEEE Trans. Neural Networks Learn. Syst., 2016
Acyclic 3-coloring of generalized Petersen graphs.
J. Comb. Optim., 2016
L(2, 1)-labeling for brick product 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
Maximum Leaf Spanning Trees of Growing Sierpinski Networks Models.
CoRR, 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
New Properties and Bounds of Anti-average Numbers.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016
A Topic Model for Hierarchical Documents.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016
New Cumulative Distributions for Scale-Free Networks.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016
Exploring New Cryptographical Construction of Complex Network Data.
Proceedings of the IEEE First International Conference on Data Science in Cyberspace, 2016
Constructions of Uniquely 3-Colorable 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
Growing Network Models Having Part Edges Removed/added Randomly.
CoRR, 2015
Improper Graceful and Odd-graceful Labellings of Graph Theory.
CoRR, 2015
Rational construction of a cellular memory inverter.
Sci. China Inf. Sci., 2015
Construction of a genetic conditional learning system in Escherichia coli.
Sci. China Inf. Sci., 2015
Fast Search to Detect Communities by Truncated Inverse Page Rank in Social Networks.
Proceedings of the 2015 IEEE International Conference on Mobile Services, MS 2015, New York City, NY, USA, June 27, 2015
Evaluations and measurements of a high frequency nanocrystalline core transformer for power converters.
Proceedings of the IECON 2015, 2015
2014
A uniform framework for community detection via influence maximization in social networks.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014
Online Social Network Model Based on Local Preferential Attachment.
Proceedings of the Web Technologies and Applications, 2014
2010
Lower Bounds on Ramsey Numbers R(6, 8), R(7, 9) and R(8, 17).
Ars Comb., 2010
2009
A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding.
Comput. Math. Appl., 2009
2008
A DNA sticker algorithm for bit-substitution in a block cipher.
J. Parallel Distributed Comput., 2008
2007
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model.
Proceedings of the Theory and Applications of Models of Computation, 2007
A genetic algorithm for solving multi-constrained function optimization problems based on KS function.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007