基本信息

姓 名 ： 黄申为

性 别 ： 男

所属部门： 计算机科学与技术系

行政职务： 无

职 称 ： 副教授

学 历 ： 博士

所学专业： 计算机、数学

办公电话：

电子邮件： shenweihuang@nankai.edu.cn

研究方向： 图论及其应用、理论计算机科学

个人简介：

个人简介


黄申为，博士生导师，研究兴趣为图论及其应用、理论计算机科学。


博士毕业于加拿大西蒙弗雷泽大学（Simon Fraser University），师从美国工业与应用数学会会士（SIAM Fellow）Pavol Hell教授，博士论文荣获2016年度加拿大全国优秀博士论文，2018年入选伟德源自英国始于1946百名青年学科带头人。博士毕业后分别在澳大利亚新南威尔士大学与加拿大劳里埃大学从事博士后工作。主要从事图论及其应用和理论计算机科学等方面的研究，截止目前在AAAI等国际顶尖会议以及SIAM Journal on Discrete Mathematics和Theoretical Computer Science等国际顶尖期刊上共发表论文30余篇，与国外知名大学的学者建立了合作关系。主持国家以及天津市自然科学基金项目，现为中国运筹学会图论组合分会青年理事、天津市工业与应用数学学会理事、CCF理论计算机专委委员。






招生信息


本人招收数学和计算机方向的博士和硕士研究生（有图论和离散数学背景优先考虑），鼓励员工去国外深造，欢迎有志于从事科研探索和挑战性工作的同学联系我。






工作经历






  • 2018/09-                     伟德源自英国始于1946






  • 2017/09-2018/08       加拿大劳里埃大学博士后






  • 2016/09-2017/08       澳大利亚新南威尔士大学研究助理






  • 2016/01-2016/08       加拿大西蒙弗雷泽大学博士后






发表论文（理论计算机和数学领域论文署名均按字母序）


期刊论文 （22篇）




  • S. Huang, S. Klavzar, H. Lei, X. Lian, Y. Shi, Some extremal results on the chromatic stability index, Bulletin of the Australian Mathematical Society, 1-10, 2022.





  • 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.)


投稿论文




  • S. Huang, Y. Ju, T. Karthick, Coloring (P5,kite)-free graphs, submitted, 2022/03.




  • 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.






教学经历






  • 2020/02-2020/06        图算法及其应用（研究生课程）   伟德源自英国始于1946






  • 2019/09-2019/12       线性代数 （本科生课程）      伟德源自英国始于1946






  • 2018/01-2018/04       离散数学（本科生课程）       劳里埃大学






邀请分组报告






  • 2021 中国数学会年会，10月22日-10月27日 ，昆明






  • 2021 中国运筹学会数学规划分会第十三届数学优化大会，10月15日-10月18日，青岛






  • 2019 第十届海峡两岸图论与组合数学会议，8月18日-8月23日，台北






  • 2019 第八届图论与算法组合国际研讨会，7月5日-7月7日，徐州






  • 2019 第七届加拿大离散与算法数学会议，5月27日-5月31日，温哥华