On the public citation graph
On Space Information Flow: Single multicast
0 signed · 27 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/0012-365x(93)e0183-5openalex-snapshot
Steiner minimal trees on regular polygons with centre
inferredcites →https://doi.org/10.1080/00401706.1968.10490578openalex-snapshot
Introduction to Operations Research
inferredcites →https://doi.org/10.1109/infcom.2007.35openalex-snapshot
Min-Cost Multicast of Selfish Information Flows
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/netcod.2012.6261881openalex-snapshot
A geometric framework for investigating the multiple unicast network coding conjecture
inferredcites →https://doi.org/10.1109/tit.2006.874515openalex-snapshot
On achieving maximum multicast throughput in undirected networks
inferredcites →https://doi.org/10.1109/tit.2008.2011435openalex-snapshot
Density Evolution for Nonbinary LDPC Codes Under Gaussian Approximation
inferredcites →https://doi.org/10.1109/tit.2008.2011516openalex-snapshot
A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks
inferredcites →https://doi.org/10.1109/tit.2011.2173720openalex-snapshot
Bounding the Coding Advantage of Combination Network Coding in Undirected Networks
inferredcites →https://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferredcites →https://doi.org/10.17077/etd.x06rk59iopenalex-snapshot
Exact and heuristic algorithms for the Euclidean Steiner tree problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-66628-0_45openalex-snapshot
Constrained Space Information Flow
inferred← citeshttps://doi.org/10.1007/978-981-10-3969-0_29openalex-snapshot
Area Constrained Space Information Flow
inferred← citeshttps://doi.org/10.1109/csa.2015.11openalex-snapshot
A Heuristic Algorithm on Space Information Flow
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/focs46700.2020.00053openalex-snapshot
Network Coding Gaps for Completion Times of Multiple Unicasts
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037014openalex-snapshot
A recursive partitioning algorithm for space information flow
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848807openalex-snapshot
A Delaunay Triangulation Approach to Space Information Flow
inferred← citeshttps://doi.org/10.1109/iccsnt.2015.7490930openalex-snapshot
Algorithm on multicast network coding in 3-D Euclidean space
inferred← citeshttps://doi.org/10.1109/infcomw.2014.6849294openalex-snapshot
Congestion-aware internet pricing for media streaming
inferred← citeshttps://doi.org/10.1109/tit.2014.2308998openalex-snapshot
A Geometric Perspective to Multiple-Unicast Network Coding
inferred← citeshttps://doi.org/10.1371/journal.pone.0193350openalex-snapshot
Exact and heuristic algorithms for Space Information Flow
inferred← citeshttps://doi.org/10.3390/s17040902openalex-snapshot
Connectivity Restoration in Wireless Sensor Networks via Space Network Coding
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.