Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent. - Di Wang 005; Michael W. Mahoney; Nishanth Mohan; Satish Rao (CoRR, 2015)

Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time. - Michael W. Mahoney; Satish Rao; Di Wang 005; Peng Zhang 052 (ICALP, 2016)

Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. - Di Wang 005; Satish Rao; Michael W. Mahoney (ICALP, 2016)

Capacity Releasing Diffusion for Speed and Locality. - Di Wang 005; Kimon Fountoulakis; Monika Henzinger; Michael W. Mahoney; Satish Rao (ICML, 2017)

Fast Approximation Algorithms for Positive Linear Programs. - Di Wang 005 (2017)

Expander Decomposition and Pruning: Faster, Stronger, and Simpler. - Thatchaphol Saranurak; Di Wang 005 (SODA, 2019)

Flows in almost linear time via adaptive preconditioning. - Rasmus Kyng; Richard Peng; Sushant Sachdeva; Di Wang 005 (STOC, 2019)

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. - Jan van den Brand; Yin Tat Lee; Danupon Nanongkai; Richard Peng; Thatchaphol Saranurak; Aaron Sidford; Zhao Song 002; Di Wang 005 (FOCS, 2020)

p-Norm Flow Diffusion for Local Graph Clustering. - Kimon Fountoulakis; Di Wang 005; Shenghao Yang 002 (ICML, 2020)

Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. - Rasmus Kyng; Di Wang 005; Peng Zhang 052 (SODA, 2020)

Flowless: Extracting Densest Subgraphs Without Flow Computations. - Digvijay Boob; Yu Gao 001; Richard Peng; Saurabh Sawlani; Charalampos E. Tsourakakis; Di Wang 005; Junxing Wang (WWW, 2020)

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. - Goran Zuzic; Di Wang 005; Aranyak Mehta; D. Sivakumar 001 (CoRR, 2020)

Local Flow Partitioning for Faster Edge Connectivity. - Monika Henzinger; Satish Rao; Di Wang 005 (SIAM J. Comput., 2020)

2-norm Flow Diffusion in Near-Linear Time. - Li Chen 028; Richard Peng; Di Wang 005 (FOCS, 2021)

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. - Jan van den Brand; Yin Tat Lee; Yang P. Liu; Thatchaphol Saranurak; Aaron Sidford; Zhao Song 002; Di Wang 005 (STOC, 2021)

𝓁2-norm Flow Diffusion in Near-Linear Time. - Li Chen 028; Richard Peng; Di Wang 005 (CoRR, 2021)

Targeted pandemic containment through identifying local contact network bottlenecks. - Shenghao Yang 002; Priyabrata Senapati; Di Wang 005; Chris T. Bauch; Kimon Fountoulakis (PLoS Comput. Biol., 2021)

Robust Budget Pacing with a Single Sample. - Santiago R. Balseiro; Rachitesh Kumar; Vahab Mirrokni; Balasubramanian Sivan; Di Wang 005 (ICML, 2023)

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱. - Zhe Feng 004; Swati Padmanabhan; Di Wang 005 (WWW, 2023)

Joint Feedback Loop for Spend and Return-On-Spend Constraints. - Santiago R. Balseiro; Kshipra Bhawalkar; Zhe Feng 004; Haihao Lu; Vahab Mirrokni; Balasubramanian Sivan; Di Wang 005 (CoRR, 2023)

The Average-Value Allocation Problem. - Kshipra Bhawalkar; Zhe Feng 004; Anupam Gupta 001; Aranyak Mehta; David Wajc; Di Wang 005 (APPROX/RANDOM, 2024)

A Field Guide for Pacing Budget and ROS Constraints. - Santiago R. Balseiro; Kshipra Bhawalkar; Zhe Feng 004; Haihao Lu; Vahab Mirrokni; Balasubramanian Sivan; Di Wang 005 (ICML, 2024)

Auctions with LLM Summaries. - Avinava Dubey; Zhe Feng 004; Rahul Kidambi; Aranyak Mehta; Di Wang 005 (KDD, 2024)

Prior-Independent Auctions for Heterogeneous Bidders. - Guru Guruganesh; Aranyak Mehta; Di Wang 005; Kangning Wang 001 (SODA, 2024)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. - Monika Henzinger; Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2024)

How to Strategize Human Content Creation in the Era of GenAI? - Seyed A. Esmaeili; Kshipra Bhawalkar; Zhe Feng 004; Di Wang 005; Haifeng Xu (CoRR, 2024)

Deep Reinforcement Learning for Sequential Combinatorial Auctions. - Sai Srivatsa Ravindranath; Zhe Feng 004; Di Wang 005; Manzil Zaheer; Aranyak Mehta; David C. Parkes (CoRR, 2024)

Auto-Bidding and Auctions in Online Advertising: A Survey. - Gagan Aggarwal; Ashwinkumar Badanidiyuru; Santiago R. Balseiro; Kshipra Bhawalkar; Yuan Deng; Zhe Feng 004; Gagan Goel; Christopher Liaw; Haihao Lu; Mohammad Mahdian; Jieming Mao; Aranyak Mehta; et al. (SIGecom Exch., 2024)

Congestion-Approximators from the Bottom Up. - Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2025)

Online Bidding under RoS Constraints without Knowing the Value. - Sushant Vijayan; Zhe Feng 004; Swati Padmanabhan; Karthikeyan Shanmugam; Arun Sai Suggala; Di Wang 005 (WWW, 2025)

Position Auctions in AI-Generated Content. - Santiago R. Balseiro; Kshipra Bhawalkar; Yuan Deng; Zhe Feng 004; Jieming Mao; Aranyak Mehta; Vahab Mirrokni; Renato Paes Leme; Di Wang 005; Song Zuo (CoRR, 2025)