近期论文
查看导师新发文章
（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）
K. Cameron, S. Huang, O. Merkel, An optimal chi-bound for (P6,diamond)-free graphs, Journal of Graph Theory 97, 451-465, 2021.
M. Chudnovsky, S. Huang, T. Karthick and J. Kaufmann, Square-free graphs with no induced fork, Electronic Journal of Combinatorics 28, #P2.20, 16 pages, 2021.
K. Cameron, J. Goedgebeur, S. Huang and Y. Shi, k-Critical graphs in P5-free graphs, Theoretical Computer Science 864, 80-91, 2021.
S. Huang, T. Karthick, On graphs with no induced five‐vertex path or paraglider, Journal of Graph Theory 97, 305–323, 2021.
M. Chudnovsky, S. Huang, S. Spirkl, and M. Zhong, List 3‑coloring graphs with no induced P6 + rP3, Algorithmica 83, 216-251, 2021.
K. Cameron, S. Huang, I. Penev, V. Sivaraman, The class of (P7,C4,C5)-free graphs: decomposition, algorithms, and chi-boundedness, Journal of Graph Theory 93, 503-552, 2020.
J. Cao, S. Huang, Graphs without five-vertex path and four-vertex cycle, Applied Mathematics and Computation 363, 124602, 2019.
S. Gaspers, S. Huang, D. Paulusma, Colouring square-free graphs without long induced paths, Journal of Computer and System Sciences 106, 60-79, 2019.
S. Gaspers, S. Huang, (2P2,K4)-free graphs are 4-colorable, SIAM Journal on Discrete Mathematics 33, 1095-1120, 2019.
K. Cameron, S. Huang, and O. Merkel, A bound for the chromatic number of (P5, gem)- free graphs, Bulletin of the Australian Mathematical Society, 1-7, 2019.
S. Gaspers, S. Huang, Linearly chi-bounding (P6,C4)-free graphs, Journal of Graph Theory, 1-21, 2019.
S. Huang, T. Li, Y. Shi, Critical (P6, banner)-free graphs, Discrete Applied Mathematics 258, 143-151, 2019.
K. Cameron, M.V.G. da Silva, S. Huang, K. Vuskovic, Structure and algorithms for (cap, even hole)-free graphs, Discrete Mathematics 341, 463-473, 2018.
A. Brandstadt, K. Dabrowski, S. Huang, D. Paulusma, Bounding the clique-width of H-free chordal graphs, Journal of Graph Theory 86,42-77, 2017.
P. Hell, S. Huang, Complexity of coloring graphs without paths and cycles, Discrete Applied Mathematics 216, 211-232, 2017.
K. Dabrowski, S. Huang, D. Paulusma, Bounding clique-width via perfect graphs, Journal of Computer and System Sciences 104, 202-215, 2019.
A. Brandstadt, K. Dabrowski, S. Huang, D. Paulusma, Bounding the clique-width of H-free split graphs, Discrete Applied Mathematics 211, 30-39, 2016.
S. Huang, Improved complexity results on k-coloring Pt-free graphs, European Journal of Combinatorics 51, 336-346, 2016.
S. Huang, M. Johnson, D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs, The Computer Journal 58, 3074-3088, 2015.
S. Huang, L. Kang, E. Shan, Paired-domination in claw-free graphs, Graphs and Combinatorics 29, 1777-1794, 2013.
S. Huang, E. Shan, A note on the upper bound for the paired-domination number of a graph with minimum degree at least two, Networks 57, 115-116, 2011.
会议论文 （13篇）
J. Goedgebeur, S. Huang, Y. Ju, O. Merkel, Colouring graphs with no induced six-vertex path or diamond, Proceedings of The 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science 13025, 319–329, 2021. (Tainan, Taiwan District, October 24-26, 2021)
K. Cameron, J. Goedgebeur, S. Huang, Y. Shi, k-Critical graphs in P5-free graphs, Proceedings of The 26th International Computing and Combinatorics Conference (COCOON 2020), Lecture Notes in Computer Science 12273, 411–422, 2020. (Atlanta, USA, August 29-31, 2020)
M. Chudnovsky, S. Huang, P. Rzazewski, S. Spirkl, M. Zhong, Complexity of Ck-coloring in hereditary classes of graphs, Proceedings of The 27th Annual European Symposium on Algorithms (ESA 2019), Leibniz International Proceedings in Informatics 144, 31:1-31:15, 2019. (Munich, Germany, September 11-13, 2019.)
Q. Cai, S. Huang, T. Li, Y. Shi, Vertex-critical (P5,banner)-free graphs, Proceedings of 13th International Frontiers of Algorithmics Workshop (FAW 2019), Lecture Notes in Computer Science 11458, 111-120, 2019. (Sanya, China, April 29-May 3, 2019.)
S. Gaspers, S. Huang, D. Paulusma, Colouring square-free graphs without long induced paths, Proceedings of 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics 96, 35:1-35:15, 2018. (Caen, France, February 28-March 3, 2018.)
H. Aziz, E. Elkind, S. Huang, M. Lackner, L. Sanchez-Fernandez, P. Skowron, On the complexity of extended and proportional justified representation, Proceedings of 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), 902-909, 2018. (New Orleans, Louisiana, USA, February 2-7, 2018.)
S. Gaspers, S. Huang, Linearly chi-bounding (P6,C4)-free graphs, Proceedings of 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Lecture Notes in Computer Science 10520, 263-274, 2017. (Eindhoven, The Netherlands, June 21-23, 2017.)
A. Brandstadt, K. Dabrowski, S. Huang, D. Paulusma, Bounding the clique-width of H-free chordal graphs, Proceedings of 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015), Lecture Notes in Computer Science 9235, 139-151, 2015. (Milano, Italy, August 24-28, 2015.)
A. Brandstadt, K. Dabrowski, S. Huang, D. Paulusma, Bounding the clique-width of H-free split graphs, Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2015), Electronic Notes in Discrete Mathematics 49, 497-503, 2015. (Bergen, Norway, August 31-September 4, 2015.)
K. Dabrowski, S. Huang, D. Paulusma, Bounding clique-width via perfect graphs, Proceedings of 9th International Conference on Language and Automata Theory and Applications (LATA 2015), Lecture Notes in Computer Science 8977, 676-688, 2015. (Nice, France, March 2-6, 2015.)
S. Huang, M. Johnson, D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs, Proceedings of 10th International Conference on Algorithmic Aspects of Information and Management (AAIM 2014), Lecture Notes in Computer Science 8546, 162-173, 2014. (Vancouver, Canada, July 8-11, 2014.)
P. Hell, S. Huang, Complexity of coloring graphs without paths and cycles, Proceedings of Theoretical Informatics: 11th Latin American Symposium (LATIN 2014), Lecture Notes in Computer Science 8392, 538-549, 2014. (Montevideo, Uruguay, March 31-April 4, 2014.)
S. Huang, Improved complexity results on k-coloring Pt-free graphs, Proceedings of 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science 8087, 551-558, 2013. (Klosterneuburg, Austria, August 26-30, 2013.)
投稿论文
J. Goedgebeur, S. Huang, Y. Ju and O. Merkel, Colouring graphs with no induced six-vertex path or diamond, invited to the special issue of COCOON 2021, 2021/12.
S. Huang, Y. Shi, Short proofs on k-extendible graphs, submitted, 2021/10.
Q. Cai, J. Goedgebeur, S. Huang, Some results on k-critical P5-free graphs, submitted, 2021/08.
京公网安备 11010802027423号