基本信息

姓 名 ： 黄申为

性 别 ： 男

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

行政职务： 无

职 称 ： 副教授

学 历 ： 博士

所学专业： 计算机、数学

办公电话：

电子邮件： shenweihuang [AT] nankai.edu.cn

研究方向： 网络科学、算法设计与分析、图论与组合优化

个人简介：

个人简介


黄申为，博士生导师，研究兴趣为网络科学、算法设计与分析、图论与组合优化。


博士毕业于加拿大西蒙弗雷泽大学（Simon Fraser University），师从美国工业与应用数学会会士（SIAM Fellow）Pavol Hell教授，博士论文获2016年度加拿大全国优秀博士论文，2018年入选南开大学百名青年学科带头人。博士毕业后分别在澳大利亚新南威尔士大学与加拿大劳里埃大学从事博士后工作。主要从事网络科学、算法设计与分析、图论与组合优化等方面的研究，截止目前在AAAI、ESA、STACS等国际高水平会议以及SIDMA、JCSS、JGT、EJC等国际顶尖期刊上共发表论文近30篇。曾在诸多知名计算机和数学国际会议上（如SIAM DM、CanaDAM、SiGMa）作邀请报告，与国外诸多知名大学的学者建立了长期的合作关系。现主持国家自然科学基金青年项目一项（染色问题在传递图类上的计算复杂性）。入选天津市131创新型人才（第三层次），现为中国运筹学会图论组合分会青年理事以及天津市工业与应用数学学会理事。




本人招生博士和硕士研究生，鼓励学生去国外深造，欢迎有志于从事科研探索和挑战性工作的同学联系我。指导理念：亦师亦友，教学相长。


工作经历


2018/09-                     南开大学计算机学院

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

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

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


主持项目


主持，国家自然科学基金，青年项目，染色问题在传递图类上的计算复杂性（11801284），2019-01-01至2021-12-31，26万，在研。


期刊论文




  1. 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.
  2. Shujuan Cao, Shenwei Huang, Graphs without five-vertex path and four-vertex cycle. Appl. Math. Comput. 363, 2019.
  3. S. Gaspers, S. Huang, D. Paulusma, Colouring square-free graphs without long induced paths, Journal of Computer and System Sciences 106, 60-79, 2019.
  4. S. Gaspers, S. Huang, (2P2,K4)-free graphs are 4-colorable, SIAM Journal on Discrete Mathematics 33, 1095-1120, 2019.
  5. 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.
  6. S. Gaspers, S. Huang, Linearly chi-bounding (P6,C4)-free graphs, Journal of Graph Theory, 1-21, 2019.
  7. S. Huang, T. Li, Y. Shi, Critical (P6, banner)-free graphs, Discrete Applied Mathematics 258, 143-151, 2019.
  8. 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.
  9. 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.
  10. P. Hell, S. Huang, Complexity of coloring graphs without paths and cycles, Discrete Applied Mathematics 216, 211-232, 2017.
  11. K. Dabrowski, S. Huang, D. Paulusma, Bounding clique-width via perfect graphs, Journal of Computer and System Sciences 104, 202-215, 2019.
  12. A. Brandstadt, K. Dabrowski, S. Huang, D. Paulusma, Bounding the clique-width of H-free split graphs, Discrete Applied Mathematics 211, 30-39, 2016.
  13. S. Huang, Improved complexity results on k-coloring Pt-free graphs, European Journal of Combinatorics 51, 336-346, 2016.
  14. S. Huang, M. Johnson, D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs, The Computer Journal 58, 3074-3088, 2015.
  15. S. Huang, L. Kang, E. Shan, Paired-domination in claw-free graphs, Graphs and Combinatorics 29, 1777-1794, 2013.
  16. S. Huang, E. Shan, L. Kang, Perfect matching in paired domination vertex critical graphs, Journal of Combinatorial Optimization 23, 507-518, 2012.
  17. 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.


会议论文




  1. 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), to appear.
  2. 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.)
  3. 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.)
  4. 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.)
  5. 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), to appear, 2018. (New Orleans, Louisiana, USA, February 2-7, 2018.)
  6. 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.)
  7. 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.)
  8. 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.)
  9. 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.)
  10. 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.)
  11. 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.)
  12. 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.)


教学经历


2020/02-2020/06         图算法及其应用（研究生课程）   南开大学

内容：greedy algorithm, divide-and-conquer, dynamic programming, network flow, NP-completeness, randomized algorithms, approximation algorithms.


2019/09-2019/12       线性代数       南开大学

内容: determinants, matrix, system of linear equations, vector space, quadratic form, linear transformation.


2018/01-2018/04       离散数学       Wilfrid Laurier University

内容: sets, functions, relations, induction, counting, graph theory.


会议邀请报告


1.     2019/08         The 10th Cross-strait Conference on Graph Theory and Combinatorics , August 18-August 23, Taibei, Taiwan District.

报告题目: (2P2,K4)-Free Graphs are 4-Colorable.


2.     2019/07         The 8th International Symposium on Graph Theory and Combinatorial Algorithms, July 5-July 7, Xuzhou, China.

报告题目: (2P2,K4)-Free Graphs are 4-Colorable.


3.     2019/05         Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019), May 27-31, Vancouver, Canada.

报告题目: Coloring Square-Free Graphs without Long Induced Paths.


4.     2017/07         Structure in Graphs and Matroids (SiGMa 2017), July 17-21, Waterloo, Canada.

报告题目: Linearly Bounding (P6,C4)-Free Graphs.


5.     2015/06         Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2015), June 1-4, Saskatoon, Canada.

报告题目: Bounding Clique-width via Perfect Graphs.


6.     2014/06         SIAM Conference on Discrete Mathematics (SIAM DM 2014), June 16-19, Minneapolis, United States.

报告题目: Coloring Graphs without Induced Paths and Cycles.