On the public citation graph
Reserving resilient capacity for a single commodity with upper‐bound constraints
0 signed · 13 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.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1137/s0895480100368189openalex-snapshot
Reserving Resilient Capacity in a Network
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_93openalex-snapshot
New Approaches for Virtual Private Network Design
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_31openalex-snapshot
Building Edge-Failure Resilient Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_39openalex-snapshot
Algorithms for 2-Route Cut Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_20openalex-snapshot
Single-Sink Multicommodity Flow with Side Constraints
inferred← citeshttps://doi.org/10.1007/s11235-008-9139-4openalex-snapshot
Designing resilient networks using multicriteria metaheuristics
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.02.010openalex-snapshot
Instantaneous recovery of unicast connections in transport networks: Routing versus coding
inferred← citeshttps://doi.org/10.1109/tnet.2010.2091424openalex-snapshot
Robust Network Codes for Unicast Connections: A Case Study
inferred← citeshttps://doi.org/10.1109/uksim.2008.31openalex-snapshot
Building Multiobjective Resilient Networks (Invited Paper)
inferred← citeshttps://doi.org/10.1137/060654827openalex-snapshot
New Approaches for Virtual Private Network Design
inferred← citeshttps://doi.org/10.5555/1070432.1070566openalex-snapshot
An improved approximation algorithm for virtual private network design
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.