default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSally Dong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Sally Dong, Guanghao Ye:
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs. ESA 2024: 49:1-49:14- [c7]Sally Dong, Thomas Rothvoss:
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. IPCO 2024: 113-123 - [c6]Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye:
Fast Algorithms for Separable Linear Programs. SODA 2024: 3558-3604 - 2023
- [i7]Sally Dong, Thomas Rothvoss:
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. CoRR abs/2307.16159 (2023) - [i6]Sally Dong, Guanghao Ye:
Faster Min-Cost Flow on Bounded Treewidth Graphs. CoRR abs/2308.14727 (2023) - [i5]Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye:
Fast Algorithms for Separable Linear Programs. CoRR abs/2310.16351 (2023) - 2022
- [c5]Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye:
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity. NeurIPS 2022 - [c4]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. SODA 2022: 124-153 - [i4]Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye:
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. CoRR abs/2205.01562 (2022) - [i3]Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan
, Guanghao Ye:
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity. CoRR abs/2208.03811 (2022) - 2021
- [c3]Sally Dong, Yin Tat Lee, Guanghao Ye:
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path. STOC 2021: 1784-1797 - 2020
- [c2]Sally Dong, Yin Tat Lee, Kent Quanrud:
Computing Circle Packing Representations of Planar Graphs. SODA 2020: 2860-2875 - [i2]Sally Dong, Yin Tat Lee, Guanghao Ye:
A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path. CoRR abs/2011.05365 (2020)
2010 – 2019
- 2019
- [j1]Sally Dong, Jim Geelen:
Improved Bounds for Rota's Basis Conjecture. Comb. 39(2): 265-272 (2019) - [i1]Sally Dong, Yin Tat Lee, Kent Quanrud:
Computing Circle Packing Representations of Planar Graphs. CoRR abs/1911.00612 (2019) - 2015
- [c1]Philipp Schaber, Sally Dong, Benjamin Guthier, Stephan Kopf, Wolfgang Effelsberg:
Modeling Temporal Effects in Re-captured Video. ACM Multimedia 2015: 1279-1282
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
