亚游登录,亚游集团官网

田方

姓名:田方

英文名:Tian, Fang

职称:副教授

办公电话:021-65904586

研究方向:图论及其应用,侧重图结构中随机方法,随机图过程,极值图论及相关应用研究

E-mailtianf@mail.shufe.edu.cn

学习经历:

1996.09-2003.02 本硕哈尔滨师范大学基础数学专业

2003.02-2006.07博士中国科学技术大学应用数学专业

工作经历:

2006.07-至今上海财经大学亚游登录

学术交流经历:

2013.08-2014.08 Department of Mathematics, University of South Carolina- Columbia

2014.04-2014.07 Department of Mathematics, University of Wisconsin-Madison

2018.03-2019.03 Research School of Computer Science, Australian National University

获奖情况:曾获上海财经大学“我心目中的好老师”,“校先进工作者”称号

科研项目:

上海市优秀青年教师科研专项基金-项目管理网络性能组合分析(主持,2008.1-2009.12)

国家自然科学基金青年基金-随机方法在图分割及相关优化问题中的理论与算法应用研究(主持,2012.1-2014.12)

校级基本科研业务费项目-随机图中禁用子图极值问题及其应用研究 (主持,2017.1-2017.12)

国家自然科学基金面上项目-极值图论随机结构与概率方法(参与,2019.1-2022.12)

代表论著:

B.D. McKay, Fang Tian, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges. Advances in Applied Mathematics. 115 (2020), Article number:102000.Pages 47.

Zi-Long Liu, Fang Tian, Some rainbow cycles in r-good edge-colorings. Applied Mathematics and Computation. 362 (2019), Article number:124566. Pages 11.

Fang Tian, Zi-Long Liu, Bounding the independence number in some (n,k,l,λ) hypergraphs. Graphs and Combinatorics. 342018),845-861.

Fang Tian, On Distance Matching Number in a Class of Sparse Random Graphs. Advances in Mathematics(China). 47(2) (2018), 175-181.

Fang Tian, Zi-Long Liu, Improved approximating 2-CatSP for σ0.5 with an unbalanced rounding matrix. Journal of Industrial and Management Optimization. 12 (4) (2016), 1249-1265.

Fang Tian, Zi-Long Liu, Lower Bounds on some certain vander Waerden Functions. Ars Combinatoria. 116 (2014), 55-63.

Fang Tian, Zi-Long Liu, Probabilistic single obnoxious facility location with fixed budget. Information Processing Letters. 112(2012),115-119.

Fang Tian, Zi-Long Liu, Simple probabilistic analysis to generalize bottleneck graph multi-partitioning. Applied Mathematics Letters.25(12)(2012),2040-2046.

Zi-Long Liu, Fang Tian and Jun-Ming Xu, Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs. Theoretical Computer Science. 410 (2009), 3804-3813.

Fang Tian, Jun-MingXu, Average Distances and Distance Domination Numbers. Discrete Applied Mathematics. 157 (5) (2009), 1113–1127.

Fang Tian,Jun-Ming Xu, A Note on Distance Domination Numbers of Graphs. Australasian Journal of Combinatorics. 43(2009), 181-190.

Fang Tian,Jun-Ming Xu, Distance Domination-Critical Graphs. Applied Mathematics Letters. 21 (4)(2008), 416–420.

Fang Tian,Jun-Ming Xu, On distance connected domination numbers of graphs. Ars Combinatoria. 84(2007), 357-367.

Jun-MingXu, Fang Tian and Jia Huang, Distance irredundance and connected domination numbers of a graph. Discrete Mathematics, 306 (22) (2006), 2943-2953.

Fang Tian,Jun-Ming Xu, Distance domination numbers of generalized de Bruijn and Kautz digraphs. OR.Transactions.10(1) (2006), 88-94.

XML 地图 | Sitemap 地图