Richard Peng: Maximum Flow and Minimum-Cost Flows in Almost-Linear Time

Yifan Jing (Oxford): Sidon sets and sum-product phenomena

Lutz Warnke: Counting extensions in random graphs

Felix Joos: Decompositions of Hypergraphs

Tao Jiang: On Turán exponents of graphs

Ehud Friedgut, "Five and a half proofs of one theorem"

Gabor Tardos: Planar point sets determine many pairwise crossing segments

Zilin Jiang (MIT): Negligible obstructions and Turán exponents

11. Pseudorandom graphs I: quasirandomness

Joonkyung Lee: On tripartite common graphs

Oleg Pikhurko: Combinatorics of Circle Squaring

Bo Ning (南开大学) A spectral condition for cycles with consecutive lengths

Oliver Janzer (Cambridge): Rainbow Turán number of even cycles

Xuding Zhu (Zhejiang Normal University) - Coloring, Sparseness and Girth

David Gamarnik on Overlap Gap Property

Lina Li (Illinois): Independent sets in middle two layers of Boolean lattice

陈耀俊（南京大学）：Ramsey numbers concerning quadrilaterals

Rob Morris on Asymmetric containers and additive combinatorics

Kevin Hendrey (IBS): Counting cliques in 1-planar graphs

15. Graph limits II: regularity and counting