Shenwei Huang - RankMe

76 papers A* 1A 2B 3C 2Misc 3Journal 60Unranked 5

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