2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2022
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
Yaowei Long, Thatchaphol Saranurak
We revisit the vertex-failure connectivity oracle problem. This is one of the most basic graph data structure problems under vertex updates, yet its complexity is still not well-un…
cs.DS2020★ 2 cited
Planar Distance Oracles with Better Time-Space Tradeoffs
Yaowei Long, Seth Pettie
In a recent breakthrough, Charalampopoulos, Gawrychowski, Mozes, and Weimann (STOC 2019) showed that exact distance queries on planar graphs could be answered in time by…