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

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

Complexity of coloring graphs without paths and cycles P Hell, S Huang Discrete Applied Mathematics 216, 211-232, 2017 | 42 | 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 | 36 | 2018 |

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

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

Bounding clique-width via perfect graphs KK Dabrowski, S Huang, D Paulusma Journal of Computer and System Sciences 104, 202-215, 2019 | 24* | 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 | 19 | 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 | 15 | 2017 |

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

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 |

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

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

A polynomial-time algorithm to achieve extended justified representation H Aziz, S Huang arXiv preprint arXiv:1703.10415, 2017 | 10 | 2017 |

Computational complexity of testing proportional justified representation H Aziz, S Huang arXiv preprint arXiv:1612.06476, 2016 | 8 | 2016 |

An optimal ‐bound for (, diamond)‐free graphs K Cameron, S Huang, O Merkel Journal of Graph Theory 97 (3), 451-465, 2021 | 7 | 2021 |

On graphs with no induced five‐vertex path or paraglider S Huang, T Karthick Journal of Graph Theory 97 (2), 305-323, 2021 | 7 | 2021 |

List 3-Coloring Graphs with No Induced P 6 + r P 3 M Chudnovsky, S Huang, S Spirkl, M Zhong Algorithmica 83 (1), 216-251, 2021 | 7 | 2021 |

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

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 | 6 | 2019 |