On the public citation graph
Graphs with Bounded Induced Distance
0 signed · 24 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-58218-5_34openalex-snapshot
Dominating cliques in distance-hereditary graphs
inferredcites →https://doi.org/10.1007/3-540-61576-8_72openalex-snapshot
Weighted connected domination and Steiner trees in distance-hereditary graphs
inferredcites →https://doi.org/10.1007/bf01762113openalex-snapshot
Designing networks with compact routing tables
inferredcites →https://doi.org/10.1016/0095-8956(86)90043-2openalex-snapshot
Distance-hereditary graphs
inferredcites →https://doi.org/10.1016/0166-218x(90)90131-uopenalex-snapshot
Completely separable graphs
inferredcites →https://doi.org/10.1093/qmath/28.4.417openalex-snapshot
A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
inferredcites →https://doi.org/10.1109/tcom.1979.1094552openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.1109/tcom.1980.1094690openalex-snapshot
Routing Techniques Used in Computer Communication Networks
inferredcites →https://doi.org/10.1109/tcom.1980.1094721openalex-snapshot
The New Routing Algorithm for the ARPANET
inferredcites →https://doi.org/10.1137/0217032openalex-snapshot
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
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-40064-8_10openalex-snapshot
Networks with Small Stretch Number (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_22openalex-snapshot
Survivable Networks with Bounded Delay: The Edge Failure Case
inferred← citeshttps://doi.org/10.1016/j.jda.2009.11.002openalex-snapshot
Distance-hereditary digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00227-4openalex-snapshot
Graphs with bounded induced distance
inferred← citeshttps://doi.org/10.7287/peerj-cs.627v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Getting new algorithmic results by extending distance-hereditary graphs via split composition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.627v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Getting new algorithmic results by extending distance-hereditary graphs via split composition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.627v0.1/reviews/3openalex-snapshot
Peer Review #3 of "Getting new algorithmic results by extending distance-hereditary graphs via split composition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.627v0.1/reviews/4openalex-snapshot
Peer Review #4 of "Getting new algorithmic results by extending distance-hereditary graphs via split composition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.627v0.2/reviews/3openalex-snapshot
Peer Review #3 of "Getting new algorithmic results by extending distance-hereditary graphs via split composition (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.627openalex-snapshot
Getting new algorithmic results by extending distance-hereditary graphs via split composition
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.