侯建鋒檢視原始碼討論檢視歷史
|
侯建鋒，男，福州大學福州大學數學與統計學院教授。
人物簡歷
2019/10-2021/04， 華為香港研究所，圖論高級研究科學家
2017/07-至今， 福州大學數學與計算機科學學院，教授
2012/07-2017/07， 福州大學數學與計算機科學學院，副教授，博士生導師
2014/09-2015/09， 美國佐治亞理工學院，訪問學者
2013/03-2013/05， 中國科學院數學與系統科學學院，訪問學者
2009/07-2012/07， 福州大學數學與計算機科學學院，講師
2004/09-2009/07， 山東大學數學學院（碩博連讀），獲博士學位
2000/09-2004/07， 山東大學數學學院，獲學士學位
科研項目
1.國家自然科學基金面上項目，12071077，圖的最大割及其相關問題研究，2021/01-2024/12，52萬，主持
2. 國家自然科學基金專項項目，11826008，圖的路分解及相關問題研討班，2019/01-2019/12，20萬，主持
3. 國家自然科學基金面上項目，11671087，圖與超圖若干劃分問題的研究，2017/01-2020/12，57.2萬，主持
4. 國家自然科學基金重點項目，11331003，網絡設計中的離散數學方法，2014/01-2018/12，240萬，參加
5. 國家自然科學基金青年項目，11001055，幾類圖染色問題的研究，2011/01-2013/12，17萬，主持
6．福建省自然科學基金傑青項目，2011J06001，圖的無圈染色和無圈列表染色的研究， 2011/04-2014/04，20萬，主持
7．福建省自然科學基金青年項目，2010J05004，圖上幾類染色問題的研究， 2010/05-2012/05，3萬，主持
8．國家自然科學基金面上項目，圖的（t,k,d）-樹染色問題的研究，10971121， 2010/01-2012/12，24萬，參加
9. 福建省高校傑出青年科研人才培育計劃，幾類圖染色問題的研究，2011/04-2014/04，4.5萬，主持
10. 福建省高等學校新世紀優秀人才支持計劃，圖的路分解和Gallai猜想的研究，2014/01-2016/12，5萬， 主持
獲獎情況
2020年入選福建省「雛鷹計劃」青年拔尖人次
2017年福州大學「旗山學者」
2013年度第二屆福州大學傑出青年教師勵志獎獲得者
2011年全國優秀博士學位論文提名獎
2011年福建省自然科學基金傑青項目獲得者
2010年山東省優秀博士學位論文
2010年山東大學優秀博士學位論文
學術任職
中國數學會組合數學與圖論專業委員會委員
中國工業與應用數學學會圖論組合及應用專業委員會委員
福建省數學會常務理事
Frontiers of Computer Science青年AE
International Journal of Mathematics and Statistics，Editor
International Journal of Applied Mathematics and Statistics，Editor
學術成果
論著
1.Jianfeng Hou, Hongguo Zhu, Coloring graphs without bichromatic cycles or paths, Bull. Malays. Math. Sci. Soc. 44 (2021), no. 4, 1905–1917
2.Gergely Ambrus, Bo Bai, Jianfeng Hou, Uniform tight frames as optimal signals, Adv. in Appl. Math. 129 (2021), 102219.
3.Jianfeng Hou, Y. Yan, Max-Bisections of H-free graphs, Discrete Mathematics, 343 (1), (2020) 111590.
4.Jianfeng Hou, Hongguo Zhu, Choosability with union separation of triangle-free planar graphs. Discrete Math. 343 (2020), no. 12, 112137.
5.Jianfeng Hou, Z. Li, S. Wu, On bipartitions of directed graphs with small semidegree, European Journal of Combinatorics 84, (2020) 103039.
6.Jianfeng Hou, H. Zhu, Choosability with union separation of planar graphs without cycles of length 4, Applied Mathematics and Computation 386 (2020) 125477.
7.Jianfeng Hou, H. Zhu, Choosability with union separation of triangle-free planar graphs, Discrete Mathematics 343 (12) (2020) 112137.
8.Jianfeng Hou, H. Zhu, Coloring graphs without bichromatic cycles or paths, Bulletin of the Malaysian Mathematical Sciences Society, (2020), to appear.
9.Jianfeng Hou, H. Ma, X. Yu, X. Zhang, A bound on judicious bipartitions of directed graphs, SCIENCE CHINA Mathematics, 63 (2), (2020) 297-308.
10.Jianfeng Hou, H. Ma, J. Yu, X. Zhang, On partitions of K2,3-free graphs under degree constraints. Discrete Math. 341 (2018) 3288–3295.
11.Jianfeng Hou, Shufei Wu, Bipartitions of oriented graphs, J. Combin. Theory Ser. B 132 (2018) 107–133.
12. Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu, The Bollobás-Scott conjecture for 4-uniform hypergraphs, SIAM J. Discrete Math. 32 (2018) 505–521.
13. Shufei Wu, Jianfeng Hou, Partitioning dense uniform hypergraphs, J. Comb. Optim. 35 (2018) 48–63.
14. Genghua Fan, Jianfeng Hou, Xingxing Yu, Bisections of graphs without short cycles， Combin. Probab. Comput. 27 (2018) 44–59.
15.Qinghou Zeng, Jianfeng Hou, Maximum cuts of graphs with forbidden cycles, ARS Mathematica Contemporanea 15 (2018) 147–160.
16.Genghua Fan, Jianfeng Hou, Bounds for pairs in judicious partitioning of graphs, Random Structures Algorithms 50 (2017) 59–70.
17.Jianfeng Hou, Qinghou Zeng, Judicious partitioning of hypergraphs with edges of size at most 2, Combin. Probab. Comput. 26 (2017) 267-284.
18.Jianfeng Hou, Qinghou Zeng, On a problem of judicious k-partitions of graphs, J. Graph Theory 85 (2017) 619–643.
19.Jianfeng Hou, Shufei Wu, On bisections of directed graphs, European Journal of Combinatorics 63 (2017) 44-58.
20.Qinghou Zeng, Jianfeng Hou, Jin Deng, Xia Lei, Biased partitions and judicious k-partitions of graphs, Acta Mathematica Sinica, English Series 33 (2017) 668–680.
21.Qinghou Zeng, Jianfeng Hou, Bipartite subgraphs of H-free graphs, Bull. Aust. Math. Soc. 96 (2017) 1-13.
22.Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan, Graphs of f -class 1, Discrete Applied Mathematics 222 (2017) 197-204.
23.Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin, Monochromatic solutions for multi-term unknowns, Graphs and Combinatorics 32 (2016) 2275–2293.
24.Jianfeng Hou, Shufei Wu, Guiying Yan, On judicious partitions of uniform hypergraphs，J. Combin. Theory Ser. A 141 (2016) 16-32.
25.Jianfeng Hou, Shufei Wu, Acyclic coloring of graphs without bichromatic long path, Front. Math. China 10 (2015) 1343–1354.
26. Xin Zhang, Jianfeng Hou, Guizhen Liu, On total colorings of 1-planar graphs, J. Comb. Optim. 30 (2015) 160–173.
27. Genghua Fan, Jianfeng Hou, Qinghou Zeng, A bound for judicious k-partitions of graphs, Discrete Appl. Math. 179 (2014) 86–99.
28.Jianfeng Hou, G. Liu, Every toroidal graph is acyclically 8-choosable, Acta Mathematica Sinica, English Series, 30 (2014) 343–352.
29.Jianfeng Hou, Weitao Wang, Xiaoran Zhang, Acyclic edge coloring of planar graphs with girth at least 5, Discrete Appl. Math. 161 (2013) 2958–2967.
30. Yue Guan, Jianfeng Hou, Yingyuan Yang, An improved bound on acyclic chromatic index of planar graphs, Discrete Math. 313 (2013) 1098–1103.
31. Q. Lin, Jianfeng Hou, Y. Liu, Acyclic edge coloring of graphs with large girths, Science China Mathematics, 12 (2012) 2593–2600.
32.M. Cygan, Jianfeng Hou, Ł. Kowalik, B. Luvzar, J. Wu, A planar linear arboricity conjecture, Journal of Graph Theory, 69 (2012), 403–425.
33. Jianfeng Hou, G. Liu, J. Wu, Acyclic edge coloring of planar graphs without small cycles, Graphs and Combinatorics, 28 (2012) 215–226.
34. Jianfeng Hou, B. Liu, G. Liu, J. Wu, Total coloring of planar graphs without 6-cycles, Discrete Applied Mathematics 159 (2011) 157-163.
35.Jianfeng Hou, G. Liu, G. Wang, Improved bounds for acyclic chromatic index of planar graphs, Discrete Applied Mathematics 159 (2011) 876-881.
36. G. Chang, Jianfeng Hou, N. Roussel, Local condition for planar graphs of maximum degree 7 to be 8-totally colorable, Discrete Applied Mathematics 159 (2011) 760-768.
37.Jianfeng Hou, N. Roussel, J. Wu, Acyclic chromatic index of planar graphs with triangles, Information Processing Letters, 111 (2011) 836-840.
38.Jianfeng Hou, J. Wu, G. Liu, B. Liu, Acyclic edge chromatic number of outerplanar graphs, J. Graph Theory, 64 (2010) 22-36.
39.Jianfeng Hou, J. Wu, G. Liu, B. Liu, Total coloring of embedded graphs of maximum degree at least ten, Science China-Mathematics 53 (2010) 2127-2133.
40.Jianfeng Hou, B. Liu, G. Liu, J. Wu, Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles, International Journal of Computer Mathematics 87 (2010) 2880-2886.
41.G. Chang, Jianfeng Hou, N. Roussel, On the total choosability of planar graphs and of sparse graphs, Information Processing Letters, 110 (2010) 849-853.
42.G. Liu, Jianfeng Hou, The method of coloring in graphs and its application, J. Systems Science & Complexity, 23 (2010) 951-960.
43.Jianfeng Hou, J. Wu, G. Liu, B. Liu, Acyclic edge colorings of planar graphs and series-parallel graphs, Science in China Series A: Mathematics, (2009) 52 (3) 1-12.
44.Jianfeng Hou, G. Liu, J. Cai, Edge-choosability of planar graphs without adjacent triangles or without 7-cycles, Discrete Math. 309(2009) 77-84.
45.Jianfeng Hou, G. Liu, J. Wu, On 3-degeneracy of some C7-free plane graphs with application to choosability. Ars Combin., 91 (2009) 289–296.
46.B. Liu, Jianfeng Hou, J. Wu, G. Liu, Total colorings and list total colorings of planar graphs without intersecting 4-cycles, Discrete Mathematics, 309 (2009) 6035-6043.
47.D. Yu, Jianfeng Hou, G. Liu, B. Liu, L. Xu, Acyclic edge coloring of planar graphs with large girth, Theoretical Computer Science 410 (2009) 5196-5200.
48.J. Cai, G. Liu, Jianfeng Hou, The stability number and connected [k,k+1]-factor in graphs, Appl. Math. Lett. 22 (2009) 927-931.
49.J. Cai, Jianfeng Hou, X. Zhang, G. Liu, Edge-choosability of planar graphs without non-induced 5-cycles. Inform. Process. Lett. 109 (2009) 343-346.
50. 侯建鋒, 吳建良, 劉桂真, 劉彬, 平面圖和系列平行圖的無圈邊染色, 中國科學A: 數學, 38 (12) (2008) 1335-1346.
51.Jianfeng Hou, Y. Zhu, G. Liu, J. Wu, Total colorings of planar graphs without small cycles. Graphs and Combinatorics, 24 (2008) 91–100.
52.B. Liu, Jianfeng Hou, G. Liu, List edge and list total colorings of planar graphs without short cycles, Information Processing Letters 108 (2008) 347–351.
53.Jianfeng Hou, G. Liu, J. Wu, Some results on list total colorings of planar graphs, Lecture Note in Computer Science, 4489 (2007) 320-328.
54. G. Liu, Jianfeng Hou, J. Cai, Some results about f-critical graphs, Networks 50 (3)(2007) 197-202.
55.J. Wu, Jianfeng Hou, G. Liu, The linear arboricity of planar graphs with no short cycles, Theoretical Computer Science, 381 (2007) 230-233.
56.Jianfeng Hou, G. Liu, J. Cai, List edge and list total colorings of planar graphs without 4-cycles, Theoretical Computer Science 369 (2006) 250-255.[1]