default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaowei Long
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j1]Panagiotis Charalampopoulos
, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen:
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70(2): 12:1-12:50 (2023)
Conference and Workshop Papers
- 2024
- [c6]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. FOCS 2024: 2033-2044 - [c5]Yaowei Long, Yunfan Wang:
Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. ICALP 2024: 109:1-109:20 - 2023
- [c4]Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang:
Tight Conditional Lower Bounds for Vertex Connectivity Problems. STOC 2023: 1384-1395 - 2022
- [c3]Yaowei Long, Thatchaphol Saranurak:
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. FOCS 2022: 1002-1010 - 2021
- [c2]Yaowei Long, Seth Pettie:
Planar Distance Oracles with Better Time-Space Tradeoffs. SODA 2021: 2517-2537 - 2019
- [c1]Yaowei Long, Zidong Wu, Hongyi Liu, Titing Cui, Wenjie Xu, Minghua Chen:
Path and Speed Planning Online Platform for Energy-Efficient Timely Truck Transportation. BuildSys 2019: 383-384
Informal and Other Publications
- 2024
- [i7]Yaowei Long, Yunfan Wang:
Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. CoRR abs/2402.09150 (2024) - [i6]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. CoRR abs/2402.18541 (2024) - [i5]Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long, Thatchaphol Saranurak:
Unbreakable Decomposition in Close-to-Linear Time. CoRR abs/2408.09368 (2024) - [i4]Yaowei Long, Seth Pettie, Thatchaphol Saranurak:
Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies. CoRR abs/2410.18885 (2024) - 2022
- [i3]Yaowei Long, Thatchaphol Saranurak:
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. CoRR abs/2205.03930 (2022) - [i2]Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang:
Tight Conditional Lower Bounds for Vertex Connectivity Problems. CoRR abs/2212.00359 (2022) - 2020
- [i1]Yaowei Long, Seth Pettie:
Planar Distance Oracles with Better Time-Space Tradeoffs. CoRR abs/2007.08585 (2020)
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 2025-01-09 12:53 CET 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:
