1. Call control in rings;Adamy,2002
2. Routing and call control algorithms for ring networks;Anand,2003
3. Wavelength management in WDM rings to maximize the number of connections;Caragiannis,2007
4. On the k-coloring of intervals;Carlisle;Discrete Applied Mathematics,1995
5. H.N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in: Proceedings of the First Annual ACM–SIAM Symposium on Discrete Algorithms (SODA'90), 1990, pp. 434–443