On the public citation graph
Fault-Tolerant Approximate BFS Structures
0 signed · 35 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-24100-0_39openalex-snapshot
On Approximate Distance Labels and Routing Schemes with Affine Stretch
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_66openalex-snapshot
Sparse Fault-Tolerant BFS Trees
inferredcites →https://doi.org/10.1007/978-3-662-44777-2_12openalex-snapshot
Fault-Tolerant Approximate Shortest-Path Trees
inferredcites →https://doi.org/10.1007/978-3-662-45174-8_12openalex-snapshot
Vertex Fault Tolerant Additive Spanners
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_15openalex-snapshot
Improved Purely Additive Fault-Tolerant Spanners
inferredcites →https://doi.org/10.1007/s00446-015-0252-9openalex-snapshot
Vertex fault tolerant additive spanners
inferredcites →https://doi.org/10.1007/s00453-011-9543-0openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferredcites →https://doi.org/10.1016/0095-8956(91)90097-4openalex-snapshot
Extremal graphs with no C4's, C6's, or C10's
inferredcites →https://doi.org/10.1016/j.tcs.2015.02.036openalex-snapshot
Fault tolerant additive and (μ,α) -spanners
inferredcites →https://doi.org/10.1109/focs.2006.29openalex-snapshot
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
inferredcites →https://doi.org/10.1109/focs.2006.45openalex-snapshot
Lower Bounds for Additive Spanners, Emulators, and More
inferredcites →https://doi.org/10.1109/focs.2010.83openalex-snapshot
Distance Oracles beyond the Thorup-Zwick Bound
inferredcites →https://doi.org/10.1109/sfcs.2001.959899openalex-snapshot
Vickrey prices and shortest paths: what is an edge worth?
inferredcites →https://doi.org/10.1137/090758039openalex-snapshot
Fault Tolerant Spanners for General Graphs
inferredcites →https://doi.org/10.1137/s0097539701393384openalex-snapshot
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
inferredcites →https://doi.org/10.1137/s0097539796303421openalex-snapshot
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
inferredcites →https://doi.org/10.1145/1536414.1536431openalex-snapshot
A nearly optimal oracle for avoiding failed vertices and edges
inferredcites →https://doi.org/10.1145/2684068openalex-snapshot
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
inferredcites →https://doi.org/10.1145/2897518.2897555openalex-snapshot
The 4/3 additive spanner exponent is tight
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory
inferredcites →https://doi.org/10.4230/lipics.stacs.2010.2481openalex-snapshot
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
inferredcites →https://doi.org/10.48550/arxiv.1703.10293openalex-snapshot
Preserving Distances in Very Faulty Graphs
inferredcites →https://doi.org/10.5555/1873601.1873662openalex-snapshot
A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00446-025-00483-xopenalex-snapshot
Tight bounds on the message complexity of distributed tree verification
inferred← citeshttps://doi.org/10.1007/s00453-020-00734-2openalex-snapshot
Fault Tolerant Approximate BFS Structures with Additive Stretch
inferred← citeshttps://doi.org/10.1007/s00453-021-00879-8openalex-snapshot
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
inferred← citeshttps://doi.org/10.1007/s00453-022-00978-0openalex-snapshot
Mincut Sensitivity Data Structures for the Insertion of an Edge
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103495openalex-snapshot
Blackout-tolerant temporal spanners
inferred← citeshttps://doi.org/10.1137/1.9781611976465.148openalex-snapshot
Approximate Distance Oracles Subject to Multiple Vertex Failures
inferred← citeshttps://doi.org/10.1137/1.9781611977073.27openalex-snapshot
Sensitivity Oracles for All-Pairs Mincuts
inferred← citeshttps://doi.org/10.1145/3293611.3331588openalex-snapshot
A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.2106.12293openalex-snapshot
Finding single-source shortest $p$-disjoint paths: fast computation and sparse preservers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.