A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. - Shenwei Huang; Erfang Shan (Networks, 2011)

Perfect matchings in paired domination vertex critical graphs. - Shenwei Huang; Erfang Shan; Liying Kang (J. Comb. Optim., 2012)

Improved Complexity Results on k-Coloring P t -Free Graphs. - Shenwei Huang (MFCS, 2013)

Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs - Shenwei Huang (CoRR, 2013)

Paired-Domination in Claw-Free Graphs. - Shenwei Huang; Liying Kang; Erfang Shan (Graphs Comb., 2013)

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (AAIM, 2014)

Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (CoRR, 2014)

Bounding the Clique-Width of H-free Chordal Graphs. - Andreas Brandstädt; Konrad K. Dabrowski; Shenwei Huang; Daniël Paulusma (MFCS (2), 2015)

P300 and Decision Making under Risk and Ambiguity. - Lei Wang 164; Jiehui Zheng; Shenwei Huang; Haoye Sun (Comput. Intell. Neurosci., 2015)

Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (Comput. J., 2015)

A note on coloring (even-hole, cap)-free graphs. - Shenwei Huang; Murilo V. G. da Silva (CoRR, 2015)

Computational Complexity of Testing Proportional Justified Representation. - Haris Aziz 001; Shenwei Huang (CoRR, 2016)

Bounding the clique-width of H-free split graphs. - Andreas Brandstädt; Konrad K. Dabrowski; Shenwei Huang; Daniël Paulusma (Discret. Appl. Math., 2016)

Improved complexity results on k-coloring Pt-free graphs. - Shenwei Huang (Eur. J. Comb., 2016)

Linearly chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. - Serge Gaspers; Shenwei Huang (WG, 2017)

A Polynomial-time Algorithm to Achieve Extended Justified Representation. - Haris Aziz 001; Shenwei Huang (CoRR, 2017)

Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. - Serge Gaspers; Shenwei Huang (CoRR, 2017)

Complexity of coloring graphs without paths and cycles. - Pavol Hell; Shenwei Huang (Discret. Appl. Math., 2017)

Bounding the Clique-Width of H-Free Chordal Graphs. - Andreas Brandstädt; Konrad Kazimierz Dabrowski; Shenwei Huang; Daniël Paulusma (J. Graph Theory, 2017)

On the Complexity of Extended and Proportional Justified Representation. - Haris Aziz 001; Edith Elkind; Shenwei Huang; Martin Lackner; Luis Sánchez Fernández 001; Piotr Skowron 001 (AAAI, 2018)

An Optimal χ-Bound for (P6, diamond)-Free Graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (CoRR, 2018)

Structure and algorithms for (cap, even hole)-free graphs. - Kathie Cameron; Murilo V. G. da Silva; Shenwei Huang; Kristina Vuskovic (Discret. Math., 2018)

A Confidence-Guided Anomaly Detection Approach Jointly Using Multiple Machine Learning Algorithms. - Xueshuo Xie; Zongming Jin; Qingqi Han; Shenwei Huang; Tao Li 022 (CSS (2), 2019)

Complexity of Ck-Coloring in Hereditary Classes of Graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (ESA, 2019)

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. - Qingqiong Cai; Shenwei Huang; Tao Li 022; Yongtang Shi (FAW, 2019)

Graphs without five-vertex path and four-vertex cycle. - Shujuan Cao; Shenwei Huang (Appl. Math. Comput., 2019)

A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems. - Xueshuo Xie; Zhi Wang 014; Xuhang Xiao; Lei Yang; Shenwei Huang; Tao Li 022 (CoRR, 2019)

Critical (P6, banner)-free graphs. - Shenwei Huang; Tao Li 022; Yongtang Shi (Discret. Appl. Math., 2019)

Bounding clique-width via perfect graphs. - Konrad K. Dabrowski; Shenwei Huang; Daniël Paulusma (J. Comput. Syst. Sci., 2019)

Colouring square-free graphs without long induced paths. - Serge Gaspers; Shenwei Huang; Daniël Paulusma (J. Comput. Syst. Sci., 2019)

Linearly χ-bounding (P6, C4)-free graphs. - Serge Gaspers; Shenwei Huang (J. Graph Theory, 2019)

(2P2, K4)-Free Graphs are 4-Colorable. - Serge Gaspers; Shenwei Huang (SIAM J. Discret. Math., 2019)

k-Critical Graphs in P5-Free Graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (COCOON, 2020)

The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. - Kathie Cameron; Shenwei Huang; Irena Penev; Vaidy Sivaraman (J. Graph Theory, 2020)

List 3-Coloring Graphs with No Induced P6+rP3. - Maria Chudnovsky; Shenwei Huang; Sophie Spirkl; Mingxian Zhong (Algorithmica, 2021)

Square-Free Graphs with no Induced Fork. - Maria Chudnovsky; Shenwei Huang; T. Karthick; Jenny Kaufmann (Electron. J. Comb., 2021)

Some Results on k-Critical P5-Free Graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (CoRR, 2021)

An optimal χ -bound for ( P 6 , diamond)-free graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (J. Graph Theory, 2021)

On graphs with no induced five-vertex path or paraglider. - Shenwei Huang; T. Karthick (J. Graph Theory, 2021)

A Confidence-Guided Evaluation for Log Parsers Inner Quality. - Xueshuo Xie; Zhi Wang 014; Xuhang Xiao; Ye Lu 004; Shenwei Huang; Tao Li 022 (Mob. Networks Appl., 2021)

k-Critical graphs in P5-free graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (Theor. Comput. Sci., 2021)

LR-GNN: a graph neural network based on link representation for predicting molecular associations. - Chuanze Kang; Han Zhang 017; Zhuo Liu; Shenwei Huang; Yanbin Yin (Briefings Bioinform., 2022)

HDMC: a novel deep learning-based framework for removing batch effects in single-cell RNA-seq data. - Xiao Wang; Jia Wang; Han Zhang 017; Shenwei Huang; Yanbin Yin (Bioinform., 2022)

An Exploration Study on the Consequence of the COVID-19 Pandemic on Online Q&A Communities. - Shenwei Huang; Lei Wang (J. Glob. Inf. Manag., 2022)

Critical (P5,dart)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (COCOA (2), 2023)

Colouring graphs with no induced six-vertex path or diamond. - Jan Goedgebeur; Shenwei Huang; Yiao Ju; Owen D. Merkel (Theor. Comput. Sci., 2023)

A Note on the Rank of Inclusion Matrices. - Tao Feng 002; Shenwei Huang (Graphs Comb., 2023)

Complexity of Ck-coloring in hereditary classes of graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (Inf. Comput., 2023)

Some results on k-critical P5-free graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (Discret. Appl. Math., 2023)

Critical (P5, bull)-free graphs. - Shenwei Huang; Jiawei Li; Wen Xia (Discret. Appl. Math., 2023)

Vertex-critical (P5,chair)-free graphs. - Shenwei Huang; Zeyu Li (Discret. Appl. Math., 2023)

Some Results on Critical (P5,H)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (COCOON (1), 2024)

The optimal χ-bound for (P7,C4,C5)-free graphs. - Shenwei Huang (Discret. Math., 2024)

A self-supervised learning model for graph clustering optimization problems. - Qingqiong Cai; Xingyue Guo; Shenwei Huang (Knowl. Based Syst., 2024)

Near optimal colourability on hereditary graph families. - Yiao Ju; Shenwei Huang (Theor. Comput. Sci., 2024)

Coloring (P5, kite)-free graphs with small cliques. - Shenwei Huang; Yiao Ju; T. Karthick (Discret. Appl. Math., 2024)

The saturation number of K3,3. - Shenwei Huang; Hui Lei 002; Yongtang Shi; Junxue Zhang 002 (Discret. Math., 2024)

Vertex-Critical (P5,W4)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Iain Beaton; Ben Cameron; Shenwei Huang (COCOON (2), 2025)

Near optimal colourability on (H, Kn-e)-free graphs. - Yiao Ju; Shenwei Huang (Discret. Appl. Math., 2025)

Critical (P5,dart)-free graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (Discret. Appl. Math., 2025)

Some Results on Critical (P5,H)-free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (Theor. Comput. Sci., 2025)