Huiqing Liu

Orcid: 0000-0001-6703-000X

According to our database1, Huiqing Liu authored at least 62 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On strong edge-coloring of graphs with maximum degree 5.
Discret. Appl. Math., February, 2024

2023
Anti-Ramsey problems in the Mycielskian of a cycle.
Appl. Math. Comput., December, 2023

The maximum number of short paths in a Halin graph.
Discret. Optim., November, 2023

Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index.
Appl. Math. Comput., September, 2023

2022
Injective Edge Coloring for Graphs with Small Edge Weight.
Graphs Comb., 2022

Anti-Ramsey numbers for cycles in n-prisms.
Discret. Appl. Math., 2022

On the global strong resilience of fault Hamiltonian graphs.
Appl. Math. Comput., 2022

Anti-Ramsey numbers for cycles in the generalized Petersen graphs.
Appl. Math. Comput., 2022

2021
Bicyclic graphs with extremal cover cost.
Appl. Math. Comput., 2021

On the Path Cover Number of Connected Quasi-Claw-Free Graphs.
IEEE Access, 2021

2020
On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model.
Int. J. Found. Comput. Sci., 2020

Hamiltonicity of edge-chromatic critical graphs.
Discret. Math., 2020

Burning number of caterpillars.
Discret. Appl. Math., 2020

The g-Good-Neighbor Conditional Diagnosability of Locally Exchanged Twisted Cubes.
Comput. J., 2020

2019
Hybrid fault diagnosis capability analysis of triangle-free graphs.
Theor. Comput. Sci., 2019

On <i>g</i>-extra conditional diagnosability of hierarchical cubic networks.
Theor. Comput. Sci., 2019

Structure connectivity and substructure connectivity of twisted hypercubes.
Theor. Comput. Sci., 2019

基于贝叶斯网的短文本特征扩展方法 (Short Text Feature Extension Method Based on Bayesian Networks).
计算机科学, 2019

Fractional matching preclusion of the restricted HL-graphs.
J. Comb. Optim., 2019

Average degrees of edge-chromatic critical graphs.
Discret. Math., 2019

Hamiltonian cycles and paths in faulty twisted hypercubes.
Discret. Appl. Math., 2019

DeepACLSTM: deep asymmetric convolutional long short-term memory neural models for protein secondary structure prediction.
BMC Bioinform., 2019

Burning number of theta graphs.
Appl. Math. Comput., 2019

2018
On the spectral moments of signless Laplacian matrix of trees and unicyclic graphs.
Ars Comb., 2018

The <i>g</i>-good neighbor conditional diagnosability of twisted hypercubes under the PMC and MM* model.
Appl. Math. Comput., 2018

2017
A Spatial and Temporal Nonlocal Filter-Based Data Fusion Method.
IEEE Trans. Geosci. Remote. Sens., 2017

An empirical correlation to predict the SAGD recovery performance.
J. Comput. Methods Sci. Eng., 2017

2016
A Spatial and Temporal Non-Local Filter Based Data Fusion.
CoRR, 2016

2015
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs.
Discret. Appl. Math., 2015

2014
Degree Conditions for Spanning Brooms.
J. Graph Theory, 2014

Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults.
Discret. Appl. Math., 2014

2013
The (conditional) matching preclusion for burnt pancake graphs.
Discret. Appl. Math., 2013

2012
A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices.
Ars Comb., 2012

2011
Sharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameter.
Appl. Math. Lett., 2011

The spectral moments of trees with given maximum degree.
Appl. Math. Lett., 2011

2010
Identifying mRNA targets of microRNA dysregulated in cancer: with application to clear cell Renal Cell Carcinoma.
BMC Syst. Biol., 2010

Application of fuzzy matter-element model in scheme selection of cooling and heating sources for air-conditioning.
Proceedings of the Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010

2009
An improved upper bound for the Laplacian spectral radius of graphs.
Discret. Math., 2009

Analyses of domains and domain fusions in human proto-oncogenes.
BMC Bioinform., 2009

2008
RNACluster: An integrated tool for RNA secondary structure comparison and clustering.
J. Comput. Chem., 2008

2007
Laplacian spectral bounds for clique and independence numbers of graphs.
J. Comb. Theory, Ser. B, 2007

Relative Length of Longest Paths and Cycles in Graphs.
Graphs Comb., 2007

2006
Trees of extremal connectivity index.
Discret. Appl. Math., 2006

2005
Two sufficient conditions for dominating cycles.
J. Graph Theory, 2005

Fan-Type Theorem for Long Cycles Containing a Specified Edge.
Graphs Comb., 2005

Use of extreme patient samples for outcome prediction from gene expression data.
Bioinform., 2005

DNAFSMiner: a web-based software toolbox to recognize two types of functional sites in DNA sequences.
Bioinform., 2005

Diagnostic Rules Induced by an Ensemble Method for Childhood Leukemia.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

2004
Using amino acid patterns to accurately predict translation initiation sites.
Silico Biol., 2004

Neighborhood unions and cyclability of graphs.
Discret. Appl. Math., 2004

Selection of Patient Samples and Genes for Outcome Prediction.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Use of Built-in Features in the Interpretation of High-dimensional Cancer Diagnosis Data..
Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

2003
Data Mining Tools for Biological Sequences.
J. Bioinform. Comput. Biol., 2003

Simple rules underlying gene expression profiles of more than six subtypes of acute lymphoblastic leukemia (ALL) patients.
Bioinform., 2003

Minimally (k, k-1)-edge-connected graphs.
Australas. J Comb., 2003

Mean-entropy discretized features are effective for classifying high-dimensional biomedical data.
Proceedings of the 3nd ACM SIGKDD Workshop on Data Mining in Bioinformatics (BIOKDD 2003), 2003

Ensembles of Cascading Trees.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Discovery of significant rules for classifying cancer diagnosis data.
Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003

2002
A Knowledge Object Oriented System for High Throughput Collection and Analysis of Data.
Proceedings of the ICEIS 2002, 2002

2000
Discovering Structural Association of Semistructured Data.
IEEE Trans. Knowl. Data Eng., 2000

1998
Discovering Typical Structures of Documents: A Road Map Approach.
Proceedings of the SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1998

1997
Schema Discovery for Semistructured Data.
Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997


  Loading...