2022
Building and Checking Suffix Array Simultaneously by Induced Sorting Method.
IEEE Trans. Computers, 2022
2021
An Assessment Framework for Online Active Learning Performance.
Proceedings of the Blended Learning: Re-thinking and Re-defining the Learning Process., 2021
2019
Top K representative: a method to select representative samples based on K nearest neighbors.
Int. J. Mach. Learn. Cybern., 2019
The edge coloring game on trees with the number of colors greater than the game chromatic index.
J. Comb. Optim., 2019
Segment-Level Joint Topic-Sentiment Model for Online Review Analysis.
IEEE Intell. Syst., 2019
2018
Fast induced sorting suffixes on a multicore machine.
J. Supercomput., 2018
Fast In-Place Suffix Sorting on a Multicore Computer.
IEEE Trans. Computers, 2018
Limited resource semiquantum secret sharing.
Quantum Inf. Process., 2018
The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices.
J. Comb. Optim., 2018
A Clustering Based Adaptive Sequence-to-Sequence Model for Dialogue Systems.
Proceedings of the 2018 IEEE International Conference on Big Data and Smart Computing, 2018
2017
Checking Big Suffix and LCP Arrays by Probabilistic Methods.
IEEE Trans. Computers, 2017
Scalable K-Order LCP Array Construction for Massive Data.
Proceedings of the Parallel Architecture, Algorithm and Programming, 2017
An Explicit Learner Profiling Model for Personalized Word Learning Recommendation.
Proceedings of the Emerging Technologies for Education - Second International Symposium, 2017
A new samples selecting method based on K nearest neighbors.
Proceedings of the 2017 IEEE International Conference on Big Data and Smart Computing, 2017
2016
Improving a lightweight LZ77 computation algorithm for running faster.
Softw. Pract. Exp., 2016
Complete forcing numbers of primitive coronoids.
J. Comb. Optim., 2016
2015
Induced Sorting Suffixes in External Memory.
ACM Trans. Inf. Syst., 2015
Induced Sorting Suffixes in External Memory with Better Design and Less Space.
Proceedings of the String Processing and Information Retrieval, 2015
2014
Suffix Array Construction in External Memory Using D-Critical Substrings.
ACM Trans. Inf. Syst., 2014
The game chromatic index of some trees of maximum degree 4.
Discret. Appl. Math., 2014
Characterization of 3-Regular Halin Graphs with Edge-face Total Chromatic Number Equal to Four.
Ars Comb., 2014
2013
Efficient arbitrated quantum signature and its proof of security.
Quantum Inf. Process., 2013
The strong game colouring number of directed graphs.
Discret. Math., 2013
2012
On the impossibility of non-static quantum bit commitment between two parties.
Quantum Inf. Process., 2012
2011
Two Efficient Algorithms for Linear Time Suffix Array Construction.
IEEE Trans. Computers, 2011
Computing the inverse sort transform in linear time.
ACM Trans. Algorithms, 2011
Sharing a quantum secret without a trusted party.
Quantum Inf. Process., 2011
2010
Triangle-free graphs with large independent domination number.
Discret. Optim., 2010
Uniformly pair-bonded trees.
Ars Comb., 2010
On the spectra of the fullerenes that contain a nontrivial cyclic-5-cutset.
Australas. J Comb., 2010
2009
Edge-Face Total Chromatic Number of Halin Graphs.
SIAM J. Discret. Math., 2009
Linear Suffix Array Construction by Almost Pure Induced-Sorting.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009
Linear Time Suffix Array Construction Using D-Critical Substrings.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009
2008
Cyclic bandwidth with an edge added.
Discret. Appl. Math., 2008
Upper bounds on the paired-domination number.
Appl. Math. Lett., 2008
Computing Inverse ST in Linear Complexity.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008
2002
Characterization of graphs with equal bandwidth and cyclic bandwidth.
Discret. Math., 2002
1997
On the bandwidth of convex triangulation meshes.
Discret. Math., 1997
On Bandwidth and Cyclic Bandwidth of Graphs.
Ars Comb., 1997