Di Wang

Talks

Decompose Graph into Expanders.
ACM-SIAM Symposium on Discrete Algorithms (SODA 2019); Jan 2019; San Diego, USA
Simons Institute Reunion Workshop, UC Berkeley; Dec 2018; Berkeley, USA
Local flow-based methods for graph clustering.
Google Algorithm Seminar, Google MTV; Oct 2019; Mountain View, USA
CSE Colloquium, University of Connecticut; May 2019; Storrs, USA
CS Theory Seminar, Carnegie Mellon University; May 2019; Pittsburgh, USA
Computer Science and Engineering Colloquium, Penn State University; Mar 2019; State College, USA
CS Theory Seminar, Boston University; Jan 2019; Boston, USA
Yale Institute for Network Science (YINS) Seminar, Yale University; Dec 2018; New Haven, USA
Capacity Releasing Diffusion for Speed and Locality.
ARC Colloquium, Georgia Tech; Feb 2018; Atlanta, USA
International Conference on Machine Learning (ICML 2017); July 2017; Sydney, Australia
Local Flow Partitioning for Faster Edge Connectivity.
ACM-SIAM Symposium on Discrete Algorithms (SODA 2017); Jan 2017; Barcelona, Spain
Accelerated First-order Method for Packing and Covering LPs
The Fifth International Conference on Continuous Optimization (ICCOPT 2016); Aug 2016; Tokyo, Japan
International Colloquium on Automata, Languages and Programming (ICALP 2016); July 2016; Rome, Italy
Approximating the Solution to Mixed Packing and Covering LPs in Parallel $widetilde{O}(epsilon^{-3})$ Time.
Theory and Algorithms Group Seminar, University of Vienna; July 2016; Vienna, Austria
International Colloquium on Automata, Languages and Programming (ICALP 2016); July 2016; Rome, Italy