Fang Tian

From MaRDI portal
Person:413282

Available identifiers

zbMath Open tian.fangMaRDI QIDQ413282

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60720592023-11-29Paper
A note on the random triadic process2022-12-04Paper
Connectivity of the linear uniform hypergraph process2022-08-24Paper
Large induced distance matchings in certain sparse random graphs2022-02-07Paper
On the number of linear multipartite hypergraphs with given size2021-11-30Paper
Stable recycling networks under the extended producer responsibility2021-05-03Paper
Random $K_k$-removal algorithm2020-08-16Paper
On partial Steiner $(n,r,\ell)$-system process2020-07-23Paper
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges2020-02-27Paper
Some rainbow cycles in \(r\)-good edge-colorings2020-01-09Paper
Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs2019-01-11Paper
https://portal.mardi4nfdi.de/entity/Q46877612018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q46430272018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q53717492017-10-20Paper
Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix2017-06-14Paper
https://portal.mardi4nfdi.de/entity/Q29871252017-05-17Paper
https://portal.mardi4nfdi.de/entity/Q29916722016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q34475882015-10-27Paper
https://portal.mardi4nfdi.de/entity/Q49261802013-06-20Paper
Simple probabilistic analysis to generalize bottleneck graph multi-partitioning2012-10-11Paper
Probabilistic single obnoxious facility location with fixed budget2012-05-04Paper
https://portal.mardi4nfdi.de/entity/Q35711212010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35710532010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35687542010-06-15Paper
An adaptive sliding mode tracking controller using BP neural networks for a class of large-scale nonlinear systems2010-01-21Paper
https://portal.mardi4nfdi.de/entity/Q36415512009-11-11Paper
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs2009-09-10Paper
Average distances and distance domination numbers2009-06-30Paper
A note on distance domination numbers of graphs2009-03-16Paper
An adaptive sliding mode tracking controller using BP neural networks for a class of large-scale nonlinear systems2008-11-24Paper
Distance domination-critical graphs2008-04-28Paper
Distance irredundance and connected domination numbers of a graph2007-01-09Paper
Bounds for distance domination numbers of graphs2006-02-16Paper

Research outcomes over time

This page was built for person: Fang Tian