Follow
Sally Dong
Title
Cited by
Cited by
Year
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
S Dong, YT Lee, G Ye
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
672021
Nested dissection meets IPMs: Planar min-cost flow in nearly-linear time
S Dong, Y Gao, G Goranci, YT Lee, R Peng, S Sachdeva, G Ye
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
222022
Improved bounds for Rota's basis conjecture
S Dong, J Geelen
Combinatorica 39 (2), 265-272, 2019
102019
Modeling temporal effects in re-captured video
P Schaber, S Dong, B Guthier, S Kopf, W Effelsberg
Proceedings of the 23rd ACM international conference on Multimedia, 1279-1282, 2015
72015
Computing circle packing representations of planar graphs
S Dong, YT Lee, K Quanrud
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
52020
Decomposable non-smooth convex optimization with nearly-linear gradient oracle complexity
S Dong, H Jiang, YT Lee, S Padmanabhan, G Ye
Advances in Neural Information Processing Systems 35, 30756-30769, 2022
32022
Fast Algorithms for Separable Linear Programs
S Dong, G Goranci, L Li, S Sachdeva, G Ye
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
22024
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices
S Dong, T Rothvoss
International Conference on Integer Programming and Combinatorial …, 2024
2024
Convex optimization with combinatorial characteristics: new algorithms for linear programming, min-cost flow, and other structured problems
S Dong
University of Washington, 2024
2024
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
S Dong, G Ye
32nd Annual European Symposium on Algorithms (ESA 2024), 49: 1-49: 14, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–10