On the public citation graph
Searching among intervals and compact routing tables
0 signed · 44 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.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1006/jagm.1995.1027openalex-snapshot
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems
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-56939-1_59openalex-snapshot
Searching among intervals and compact routing tables
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_22openalex-snapshot
Computer Networks with Compact Routing Tables
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/0022-0000(80)90037-9openalex-snapshot
Implicit data structures for fast search and update
inferredcites →https://doi.org/10.1016/s0019-9958(85)80013-9openalex-snapshot
Implicit data structures for weighted elements
inferredcites →https://doi.org/10.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1145/102782.102788openalex-snapshot
Planar graph decomposition and all pairs shortest paths
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/322358.322364openalex-snapshot
Implicit Data Structures for the Dictionary Problem
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_31openalex-snapshot
External Memory Algorithms for Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_111openalex-snapshot
The complexity of interval routing on random graphs
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_61openalex-snapshot
All-pairs min-cut in sparse networks
inferred← citeshttps://doi.org/10.1007/3-540-63238-7_26openalex-snapshot
Materialization trade-offs in hierarchical shortest path algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4020-6268-1_65openalex-snapshot
Algorithm for Solving the Collisions in Uniform Simple Hashing with Combined Linked Ordered Lists
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_19openalex-snapshot
Splitting Plane Graphs to Outerplanarity
inferred← citeshttps://doi.org/10.1007/s004460100058openalex-snapshot
Interval routing schemes allow broadcasting with linear message-complexity
inferred← citeshttps://doi.org/10.1007/s004530010016openalex-snapshot
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
inferred← citeshttps://doi.org/10.1007/s004530010043openalex-snapshot
Improved Algorithms for Dynamic Shortest Paths
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101975openalex-snapshot
Untangling circular drawings: Algorithms and complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2005.12.008openalex-snapshot
Area-efficient planar straight-line drawings of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00070-4openalex-snapshot
Multidimensional interval routing schemes
inferred← citeshttps://doi.org/10.1109/lcn.2004.32openalex-snapshot
Bringing efficient advanced queries to distributed hash tables
inferred← citeshttps://doi.org/10.1109/lcn.2007.138openalex-snapshot
Achieving True Video-on-Demand Service in Multi-Hop WiMax Mesh Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.47openalex-snapshot
Replica Placement and Location using Distributed Hash Tables
inferred← citeshttps://doi.org/10.1145/335305.335359openalex-snapshot
Shortest path queries in planar graphs
inferred← citeshttps://doi.org/10.1145/568438.568451openalex-snapshot
Routing in distributed networks
inferred← citeshttps://doi.org/10.1145/774763.774779openalex-snapshot
Efficient topology-aware overlay network
inferred← citeshttps://doi.org/10.3929/ethz-a-003889027openalex-snapshot
Fast longest prefix matching: algorithms, analysis, and applications
inferred← citeshttps://doi.org/10.7155/jgaa.00082openalex-snapshot
I/O-Optimal Algorithms for Outerplanar 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.