On the public citation graph

Distributed online frequency assignment in cellular networks

0 signed · 21 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/978-1-4615-2716-9_15openalex-snapshot
Design and Performance Analysis Of Algorithms for Channel Allocation in Cellular Networks
inferredcites →https://doi.org/10.1007/bf01294263openalex-snapshot
Coloring inductive graphs on-line
inferredcites →https://doi.org/10.1007/bf01762111openalex-snapshot
Competitive snoopy caching
inferredcites →https://doi.org/10.1007/s004530010067openalex-snapshot
Static Frequency Assignment in Cellular Networks
inferredcites →https://doi.org/10.1016/0012-365x(89)90096-4openalex-snapshot
An on-line graph coloring algorithm with sublinear performance ratio
inferredcites →https://doi.org/10.1016/0196-6774(92)90061-gopenalex-snapshot
Randomized online graph coloring
inferredcites →https://doi.org/10.1109/25.260758openalex-snapshot
Design and performance analysis of the algorithms for channel allocation in cellular networks
inferredcites →https://doi.org/10.1109/25.312792openalex-snapshot
A two-phase algorithm for frequency assignment in cellular mobile systems
inferredcites →https://doi.org/10.1109/25.533761openalex-snapshot
An adaptive local-search algorithm for the channel-assignment problem (CAP)
inferredcites →https://doi.org/10.1109/26.120164openalex-snapshot
Performance analysis of cellular networks
inferredcites →https://doi.org/10.1109/tcom.1978.1094082openalex-snapshot
A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s13226-024-00698-xopenalex-snapshot
Characterizations and Clique Coloring of Edge Intersection Graphs on a Triangular Grid
inferred← citeshttps://doi.org/10.1016/j.dam.2003.02.002openalex-snapshot
Worst-case analysis of a dynamic channel assignment strategy
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.014openalex-snapshot
Optimal L(3,2,1) -labeling of triangular lattice
inferred← citeshttps://doi.org/10.1109/cdc.2006.376821openalex-snapshot
Convergence of Distributed Learning Algorithms for Optimal Wireless Channel Allocation
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924944openalex-snapshot
Competitive analysis of on-line randomized call control in cellular networks
inferred← citeshttps://doi.org/10.1109/tvt.2011.2151891openalex-snapshot
Algorithms for Self-Organized Resource Allocation in Wireless Networks
inferred← citeshttps://doi.org/10.1109/wiopt.2006.1666484openalex-snapshot
A Self-Managed Distributed Channel Selection Algorithm for WLANs
inferred← citeshttps://doi.org/10.1145/341800.341807openalex-snapshot
Efficient on-line communication in cellular networks
inferred← citeshttps://doi.org/10.15623/ijret.2015.0401031openalex-snapshot
DISTRIBUTED DYNAMIC FREQUENCY ALLOCATION IN WIRELESS CELLULAR NETWORKS USING GRAPH MULTICOLORING
inferred← citeshttps://doi.org/10.5753/etc.2022.222476openalex-snapshot
Edge Intersection Graphs of Paths on a Triangular Grid
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.