On the public citation graph
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
0 signed · 59 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/3-540-54233-7_145openalex-snapshot
Computing shortest paths and distances in planar graphs
inferredcites →https://doi.org/10.1007/3-540-54233-7_146openalex-snapshot
Maintaining biconnected components of dynamic planar graphs
inferredcites →https://doi.org/10.1007/3-540-55121-2_18openalex-snapshot
Dynamic algorithms for shortest paths in planar graphs
inferredcites →https://doi.org/10.1007/3-540-57273-2_72openalex-snapshot
A fully dynamic data structure for reachability in planar digraphs
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1993.366861openalex-snapshot
A linear-processor polylog-time algorithm for shortest paths in planar graphs
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1145/129712.129785openalex-snapshot
A parallel randomized approximation scheme for shortest paths
inferredcites →https://doi.org/10.1145/195058.195092openalex-snapshot
Faster shortest-path algorithms for planar graphs
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.5555/320176.320178openalex-snapshot
Incremental algorithms for minimal length paths
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_682openalex-snapshot
Recursive Separator Decompositions for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_3openalex-snapshot
The State of the Art in Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_28openalex-snapshot
Dynamic Approximate Vertex Cover and Maximum Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_49openalex-snapshot
Approximate Distance Queries for Weighted Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_682-1openalex-snapshot
Recursive Separator Decompositions for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_53openalex-snapshot
Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00446-018-0326-6openalex-snapshot
Distributed distance computation and routing with small messages
inferred← citeshttps://doi.org/10.1007/s00453-023-01107-1openalex-snapshot
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.008openalex-snapshot
Single-source shortest paths and strong connectivity in dynamic planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.024openalex-snapshot
Constant query time (1 + ϵ)-approximate distance oracle for planar graphs
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1093/beheco/arh005openalex-snapshot
Discrimination and classification of foraging paths produced by search-tactic models
inferred← citeshttps://doi.org/10.1109/focs.2011.73openalex-snapshot
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
inferred← citeshttps://doi.org/10.1109/focs.2016.58openalex-snapshot
Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00124openalex-snapshot
Near-Optimal $\left(1+\epsilon\right)-\text{Approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/itsc.2006.1707428openalex-snapshot
Algorithms for real-time gathering and analysis of continuous-flow traffic data
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959898openalex-snapshot
Compact oracles for reachability and approximate distances in planar digraphs
inferred← citeshttps://doi.org/10.1109/tpwrs.2004.840442openalex-snapshot
Main Chain Representation for Evolutionary Algorithms Applied to Distribution System Reconfiguration
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferred← citeshttps://doi.org/10.1137/1.9781611975482.180openalex-snapshot
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
inferred← citeshttps://doi.org/10.1137/1.9781611975482.36openalex-snapshot
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/15m1042929openalex-snapshot
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
inferred← citeshttps://doi.org/10.1142/s0218126622300045openalex-snapshot
Minimum Flows in Directed 1−n Planar Static and Dynamic Networks with Arcs and Nodes Capacities
inferred← citeshttps://doi.org/10.1145/1039488.1039493openalex-snapshot
Compact oracles for reachability and approximate distances in planar digraphs
inferred← citeshttps://doi.org/10.1145/1806689.1806753openalex-snapshot
Maintaining a large matching and a small vertex cover
inferred← citeshttps://doi.org/10.1145/2213977.2214084openalex-snapshot
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
inferred← citeshttps://doi.org/10.1145/2488608.2488672openalex-snapshot
Structured recursive separator decompositions for planar graphs in linear time
inferred← citeshttps://doi.org/10.1145/2530531openalex-snapshot
Shortest-path queries in static networks
inferred← citeshttps://doi.org/10.1145/2767386.2767398openalex-snapshot
Fast Partial Distance Estimation and Applications
inferred← citeshttps://doi.org/10.1145/2897518.2897521openalex-snapshot
Deterministic decremental single source shortest paths: beyond the o(mn) bound
inferred← citeshttps://doi.org/10.1145/2957318openalex-snapshot
Short and Simple Cycle Separators in Planar Graphs
inferred← citeshttps://doi.org/10.1145/3218821openalex-snapshot
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
inferred← citeshttps://doi.org/10.1145/3239560openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.1145/3460656openalex-snapshot
Discrete Fréchet Distance under Translation
inferred← citeshttps://doi.org/10.1145/3501303openalex-snapshot
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1145/3519935.3519998openalex-snapshot
Almost-linear ε -emulators for planar graphs
inferred← citeshttps://doi.org/10.1145/3618260.3649695openalex-snapshot
Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
inferred← citeshttps://doi.org/10.12677/aam.2021.1012486openalex-snapshot
Fault Repair of the Shortest Path in the Time-Varying Networks
inferred← citeshttps://doi.org/10.3141/2567-11openalex-snapshot
Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach
inferred← citeshttps://doi.org/10.4230/lipics.esa.2022.65openalex-snapshot
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1105.2228openalex-snapshot
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6593openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1307.1516openalex-snapshot
Dynamic Decremental Approximate Distance Oracles with $(1+ε, 2)$ stretch
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.7301/z0hd7t0fopenalex-snapshot
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
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.