Shenwei Huang

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 60

Top Topics

Graph Clustering

Machine Learning

Top Venues

Discret. Appl. Math.

J. Graph Theory

Theor. Comput. Sci.

Publications

Yiao Ju, Shenwei Huang
Near optimal colourability on hereditary graph families. Theor. Comput. Sci. 993 (2024)
Shenwei Huang
The optimal χ-bound for (P7,C4,C5)-free graphs. Discret. Math. 347 (7) (2024)
Qingqiong Cai, Xingyue Guo, Shenwei Huang
A self-supervised learning model for graph clustering optimization problems. Knowl. Based Syst. 290 (2024)
Shenwei Huang, Hui Lei, Yongtang Shi, Junxue Zhang
. Discret. Math. 347 (3) (2024)
Shenwei Huang, Yiao Ju, T. Karthick
Coloring (P5, kite)-free graphs with small cliques. Discret. Appl. Math. 344 (2024)
Shenwei Huang, Zeyu Li
Vertex-critical (P5,chair)-free graphs. Discret. Appl. Math. 341 (2023)
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334 (2023)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-coloring in hereditary classes of graphs. Inf. Comput. 292 (2023)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring graphs with no induced six-vertex path or diamond. Theor. Comput. Sci. 941 (2023)
Tao Feng, Shenwei Huang
A Note on the Rank of Inclusion Matrices. Graphs Comb. 39 (2) (2023)
Shenwei Huang, Jiawei Li, Wen Xia
Critical (P5, bull)-free graphs. Discret. Appl. Math. 334 (2023)
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
-Free Graphs. COCOA (2) (2023)
Chuanze Kang, Han Zhang, Zhuo Liu, Shenwei Huang, Yanbin Yin
LR-GNN: a graph neural network based on link representation for predicting molecular associations. Briefings Bioinform. 23 (1) (2022)
Xiao Wang, Jia Wang, Han Zhang, Shenwei Huang, Yanbin Yin
HDMC: a novel deep learning-based framework for removing batch effects in single-cell RNA-seq data. Bioinform. 38 (5) (2022)
Shenwei Huang, Lei Wang
An Exploration Study on the Consequence of the COVID-19 Pandemic on Online Q&A Communities. J. Glob. Inf. Manag. 30 (1) (2022)
Xueshuo Xie, Zhi Wang, Xuhang Xiao, Ye Lu, Shenwei Huang, Tao Li
A Confidence-Guided Evaluation for Log Parsers Inner Quality. Mob. Networks Appl. 26 (4) (2021)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON (2021)
Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann
Square-Free Graphs with no Induced Fork. Electron. J. Comb. 28 (2) (2021)
Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong
. Algorithmica 83 (1) (2021)
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
-Free Graphs. CoRR (2021)
Kathie Cameron, Shenwei Huang, Owen D. Merkel
An optimal χ -bound for ( P 6 , diamond)-free graphs. J. Graph Theory 97 (3) (2021)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring graphs with no induced six-vertex path or diamond. CoRR (2021)
Shenwei Huang, Karthick Thiyagarajan
On graphs with no induced five-vertex path or paraglider. J. Graph Theory 97 (2) (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-free graphs. Theor. Comput. Sci. 864 (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-Free Graphs. COCOON (2020)
Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93 (4) (2020)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-coloring in hereditary classes of graphs. CoRR (2020)
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104 (2019)
Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. FAW (2019)
Serge Gaspers, Shenwei Huang
-Free Graphs are 4-Colorable. SIAM J. Discret. Math. 33 (2) (2019)
Xueshuo Xie, Zhi Wang, Xuhang Xiao, Lei Yang, Shenwei Huang, Tao Li
A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems. CoRR (2019)
Shenwei Huang, Tao Li, Yongtang Shi
Critical (P6, banner)-free graphs. Discret. Appl. Math. 258 (2019)
Shenwei Huang, T. Karthick
On graphs with no induced five-vertex path or paraglider. CoRR (2019)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106 (2019)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-Coloring in Hereditary Classes of Graphs. ESA (2019)
Xueshuo Xie, Zongming Jin, Qingqi Han, Shenwei Huang, Tao Li
A Confidence-Guided Anomaly Detection Approach Jointly Using Multiple Machine Learning Algorithms. CSS (2) (2019)
Serge Gaspers, Shenwei Huang
Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory 92 (3) (2019)
Shujuan Cao, Shenwei Huang
Graphs without five-vertex path and four-vertex cycle. Appl. Math. Comput. 363 (2019)
Kathie Cameron, Shenwei Huang, Owen D. Merkel
, diamond)-Free Graphs. CoRR (2018)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring Square-Free Graphs without Long Induced Paths. STACS (2018)
Serge Gaspers, Shenwei Huang, Daniël Paulusma
Colouring Square-Free Graphs without Long Induced Paths. CoRR (2018)
Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez Fernández, Piotr Skowron
On the Complexity of Extended and Proportional Justified Representation. AAAI (2018)
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341 (2) (2018)
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
-Free Chordal Graphs. J. Graph Theory 86 (1) (2017)
Haris Aziz, Shenwei Huang
A Polynomial-time Algorithm to Achieve Extended Justified Representation. CoRR (2017)
Serge Gaspers, Shenwei Huang
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG (2017)
Pavol Hell, Shenwei Huang
Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. 216 (2017)
Serge Gaspers, Shenwei Huang
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR (2017)
Shenwei Huang
-free graphs. Eur. J. Comb. 51 (2016)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211 (2016)
Haris Aziz, Shenwei Huang
Computational Complexity of Testing Proportional Justified Representation. CoRR (2016)
Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic
Structure and algorithms for (cap, even hole)-free graphs. CoRR (2016)
Lei Wang, Jiehui Zheng, Shenwei Huang, Haoye Sun
P300 and Decision Making under Risk and Ambiguity. Comput. Intell. Neurosci. 2015 (2015)
Shenwei Huang, Murilo V. G. da Silva
A note on coloring (even-hole, cap)-free graphs. CoRR (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) (2015)
Shenwei Huang, Matthew Johnson, Daniël Paulusma
)-Free Graphs. Comput. J. 58 (11) (2015)
Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding Clique-Width via Perfect Graphs. LATA (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of $H$-free Split Graphs. CoRR (2015)
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. 49 (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. CoRR (2015)
Pavol Hell, Shenwei Huang
Complexity of Coloring Graphs without Paths and Cycles. LATIN (2014)
Shenwei Huang, Matthew Johnson, Daniël Paulusma
Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR (2014)
Shenwei Huang, Matthew Johnson, Daniël Paulusma
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM (2014)
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding Clique-Width via Perfect Graphs. CoRR (2014)
Shenwei Huang
Improved Complexity Results on k-Coloring P t -Free Graphs. MFCS (2013)
Shenwei Huang, Liying Kang, Erfang Shan
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29 (6) (2013)
Pavol Hell, Shenwei Huang
Complexity of Coloring Graphs without Paths and Cycles. CoRR (2013)
Shenwei Huang
Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs CoRR (2013)
Shenwei Huang, Erfang Shan, Liying Kang
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23 (4) (2012)
Shenwei Huang, Erfang Shan
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. Networks 57 (2) (2011)