| 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 | 55 | 2021 |
| 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 | 18 | 2022 |
| Improved bounds for Rota's basis conjecture S Dong, J Geelen Combinatorica 39 (2), 265-272, 2019 | 10 | 2019 |
| 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 | 7 | 2015 |
| Guanghao Ye. A nearly-linear time algorithm for linear programs with small treewidth: A multiscale representation of robust central path. CoRR, abs/2011.05365 S Dong, YT Lee arXiv preprint arXiv:2011.05365, 2020 | 5 | 2020 |
| Computing circle packing representations of planar graphs S Dong, Y Tat Lee, K Quanrud Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 4 | 2020 |
| 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 | 3 | 2022 |
| 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 | | 2024 |
| Faster Min-Cost Flow on Bounded Treewidth Graphs S Dong, G Ye arXiv preprint arXiv:2308.14727, 2023 | | 2023 |
| Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity S Dong, T Rothvoss arXiv preprint arXiv:2307.16159, 2023 | | 2023 |
