Shenwei Huang

Orcid: 0000-0002-0287-4591

According to our database1, Shenwei Huang authored at least 53 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The saturation number of <i>K</i><sub>3,3</sub>.
Discret. Math., March, 2024

Coloring (P5, kite)-free graphs with small cliques.
Discret. Appl. Math., February, 2024

2023
Vertex-critical (P5,chair)-free graphs.
Discret. Appl. Math., December, 2023

Critical (P5, bull)-free graphs.
Discret. Appl. Math., July, 2023

Some results on k-critical P5-free graphs.
Discret. Appl. Math., July, 2023

Complexity of <i>C</i><sub><i>k</i></sub>-coloring in hereditary classes of graphs.
Inf. Comput., June, 2023

A Note on the Rank of Inclusion Matrices.
Graphs Comb., April, 2023

Colouring graphs with no induced six-vertex path or diamond.
Theor. Comput. Sci., 2023

Critical (P<sub>5,dart)</sub>-Free Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
An Exploration Study on the Consequence of the COVID-19 Pandemic on Online Q&A Communities.
J. Glob. Inf. Manag., 2022

HDMC: a novel deep learning-based framework for removing batch effects in single-cell RNA-seq data.
Bioinform., 2022

LR-GNN: a graph neural network based on link representation for predicting molecular associations.
Briefings Bioinform., 2022

2021
<i>k</i>-Critical graphs in <i>P</i><sub>5</sub>-free graphs.
Theor. Comput. Sci., 2021

A Confidence-Guided Evaluation for Log Parsers Inner Quality.
Mob. Networks Appl., 2021

On graphs with no induced five-vertex path or paraglider.
J. Graph Theory, 2021

An optimal χ -bound for ( P 6 , diamond)-free graphs.
J. Graph Theory, 2021

Some Results on k-Critical P<sub>5</sub>-Free Graphs.
CoRR, 2021

Square-Free Graphs with no Induced Fork.
Electron. J. Comb., 2021

List 3-Coloring Graphs with No Induced P<sub>6+rP<sub>3</sub></sub>.
Algorithmica, 2021

2020
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness.
J. Graph Theory, 2020

k-Critical Graphs in P<sub>5</sub>-Free Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
(2P<sub>2, K<sub>4)</sub></sub>-Free Graphs are 4-Colorable.
SIAM J. Discret. Math., 2019

Linearly χ-bounding (P6, C4)-free graphs.
J. Graph Theory, 2019

Colouring square-free graphs without long induced paths.
J. Comput. Syst. Sci., 2019

Bounding clique-width via perfect graphs.
J. Comput. Syst. Sci., 2019

Critical (P6, banner)-free graphs.
Discret. Appl. Math., 2019

A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems.
CoRR, 2019

Graphs without five-vertex path and four-vertex cycle.
Appl. Math. Comput., 2019

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Complexity of C<sub>k</sub>-Coloring in Hereditary Classes of Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

A Confidence-Guided Anomaly Detection Approach Jointly Using Multiple Machine Learning Algorithms.
Proceedings of the Cyberspace Safety and Security - 11th International Symposium, 2019

2018
Structure and algorithms for (cap, even hole)-free graphs.
Discret. Math., 2018

An Optimal χ-Bound for (P<sub>6</sub>, diamond)-Free Graphs.
CoRR, 2018

On the Complexity of Extended and Proportional Justified Representation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.
J. Graph Theory, 2017

Complexity of coloring graphs without paths and cycles.
Discret. Appl. Math., 2017

Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs.
CoRR, 2017

A Polynomial-time Algorithm to Achieve Extended Justified Representation.
CoRR, 2017

Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
Improved complexity results on k-coloring P<sub>t</sub>-free graphs.
Eur. J. Comb., 2016

Computational Complexity of Testing Proportional Justified Representation.
CoRR, 2016

2015
Bounding the Clique-Width of H-free Split Graphs.
Electron. Notes Discret. Math., 2015

A note on coloring (even-hole, cap)-free graphs.
CoRR, 2015

Narrowing the Complexity Gap for Colouring (<i>C<sub>s</sub>, P<sub>t</sub></i>)-Free Graphs.
Comput. J., 2015

P300 and Decision Making under Risk and Ambiguity.
Comput. Intell. Neurosci., 2015

Bounding the Clique-Width of H-free Chordal Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs.
CoRR, 2014

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Paired-Domination in Claw-Free Graphs.
Graphs Comb., 2013

Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs
CoRR, 2013

Improved Complexity Results on k-Coloring P t -Free Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Perfect matchings in paired domination vertex critical graphs.
J. Comb. Optim., 2012

2011
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
Networks, 2011


  Loading...