Follow
Shenwei Huang
Title
Cited by
Cited by
Year
Improved complexity results on k-coloring Pt-free graphs
S Huang
European Journal of Combinatorics 51, 336-346, 2016
702016
On the complexity of extended and proportional justified representation
H Aziz, E Elkind, S Huang, M Lackner, L Sánchez-Fernández, P Skowron
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
572018
Complexity of coloring graphs without paths and cycles
P Hell, S Huang
Discrete Applied Mathematics 216, 211-232, 2017
462017
Structure and algorithms for (cap, even hole)-free graphs
K Cameron, MVG da Silva, S Huang, K Vušković
Discrete Mathematics 341 (2), 463-473, 2018
352018
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
S Huang, M Johnson, D Paulusma
The Computer Journal 58 (11), 3074-3088, 2015
302015
Improved Complexity Results on k-Coloring P t -Free Graphs
S Huang
Mathematical Foundations of Computer Science 2013: 38th International …, 2013
272013
Bounding the Clique‐Width of H‐Free Chordal Graphs
A Brandstädt, KK Dabrowski, S Huang, D Paulusma
Journal of Graph Theory 86 (1), 42-77, 2017
252017
Bounding clique-width via perfect graphs
KK Dabrowski, S Huang, D Paulusma
Journal of Computer and System Sciences 104, 202-215, 2019
23*2019
Bounding the clique-width of H-free split graphs
A Brandstädt, KK Dabrowski, S Huang, D Paulusma
Discrete Applied Mathematics 211, 30-39, 2016
182016
Colouring square-free graphs without long induced paths
S Gaspers, S Huang, D Paulusma
arXiv preprint arXiv:1805.08270, 2018
152018
The class of (P 7, C 4, C 5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
K Cameron, S Huang, I Penev, V Sivaraman
Journal of Graph Theory 93 (4), 503-552, 2020
132020
On graphs with no induced five‐vertex path or paraglider
S Huang, T Karthick
Journal of Graph Theory 97 (2), 305-323, 2021
112021
-Free Graphs are 4-Colorable
S Gaspers, S Huang
SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019
112019
List 3-Coloring Graphs with No Induced
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica 83, 216-251, 2021
102021
A polynomial-time algorithm to achieve extended justified representation
H Aziz, S Huang
arXiv preprint arXiv:1703.10415, 2017
102017
An optimal ‐bound for (, diamond)‐free graphs
K Cameron, S Huang, O Merkel
Journal of Graph Theory 97 (3), 451-465, 2021
92021
Vertex-Critical (, banner)-Free Graphs
Q Cai, S Huang, T Li, Y Shi
Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya …, 2019
92019
A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
K Cameron, S Huang, O Merkel
Bulletin of the Australian Mathematical Society 100 (2), 182-188, 2019
82019
Linearly -Bounding -Free Graphs
S Gaspers, S Huang
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
82017
Computational complexity of testing proportional justified representation
H Aziz, S Huang
arXiv preprint arXiv:1612.06476, 2016
82016
The system can't perform the operation now. Try again later.
Articles 1–20