On the public citation graph

A geometric framework for investigating the multiple unicast network coding conjecture

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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/allerton.2009.5394800openalex-snapshot
On the multiple unicast network coding, conjecture
inferredcites →https://doi.org/10.1109/isit.2005.1523398openalex-snapshot
On the capacity of multiple unicast sessions in undirected graphs
inferredcites →https://doi.org/10.1109/isit.2007.4557213openalex-snapshot
The Capacity Region for Multi-source Multi-sink Network Coding
inferredcites →https://doi.org/10.1109/isit.2008.4595001openalex-snapshot
Network coding in star networks
inferredcites →https://doi.org/10.1109/isit.2012.6283071openalex-snapshot
Min-cost multicast networks in Euclidean space
inferredcites →https://doi.org/10.1109/isit.2012.6283627openalex-snapshot
Space information flow: Multiple unicast
inferredcites →https://doi.org/10.1109/tit.2006.874531openalex-snapshot
On the capacity of information networks
inferredcites →https://doi.org/10.1109/tnet.2003.818197openalex-snapshot
An algebraic approach to network coding
inferredcites →https://doi.org/10.1287/opre.11.3.344openalex-snapshot
Multi-Commodity Network Flows

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/dasc.2013.140openalex-snapshot
Cost Advantage of Network Coding in Space for Irregular (5 + 1) Model
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037014openalex-snapshot
A recursive partitioning algorithm for space information flow
inferred← citeshttps://doi.org/10.1109/icct.2012.6511406openalex-snapshot
Superiority of network coding in space for irregular polygons
inferred← citeshttps://doi.org/10.1109/isit.2012.6283627openalex-snapshot
Space information flow: Multiple unicast
inferred← citeshttps://doi.org/10.1109/isit.2015.7282478openalex-snapshot
On network coding advantage for multiple unicast networks
inferred← citeshttps://doi.org/10.1109/isit.2018.8437338openalex-snapshot
On the Langberg-Médard k-Unicast Conjecture with $k=3,4$
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173964openalex-snapshot
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619673openalex-snapshot
The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone
inferred← citeshttps://doi.org/10.1109/lcomm.2014.040214.140280openalex-snapshot
A Note on the Multiple-Unicast Network Coding Conjecture
inferred← citeshttps://doi.org/10.1109/netcod.2013.6570816openalex-snapshot
On Space Information Flow: Single multicast
inferred← citeshttps://doi.org/10.1109/tit.2022.3154230openalex-snapshot
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks
inferred← citeshttps://doi.org/10.3934/amc.2021001openalex-snapshot
An optimization approach to the Langberg-Médard multiple unicast conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3566openalex-snapshot
Performance Comparison between Network Coding in Space and Routing in Space
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.