On the public citation graph
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks
0 signed · 58 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-61680-2_75openalex-snapshot
Efficient wavelength routing on directed fiber trees
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1080/01468039308204220openalex-snapshot
All-optical implementations for high-capacity TDMA networks
inferredcites →https://doi.org/10.1109/hicss.1997.667220openalex-snapshot
Call scheduling in trees, rings and meshes
inferredcites →https://doi.org/10.1109/sfcs.1975.21openalex-snapshot
On the complexity of time table and multi-commodity flow problems
inferredcites →https://doi.org/10.1109/sfcs.1995.492585openalex-snapshot
Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/0602012openalex-snapshot
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
inferredcites →https://doi.org/10.1145/195058.195119openalex-snapshot
Efficient routing in all-optical networks
inferredcites →https://doi.org/10.2748/tmj/1178243286openalex-snapshot
Weighted sums of certain dependent random variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11573036_6openalex-snapshot
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_13openalex-snapshot
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_8openalex-snapshot
Randomized Path Coloring on Binary Trees
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_4openalex-snapshot
Approximate Constrained Bipartite Edge Coloring
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_60openalex-snapshot
Fractional Path Coloring with Applications to WDM Networks
inferred← citeshttps://doi.org/10.1007/978-1-4757-3762-2_5openalex-snapshot
Planning Self-Healing Ring Capacity under Demand Uncertainty
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_45openalex-snapshot
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_7openalex-snapshot
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_14openalex-snapshot
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_5openalex-snapshot
Line System Design and a Generalized Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_6openalex-snapshot
Wavelength Management in WDM Rings to Maximize the Number of Connections
inferred← citeshttps://doi.org/10.1007/s00453-009-9278-3openalex-snapshot
Fractional Path Coloring in Bounded Degree Trees with Applications
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.017openalex-snapshot
Path problems in generalized stars, complete graphs, and brick wall graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.037openalex-snapshot
On packing and coloring hyperedges in a cycle
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.011openalex-snapshot
Nash equilibria in all-optical networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.08.001openalex-snapshot
Minimizing maximum fiber requirement in optical networks
inferred← citeshttps://doi.org/10.1016/j.osn.2015.09.004openalex-snapshot
Elastic optical ring with flexible spectrum ROADMs: An optical switching architecture for future data center networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00237-2openalex-snapshot
On the computational complexity of strong edge coloring
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00003-8openalex-snapshot
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00101-3openalex-snapshot
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00310-3openalex-snapshot
Randomized path coloring on binary trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00152-8openalex-snapshot
The complexity of path coloring and call scheduling
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00259-8openalex-snapshot
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1017/s0963548306007735openalex-snapshot
List Set Colouring: Bounds and Algorithms
inferred← citeshttps://doi.org/10.1023/a:1020906917222openalex-snapshot
Comparing Heuristics for Demand Routing and Slot Assignment on Ring Networks
inferred← citeshttps://doi.org/10.1023/a:1026158611840openalex-snapshot
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxt050openalex-snapshot
A Packing Problem Approach to Lightpath Assignment in an Optical Ring
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189117openalex-snapshot
Lightpath assignment for multifibers WDM networks with wavelength translators
inferred← citeshttps://doi.org/10.1109/icc.2002.997356openalex-snapshot
Cost optimal optical ring design with ring-interworking constraints
inferred← citeshttps://doi.org/10.1109/infcom.2005.1497910openalex-snapshot
Bounds on fiber minimization in optical networks with fixed fiber capacity
inferred← citeshttps://doi.org/10.1109/infocom.2006.164openalex-snapshot
Complexity of Wavelength Assignment in Optical Network Optimization
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358419openalex-snapshot
Routing in all-optical ring networks revisited
inferred← citeshttps://doi.org/10.1109/tnet.2009.2014226openalex-snapshot
Complexity of Wavelength Assignment in Optical Network Optimization
inferred← citeshttps://doi.org/10.1137/06067660xopenalex-snapshot
Wavelength Management in WDM Rings to Maximize the Number of Connections
inferred← citeshttps://doi.org/10.1137/s0895480101386723openalex-snapshot
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
inferred← citeshttps://doi.org/10.25549/usctheses-c16-479300openalex-snapshot
Contributions to efficient vector quantization and frequency assignment design and implementation
inferred← citeshttps://doi.org/10.3929/ethz-a-004832472openalex-snapshot
On the design and operation of high-performance optical networks
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2006.684openalex-snapshot
Periodic Metro Scheduling
inferred← citeshttps://doi.org/10.5555/1283383.1283476openalex-snapshot
Island hopping and path colouring with applications to WDM network design
inferred← citeshttps://doi.org/10.70675/392f856cz5e14z4c84za45bz06b027cbc2a6openalex-snapshot
Algorithmes exacts et approchés pour l'ordonnancement des travaux multiressources à intervalles fixes dans des systèmes distribués : approche monocritère et multiagent
inferred← citeshttps://doi.org/10.70675/6bfbd981zab8fz4b87zb688zfcbeee4e4a2fopenalex-snapshot
Deterministic scheduling of periodic datagrams for low latency in 5G and beyond
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.