Modeling Temporal Effects in Re-captured Video. - Philipp Schaber; Sally Dong; Benjamin Guthier; Stephan Kopf; Wolfgang Effelsberg (ACM Multimedia, 2015)

Improved Bounds for Rota's Basis Conjecture. - Sally Dong; Jim Geelen (Comb., 2019)

Computing Circle Packing Representations of Planar Graphs. - Sally Dong; Yin Tat Lee; Kent Quanrud (SODA, 2020)

A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path. - Sally Dong; Yin Tat Lee; Guanghao Ye (STOC, 2021)

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity. - Sally Dong; Haotian Jiang; Yin Tat Lee; Swati Padmanabhan; Guanghao Ye (NeurIPS, 2022)

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. - Sally Dong; Yu Gao 001; Gramoz Goranci; Yin Tat Lee; Richard Peng; Sushant Sachdeva; Guanghao Ye (SODA, 2022)

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. - Sally Dong; Thomas Rothvoss (CoRR, 2023)

Faster Min-Cost Flow on Bounded Treewidth Graphs. - Sally Dong; Guanghao Ye (CoRR, 2023)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs. - Sally Dong; Guanghao Ye (ESA, 2024)

The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. - Sally Dong; Thomas Rothvoss (IPCO, 2024)

Fast Algorithms for Separable Linear Programs. - Sally Dong; Gramoz Goranci; Lawrence Li; Sushant Sachdeva; Guanghao Ye (SODA, 2024)

Convex optimization with combinatorial characteristics: new algorithms for linear programming, min-cost flow, and other structured problems - Sally Dong (2025)