Wenying Gan

According to our database, Wenying Gan authored at least 5 papers between 2012 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

The minimum number of disjoint pairs in set systems and related problems.

Shagnik Das, Wenying Gan, Benny Sudakov

Comb., 2016

2015

K_{s, t}-saturated bipartite graphs.

Wenying Gan, Dániel Korándi, Benny Sudakov

Eur. J. Comb., 2015

Maximizing the Number of Independent Sets of a Fixed Size.

Wenying Gan, Po-Shen Loh, Benny Sudakov

Comb. Probab. Comput., 2015

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman.

Shagnik Das, Wenying Gan, Benny Sudakov

Comb. Probab. Comput., 2015

2012

Contingency constrained optimal power flow solutions in complex network power grids.

Baha Alzalg, Catalina V. Anghel, Wenying Gan, Qing Huang, Mustazee Rahman, Alex Shum, Chai Wah Wu

Proceedings of the 2012 IEEE International Symposium on Circuits and Systems, 2012