Wenying Gan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 5 from 5

2016

The minimum number of disjoint pairs in set systems and related problemsShagnik Das, Wenying Gan, Benny Sudakov. combinatorica, 36(6):623-660, 2016. [doi]

2015

Sperner's Theorem and a Problem of Erdős, Katona and KleitmanShagnik Das, Wenying Gan, Benny Sudakov. cpc, 24(4):585-608, 2015. [doi]

Maximizing the Number of Independent Sets of a Fixed SizeWenying Gan, Po-Shen Loh, Benny Sudakov. cpc, 24(3):521-527, 2015. [doi]

s, t-saturated bipartite graphsWenying Gan, Dániel Korándi, Benny Sudakov. ejc, 45:12-20, 2015. [doi]

2012

Contingency constrained optimal power flow solutions in complex network power gridsBaha Alzalg, Catalina Anghel, Wenying Gan, Qing Huang, Mustazee Rahman, Alex Shum, Chai Wah Wu. iscas 2012: 1636-1639 [doi]

Sign in or sign up to see more results.

runs on WebDSL