| 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 | 92 | 2018 |
| Improved complexity results on k-coloring Pt-free graphs S Huang European Journal of Combinatorics 51, 336-346, 2016 | 87 | 2016 |
| Complexity of coloring graphs without paths and cycles P Hell, S Huang Discrete Applied Mathematics 216, 211-232, 2017 | 48 | 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 | 42 | 2018 |
| Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs S Huang, M Johnson, D Paulusma The Computer Journal 58 (11), 3074-3088, 2015 | 31 | 2015 |
| Improved Complexity Results on k-Coloring P t -Free Graphs S Huang Mathematical Foundations of Computer Science 2013: 38th International …, 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 | 25* | 2019 |
| 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 | 25 | 2017 |
| An optimal ‐bound for (, diamond)‐free graphs K Cameron, S Huang, O Merkel Journal of Graph Theory 97 (3), 451-465, 2021 | 22 | 2021 |
| On graphs with no induced five‐vertex path or paraglider S Huang, T Karthick Journal of Graph Theory 97 (2), 305-323, 2021 | 19 | 2021 |
| 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 | 18 | 2020 |
| 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 |
| List 3-Coloring Graphs with No Induced M Chudnovsky, S Huang, S Spirkl, M Zhong Algorithmica 83, 216-251, 2021 | 16 | 2021 |
| Colouring square-free graphs without long induced paths S Gaspers, S Huang, D Paulusma Journal of Computer and System Sciences 106, 60-79, 2019 | 16 | 2019 |
| -Free Graphs are 4-Colorable S Gaspers, S Huang SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019 | 16 | 2019 |
| Vertex-Critical (, banner)-Free Graphs Q Cai, S Huang, T Li, Y Shi Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya …, 2019 | 14 | 2019 |
| Complexity of Ck-coloring in hereditary classes of graphs M Chudnovsky, S Huang, P Rzążewski, S Spirkl, M Zhong Information and Computation 292, 105015, 2023 | 13 | 2023 |
| k-critical graphs in P5-free graphs K Cameron, J Goedgebeur, S Huang, Y Shi Theoretical Computer Science 864, 80-91, 2021 | 13 | 2021 |
| Linearly -Bounding -Free Graphs S Gaspers, S Huang Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017 | 11 | 2017 |
| Some results on k-critical P5-free graphs Q Cai, J Goedgebeur, S Huang Discrete Applied Mathematics 334, 91-100, 2023 | 10 | 2023 |
Daniel PaulusmaDepartment of Computer Science, Durham University確認したメール アドレス: durham.ac.uk
