Improved complexity results on k-coloring Pt-free graphs S Huang European Journal of Combinatorics 51, 336-346, 2016 | 56 | 2016 |

Complexity of coloring graphs without paths and cycles P Hell, S Huang Discrete Applied Mathematics 216, 211-232, 2017 | 39 | 2017 |

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 | 28 | 2018 |

Improved Complexity Results on *k*-Coloring *P* _{ t }-Free GraphsS Huang International Symposium on Mathematical Foundations of Computer Science, 551-558, 2013 | 26 | 2013 |

Narrowing the Complexity Gap for Colouring (*C*_{s}, P_{t})-Free GraphsS Huang, M Johnson, D Paulusma The Computer Journal 58 (11), 3074-3088, 2015 | 25 | 2015 |

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 | 17 | 2016 |

Bounding the Clique‐Width of *H*‐Free Chordal GraphsA Brandstädt, KK Dabrowski, S Huang, D Paulusma Journal of Graph Theory 86 (1), 42-77, 2017 | 14 | 2017 |

Bounding the Clique-Width of *H*-free Chordal GraphsA Brandstädt, KK Dabrowski, S Huang, D Paulusma International Symposium on Mathematical Foundations of Computer Science, 139-150, 2015 | 13 | 2015 |

Colouring square-free graphs without long induced paths S Gaspers, S Huang, D Paulusma Journal of Computer and System Sciences 106, 60-79, 2019 | 12 | 2019 |

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 | 8 | 2020 |

Linearly -Bounding (P6,C4)-Free Graphs S Gaspers, S Huang International Workshop on Graph-Theoretic Concepts in Computer Science, 263-274, 2017 | 6 | 2017 |

Bounding the clique-width of H-free split graphs A Brandstädt, KK Dabrowski, S Huang, D Paulusma Electronic Notes in Discrete Mathematics 49, 497-503, 2015 | 6 | 2015 |

Paired-domination in claw-free graphs S Huang, L Kang, E Shan Graphs and Combinatorics 29, 1777-1794, 2013 | 6 | 2013 |

A note on the upper bound for the paired-domination number of a graph with minimum degree at least two S Huang, E Shan Networks 57, 115-116, 2011 | 4 | 2011 |

Critical (P6, banner)-free graphs S Huang, T Li, Y Shi Discrete Applied Mathematics 258, 143-151, 2019 | 3 | 2019 |

-Free Graphs are 4-Colorable S Gaspers, S Huang SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019 | 3 | 2019 |

List-three-coloring graphs with no induced M Chudnovsky, S Huang, S Spirkl, M Zhong arXiv preprint arXiv:1806.11196, 2018 | 3 | 2018 |

Complexity of -coloring in hereditary classes of graphs M Chudnovsky, S Huang, P Rzążewski, S Spirkl, M Zhong arXiv preprint arXiv:2005.01824, 2020 | 2 | 2020 |

Vertex-Critical (, banner)-Free Graphs Q Cai, S Huang, T Li, Y Shi International Workshop on Frontiers in Algorithmics, 111-120, 2019 | 2 | 2019 |