- Shenwei Huang, Tao Li, Yongtang Shi:
Critical (P6, banner)-free graphs. Discret. Appl. Math. 258: 143-151 (2019) - Konrad K. Dabrowski
, Shenwei Huang, Daniël Paulusma
:
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104: 202-215 (2019) - Serge Gaspers, Shenwei Huang, Daniël Paulusma
:
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106: 60-79 (2019) - Serge Gaspers
, Shenwei Huang
:
Linearly χ-bounding (P6, C4)-free graphs. J. Graph Theory 92(3): 322-342 (2019) - Serge Gaspers, Shenwei Huang:
(2P2, K4)-Free Graphs are 4-Colorable. SIAM J. Discret. Math. 33(2): 1095-1120 (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: 93-100 - Maria Chudnovsky
, Shenwei Huang, Pawel Rzazewski
, Sophie Spirkl
, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi:
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs. FAW 2019: 111-120 - Shenwei Huang, T. Karthick:
On graphs with no induced five-vertex path or paraglider. CoRR abs/1903.11268 (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 abs/1907.02765 (2019) - 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): 463-473 (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: 902-909 - Serge Gaspers, Shenwei Huang, Daniël Paulusma
:
Colouring Square-Free Graphs without Long Induced Paths. STACS 2018: 35:1-35:15 - Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. CoRR abs/1805.08270 (2018) - Kathie Cameron, Shenwei Huang, Owen D. Merkel:
An Optimal χ-Bound for (P6, diamond)-Free Graphs. CoRR abs/1809.00739 (2018) - 2017
- Pavol Hell, Shenwei Huang:
Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. 216: 211-232 (2017) - Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
:
Bounding the Clique-Width of H-Free Chordal Graphs. J. Graph Theory 86(1): 42-77 (2017) - Serge Gaspers, Shenwei Huang:
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. WG 2017: 263-274 - Haris Aziz, Shenwei Huang:
A Polynomial-time Algorithm to Achieve Extended Justified Representation. CoRR abs/1703.10415 (2017) - Serge Gaspers, Shenwei Huang:
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. CoRR abs/1709.09750 (2017) - 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: 30-39 (2016) - Shenwei Huang:
Improved complexity results on k-coloring Pt-free graphs. Eur. J. Comb. 51: 336-346 (2016) - Haris Aziz, Shenwei Huang:
Computational Complexity of Testing Proportional Justified Representation. CoRR abs/1612.06476 (2016) - Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. CoRR abs/1611.08066 (2016) - 2015
- Lei Wang, Jiehui Zheng, Shenwei Huang, Haoye Sun:
P300 and Decision Making under Risk and Ambiguity. Comput. Intell. Neurosci. 2015: 108417:1-108417:7 (2015) - Shenwei Huang, Matthew Johnson
, Daniël Paulusma
:
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. Comput. J. 58(11): 3074-3088 (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: 497-503 (2015) - Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
:
Bounding Clique-Width via Perfect Graphs. LATA 2015: 676-688 - Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. CoRR abs/1502.06948 (2015)