Shenwei Huang

According to our database, Shenwei Huang authored at least 61 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Some Results on Critical (P5,H)-free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Theor. Comput. Sci., 2025

Critical (P5,dart)-free graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Discret. Appl. Math., 2025

Near optimal colourability on (H, Kn-e)-free graphs.

Yiao Ju, Shenwei Huang

Discret. Appl. Math., 2025

Vertex-Critical (P_5,W₄₎-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang

Proceedings of the Computing and Combinatorics, 2025

2024

The saturation number of <i>K</i>_3,3.

Shenwei Huang, Hui Lei, Yongtang Shi, Junxue Zhang

Discret. Math., March, 2024

Coloring (P5, kite)-free graphs with small cliques.

Shenwei Huang, Yiao Ju, T. Karthick

Discret. Appl. Math., February, 2024

Near optimal colourability on hereditary graph families.

Yiao Ju, Shenwei Huang

Theor. Comput. Sci., 2024

A self-supervised learning model for graph clustering optimization problems.

Qingqiong Cai, Xingyue Guo, Shenwei Huang

Knowl. Based Syst., 2024

The optimal χ-bound for (P7,C4,C5)-free graphs.

Shenwei Huang

Discret. Math., 2024

Some Results on Critical (P_5,H)-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023

Vertex-critical (P5,chair)-free graphs.

Shenwei Huang, Zeyu Li

Discret. Appl. Math., December, 2023

Critical (P5, bull)-free graphs.

Shenwei Huang, Jiawei Li, Wen Xia

Discret. Appl. Math., July, 2023

Some results on k-critical P5-free graphs.

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

Discret. Appl. Math., July, 2023

Complexity of <i>C</i>_<i>k</i>-coloring in hereditary classes of graphs.

Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong

Inf. Comput., June, 2023

A Note on the Rank of Inclusion Matrices.

Tao Feng, Shenwei Huang

Graphs Comb., April, 2023

Critical (P_5,dart)-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

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.

Shenwei Huang, Lei Wang

J. Glob. Inf. Manag., 2022

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

Xiao Wang, Jia Wang, Han Zhang, Shenwei Huang, Yanbin Yin

Bioinform., 2022

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

Chuanze Kang, Han Zhang, Zhuo Liu, Shenwei Huang, Yanbin Yin

Briefings Bioinform., 2022

2021

<i>k</i>-Critical graphs in <i>P</i>₅-free graphs.

Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi

Theor. Comput. Sci., 2021

A Confidence-Guided Evaluation for Log Parsers Inner Quality.

Xueshuo Xie, Zhi Wang, Xuhang Xiao, Ye Lu, Shenwei Huang, Tao Li

Mob. Networks Appl., 2021

On graphs with no induced five-vertex path or paraglider.

Shenwei Huang, T. Karthick

J. Graph Theory, 2021

An optimal χ -bound for ( P 6 , diamond)-free graphs.

Kathie Cameron, Shenwei Huang, Owen D. Merkel

J. Graph Theory, 2021

Some Results on k-Critical P₅-Free Graphs.

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

CoRR, 2021

Square-Free Graphs with no Induced Fork.

Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann

Electron. J. Comb., 2021

List 3-Coloring Graphs with No Induced P_6+rP₃.

Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong

Algorithmica, 2021

Colouring Graphs with No Induced Six-Vertex Path or Diamond.

Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

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

k-Critical Graphs in P₅-Free Graphs.

Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

(2P_{2, K₄₎}-Free Graphs are 4-Colorable.

Serge Gaspers, Shenwei Huang

SIAM J. Discret. Math., 2019

Linearly χ-bounding (P6, C4)-free graphs.

Serge Gaspers, Shenwei Huang

J. Graph Theory, 2019

Critical (P6, banner)-free graphs.

Shenwei Huang, Tao Li, Yongtang Shi

Discret. Appl. Math., 2019

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

Xueshuo Xie, Zhi Wang, Xuhang Xiao, Lei Yang, Shenwei Huang, Tao Li

CoRR, 2019

Graphs without five-vertex path and four-vertex cycle.

Shujuan Cao, Shenwei Huang

Appl. Math. Comput., 2019

Vertex-Critical ( P_5 P 5 , banner)-Free Graphs.

Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Complexity of C_k-Coloring in Hereditary Classes of Graphs.

Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

A Confidence-Guided Anomaly Detection Approach Jointly Using Multiple Machine Learning Algorithms.

Xueshuo Xie, Zongming Jin, Qingqi Han, Shenwei Huang, Tao Li

Proceedings of the Cyberspace Safety and Security - 11th International Symposium, 2019

2018

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

Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic

Discret. Math., 2018

An Optimal χ-Bound for (P₆, diamond)-Free Graphs.

Kathie Cameron, Shenwei Huang, Owen D. Merkel

CoRR, 2018

Colouring Square-Free Graphs without Long Induced Paths.

Serge Gaspers, Shenwei Huang, Daniël Paulusma

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

On the Complexity of Extended and Proportional Justified Representation.

Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez Fernández, Piotr Skowron

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.

Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

J. Graph Theory, 2017

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

Serge Gaspers, Shenwei Huang

CoRR, 2017

A Polynomial-time Algorithm to Achieve Extended Justified Representation.

Haris Aziz, Shenwei Huang

CoRR, 2017

Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs.

Serge Gaspers, Shenwei Huang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Improved complexity results on k-coloring P_t-free graphs.

Shenwei Huang

Eur. J. Comb., 2016

Computational Complexity of Testing Proportional Justified Representation.

Haris Aziz, Shenwei Huang

CoRR, 2016

2015

Bounding the Clique-Width of H-free Split Graphs.

Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

Electron. Notes Discret. Math., 2015

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

Shenwei Huang, Murilo V. G. da Silva

CoRR, 2015

Narrowing the Complexity Gap for Colouring (<i>C_s, P_t</i>)-Free Graphs.

Shenwei Huang, Matthew Johnson, Daniël Paulusma

Comput. J., 2015

P300 and Decision Making under Risk and Ambiguity.

Lei Wang, Jiehui Zheng, Shenwei Huang, Haoye Sun

Comput. Intell. Neurosci., 2015

Bounding the Clique-Width of H-free Chordal Graphs.

Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Bounding Clique-Width via Perfect Graphs.

Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

Proceedings of the Language and Automata Theory and Applications, 2015

2014

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

Shenwei Huang, Matthew Johnson, Daniël Paulusma

CoRR, 2014

Complexity of Coloring Graphs without Paths and Cycles.

Pavol Hell, Shenwei Huang

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.

Shenwei Huang, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Paired-Domination in Claw-Free Graphs.

Shenwei Huang, Liying Kang, Erfang Shan

Graphs Comb., 2013

Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs

Shenwei Huang

CoRR, 2013

Improved Complexity Results on k-Coloring P t -Free Graphs.

Shenwei Huang

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Perfect matchings in paired domination vertex critical graphs.

Shenwei Huang, Erfang Shan, Liying Kang

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.

Shenwei Huang, Erfang Shan

Networks, 2011