Sally Dong

18 papers A* 6A 1B 1Journal 9
YearRankTypeTitle / Venue / Authors
2025 — —
Convex optimization with combinatorial characteristics: new algorithms for linear programming, min-cost flow, and other structured problems
Sally Dong
2025 J jnl
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
J. ACM
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Sushant Sachdeva, Richard Peng, Guanghao Ye
2024 A* conf
Fast Algorithms for Separable Linear Programs.
SODA
Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye
2024 A conf
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs.
ESA
Sally Dong, Guanghao Ye
2024 B conf
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices.
IPCO
Sally Dong, Thomas Rothvoss
2023 J jnl
Fast Algorithms for Separable Linear Programs.
CoRR
Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye
2023 J jnl
Faster Min-Cost Flow on Bounded Treewidth Graphs.
CoRR
Sally Dong, Guanghao Ye
2023 J jnl
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity.
CoRR
Sally Dong, Thomas Rothvoss
2022 A* conf
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.
NeurIPS
Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye
2022 J jnl
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.
CoRR
Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye
2022 A* conf
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
SODA
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2022 J jnl
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.
CoRR
Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2021 A* conf
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path.
STOC
Sally Dong, Yin Tat Lee, Guanghao Ye
2020 J jnl
A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path.
CoRR
Sally Dong, Yin Tat Lee, Guanghao Ye
2020 A* conf
Computing Circle Packing Representations of Planar Graphs.
SODA
Sally Dong, Yin Tat Lee, Kent Quanrud
2019 J jnl
Computing Circle Packing Representations of Planar Graphs.
CoRR
Sally Dong, Yin Tat Lee, Kent Quanrud
2019 J jnl
Improved Bounds for Rota's Basis Conjecture.
Comb.
Sally Dong, Jim Geelen
2015 A* conf
Modeling Temporal Effects in Re-captured Video.
ACM Multimedia
Philipp Schaber, Sally Dong, Benjamin Guthier, Stephan Kopf, Wolfgang Effelsberg