On the public citation graph
Interval routing schemes
0 signed · 37 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.3230100305openalex-snapshot
Optimal clustering structures for hierarchical topological design of large computer networks
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/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0196-6774(90)90017-9openalex-snapshot
Improved routing strategies with succinct tables
inferredcites →https://doi.org/10.1016/0376-5075(77)90002-2openalex-snapshot
Hierarchical routing for large networks Performance evaluation and optimization
inferredcites →https://doi.org/10.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
inferredcites →https://doi.org/10.1137/0218058openalex-snapshot
Efficient Message Routing in Planar Networks
inferredcites →https://doi.org/10.1137/0219011openalex-snapshot
Space-Efficient Message Routing in c -Decomposable Networks
inferredcites →https://doi.org/10.1137/0405013openalex-snapshot
Routing with Polynomial Communication-Space Trade-Off
inferredcites →https://doi.org/10.1145/197917.198095openalex-snapshot
A characterization of networks supporting linear interval routing
inferredcites →https://doi.org/10.1145/65950.65953openalex-snapshot
A trade-off between space and efficiency for routing tables
inferredcites →https://doi.org/10.1145/73007.73053openalex-snapshot
Compact distributed data structures for adaptive routing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199908)34:1<47::aid-net5>3.0.co;2-3openalex-snapshot
Deadlock-free interval routing schemes
inferred← citeshttps://doi.org/10.1002/net.1017openalex-snapshot
Characterization results of all shortest paths interval routing schemes
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1728openalex-snapshot
Compact-Port Routing Models and Applications to Distance-Hereditary 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/978-3-540-27796-5_24openalex-snapshot
NP-Completeness Results for All-Shortest-Path Interval Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_5openalex-snapshot
On the Crossing Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/bfb0023472openalex-snapshot
Deadlock-free interval routing schemes
inferred← citeshttps://doi.org/10.1007/bfb0029969openalex-snapshot
On the dilation of interval routing
inferred← citeshttps://doi.org/10.1007/bfb0055087openalex-snapshot
Static and dynamic low-congested interval routing schemes
inferred← citeshttps://doi.org/10.1007/s00224-004-1080-zopenalex-snapshot
Compact Routing Schemes for Dynamic Ring Networks
inferred← citeshttps://doi.org/10.1007/s00446-002-0073-5openalex-snapshot
Compact and localized distributed data structures
inferred← citeshttps://doi.org/10.1007/s00453-010-9471-4openalex-snapshot
The Parameterized Complexity of Stabbing Rectangles
inferred← citeshttps://doi.org/10.1007/s12190-009-0265-2openalex-snapshot
All-shortest-path 2-interval routing is NP-complete
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.009openalex-snapshot
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
inferred← citeshttps://doi.org/10.1016/j.jda.2009.06.001openalex-snapshot
Ordered interval routing schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.010openalex-snapshot
On the hardness of minimizing space for all-shortest-path interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00279-1openalex-snapshot
Static and dynamic low-congested interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00070-4openalex-snapshot
Multidimensional interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)86543-7openalex-snapshot
On devising Boolean Routing schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00283-2openalex-snapshot
A survey on interval routing
inferred← citeshttps://doi.org/10.1109/ipps.1999.760466openalex-snapshot
Dynamic interval routing on asynchronous rings
inferred← citeshttps://doi.org/10.1142/s0219265911003015openalex-snapshot
EXPERIMENTAL EVALUATIONS OF ALGORITHMS FOR IP TABLE MINIMIZATION
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.