On the public citation graph
Designing networks with compact routing tables
0 signed · 136 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-95486-3_22openalex-snapshot
Computer Networks with Compact Routing Tables
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.1093/comjnl/28.1.5openalex-snapshot
Labelling and Implicit Routing in Networks
inferredcites →https://doi.org/10.1109/12.9731openalex-snapshot
Space-efficient and fault-tolerant message routing in outerplanar networks
inferredcites →https://doi.org/10.1109/sfcs.1986.49openalex-snapshot
Separator-based strategies for efficient message routing
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1145/10590.10598openalex-snapshot
Optimal message routing without complete routing tables
inferredcites →https://doi.org/10.1145/322139.322150openalex-snapshot
Approximation Algorithms for Some Postman Problems
inferredcites →https://doi.org/10.1145/322358.322364openalex-snapshot
Implicit Data Structures for the Dictionary Problem
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/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1002/1097-0037(200010)36:3<191::aid-net6>3.0.co;2-kopenalex-snapshot
Low-congested interval routing schemes for hypercubelike networks
inferred← citeshttps://doi.org/10.1002/net.1017openalex-snapshot
Characterization results of all shortest paths interval routing schemes
inferred← citeshttps://doi.org/10.1002/net.3230260412openalex-snapshot
Encoding shortest paths in spatial networks
inferred← citeshttps://doi.org/10.1006/inco.1997.2669openalex-snapshot
On Interval Routing Schemes and Treewidth
inferred← citeshttps://doi.org/10.1006/jagm.1997.0915openalex-snapshot
Worst Case Bounds for Shortest Path Interval Routing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1134openalex-snapshot
Compact Routing with Minimum Stretch
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/10692760_14openalex-snapshot
Compact Implicit Representation of Graphs
inferred← citeshttps://doi.org/10.1007/10692760_15openalex-snapshot
Graphs with Bounded Induced Distance
inferred← citeshttps://doi.org/10.1007/11922377_5openalex-snapshot
Distributed Routing in Tree Networks with Few Landmarks
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_8openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_17openalex-snapshot
Efficient Communication Schemes
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_98openalex-snapshot
Efficient parallel algorithms for shortest paths in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_10openalex-snapshot
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_145openalex-snapshot
Computing shortest paths and distances in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_59openalex-snapshot
Searching among intervals and compact routing tables
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_64openalex-snapshot
On multi-label linear interval routing schemes
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_93openalex-snapshot
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_73openalex-snapshot
On-line and dynamic algorithms for shortest path problems
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-60618-1_75openalex-snapshot
On Interval Routing Schemes and treewidth
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_43openalex-snapshot
Lower bounds for compact routing
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_14openalex-snapshot
Efficient algorithms for shortest path queries in planar digraphs
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_103openalex-snapshot
Path layout in ATM networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_19openalex-snapshot
Applications of the Obstruction Principle and WQOs
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_14openalex-snapshot
Compact Routing for Flat Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_58openalex-snapshot
Minimum Cycle Bases of Weighted Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_20openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/bf01955044openalex-snapshot
Searching among intervals and compact routing tables
inferred← citeshttps://doi.org/10.1007/bf01994878openalex-snapshot
Efficient parallel algorithms for shortest paths in planar digraphs
inferred← citeshttps://doi.org/10.1007/bf02835831openalex-snapshot
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
inferred← citeshttps://doi.org/10.1007/bfb0020435openalex-snapshot
A scalable approach to routing in ATM networks
inferred← citeshttps://doi.org/10.1007/bfb0023472openalex-snapshot
Deadlock-free interval routing schemes
inferred← citeshttps://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferred← citeshttps://doi.org/10.1007/bfb0055087openalex-snapshot
Static and dynamic low-congested interval routing schemes
inferred← citeshttps://doi.org/10.1007/pl00009251openalex-snapshot
Compact Routing on Chordal Rings of Degree 4
inferred← citeshttps://doi.org/10.1007/s00446-002-0073-5openalex-snapshot
Compact and localized distributed data structures
inferred← citeshttps://doi.org/10.1007/s004460100058openalex-snapshot
Interval routing schemes allow broadcasting with linear message-complexity
inferred← citeshttps://doi.org/10.1007/s004530010043openalex-snapshot
Improved Algorithms for Dynamic Shortest Paths
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90079-jopenalex-snapshot
Prefix routing schemes in dynamic networks
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90017-9openalex-snapshot
Improved routing strategies with succinct tables
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90256-mopenalex-snapshot
Graph theoretical issues in computer networks
inferred← citeshttps://doi.org/10.1016/j.dam.2006.09.010openalex-snapshot
Average stretch analysis of compact routing schemes
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.005openalex-snapshot
Minimum cycle bases of weighted outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.011openalex-snapshot
Distance and routing labeling schemes for non-positively curved plane graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2009.06.001openalex-snapshot
Ordered interval routing schemes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.02.021openalex-snapshot
On the efficiency of routing in sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.013openalex-snapshot
Characterization of networks supporting multi-dimensional linear interval routing schemes
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00013-1openalex-snapshot
An optimal message routing algorithm for double-loop networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00225-0openalex-snapshot
Representing graphs implicitly using almost optimal space
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00227-4openalex-snapshot
Graphs with bounded induced distance
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)80002-4openalex-snapshot
Optimal layouts on a chain ATM network
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00002-6openalex-snapshot
Compact routing schemes with low stretch factor
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00180-3openalex-snapshot
The complexity of the characterization of networks supporting shortest-path interval routing
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(02)00067-1openalex-snapshot
Interval routing in some planar networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00065-5openalex-snapshot
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00273-3openalex-snapshot
Algorithmic graph embeddings
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.1016/s1571-0653(05)80054-xopenalex-snapshot
Quickly Excluding K2,r from Planar Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/39.2.133openalex-snapshot
On Multi-Label Linear Interval Routing Schemes
inferred← citeshttps://doi.org/10.1109/12.9731openalex-snapshot
Space-efficient and fault-tolerant message routing in outerplanar networks
inferred← citeshttps://doi.org/10.1109/71.841748openalex-snapshot
An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing
inferred← citeshttps://doi.org/10.1109/cyberc.2011.43openalex-snapshot
Recognizing and Embedding Outerplanar Distributed Computer Networks
inferred← citeshttps://doi.org/10.1109/icdcs.1996.507969openalex-snapshot
Distance routing on series parallel networks
inferred← citeshttps://doi.org/10.1109/icecs.1996.584487openalex-snapshot
Routing with compact routing tables
inferred← citeshttps://doi.org/10.1109/infcom.2003.1208705openalex-snapshot
Exploring the trade-off between label size and stack depth in MPLS routing
inferred← citeshttps://doi.org/10.1109/infocom.2008.76openalex-snapshot
Reducing Maximum Stretch in Compact Routing
inferred← citeshttps://doi.org/10.1109/ipps.1991.153756openalex-snapshot
Routing algorithms in interval and circular-arc networks
inferred← citeshttps://doi.org/10.1109/ipps.1994.288250openalex-snapshot
Encapsulating networks and routing
inferred← citeshttps://doi.org/10.1109/korus.2004.1555266openalex-snapshot
A novel approach to improve the performance of MLSP-based VPN
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63517openalex-snapshot
Using cellular graph embeddings in solving all pairs shortest paths problems
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959889openalex-snapshot
Traveling with a Pez dispenser (or, routing issues in MPLS)
inferred← citeshttps://doi.org/10.1109/spdp.1993.395494openalex-snapshot
An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing
inferred← citeshttps://doi.org/10.1137/0218058openalex-snapshot
Efficient Message Routing in Planar Networks
inferred← citeshttps://doi.org/10.1137/0219011openalex-snapshot
Space-Efficient Message Routing in c -Decomposable Networks
inferred← citeshttps://doi.org/10.1137/0405013openalex-snapshot
Routing with Polynomial Communication-Space Trade-Off
inferred← citeshttps://doi.org/10.1137/070703041openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1137/1.9781611976489.3openalex-snapshot
ReNets: Statically-Optimal Demand-Aware Networks
inferred← citeshttps://doi.org/10.1137/s0097539702409927openalex-snapshot
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
inferred← citeshttps://doi.org/10.1137/s0895480197328631openalex-snapshot
The Compactness of Interval Routing
inferred← citeshttps://doi.org/10.1142/s0129054117500046openalex-snapshot
Interval Routing Schemes for Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1145/102782.102788openalex-snapshot
Planar graph decomposition and all pairs shortest paths
inferred← citeshttps://doi.org/10.1145/1146381.1146411openalex-snapshot
Object location using path separators
inferred← citeshttps://doi.org/10.1145/197917.198095openalex-snapshot
A characterization of networks supporting linear interval routing
inferred← citeshttps://doi.org/10.1145/197917.198100openalex-snapshot
The virtual path layout problem in fast networks (extended abstract)
inferred← citeshttps://doi.org/10.1145/1989493.1989526openalex-snapshot
Sparse spanners vs. compact routing
inferred← citeshttps://doi.org/10.1145/215399.215433openalex-snapshot
Space-efficient routing in vertex-symmetric networks (extended abstract)
inferred← citeshttps://doi.org/10.1145/224964.224989openalex-snapshot
Memory requirement for universal routing schemes
inferred← citeshttps://doi.org/10.1145/237502.237541openalex-snapshot
Local memory requirement of universal routing schemes
inferred← citeshttps://doi.org/10.1145/248052.248075openalex-snapshot
Memory requirement for routing in distributed networks
inferred← citeshttps://doi.org/10.1145/277697.277702openalex-snapshot
Compact routing schemes with low stretch factor (extended abstract)
inferred← citeshttps://doi.org/10.1145/2915183openalex-snapshot
On Hierarchical Routing in Doubling Metrics
inferred← citeshttps://doi.org/10.1145/335305.335359openalex-snapshot
Shortest path queries in planar graphs
inferred← citeshttps://doi.org/10.1145/343477.343503openalex-snapshot
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
inferred← citeshttps://doi.org/10.1145/3717823.3718312openalex-snapshot
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
inferred← citeshttps://doi.org/10.1145/568438.568451openalex-snapshot
Routing in distributed networks
inferred← citeshttps://doi.org/10.1145/65950.65953openalex-snapshot
A trade-off between space and efficiency for routing tables
inferred← citeshttps://doi.org/10.1145/73007.73053openalex-snapshot
Compact distributed data structures for adaptive routing
inferred← citeshttps://doi.org/10.1184/r1/6619763openalex-snapshot
Routing, Disjoint Paths, and Classification (CMU-PDL-06-109)
inferred← citeshttps://doi.org/10.3166/tsi.30.485-513openalex-snapshot
Routage compact optimal dans les (k, r)-constellations
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.36openalex-snapshot
Compact Oblivious Routing in Weighted Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1303.0728openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1904.03263openalex-snapshot
ReNets: Toward Statically Optimal Self-Adjusting Networks
inferred← citeshttps://doi.org/10.5555/1070432.1070540openalex-snapshot
On hierarchical routing in doubling metrics
inferred← citeshttps://doi.org/10.7155/jgaa.00325openalex-snapshot
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
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.