@article {IOPORT.05281948,
    author       = {Narayanaswamy, N.S. and Babu, R.Subhash},
    title        = {A note on first-fit coloring of interval graphs.},
    year         = {2008},
    journal      = {Order},
    volume       = {25},
    number       = {1},
    issn         = {0167-8094},
    pages        = {49-53},
    publisher    = {Springer, Dordrecht},
    doi          = {10.1007/s11083-008-9076-6},
    abstract     = {Summary: We apply the Column Construction Method [{\it K. Varadarajan}, {\it S. V. Pemmaraju}, and {\it S. Raman}, Buffer minimization using max-coloring, In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium On Discrete Algorithms, New Orleans, 11--14 January 2004, 562 -- 571 (2004)] to a minimal clique cover of an interval graph to obtain a new proof that First-Fit is 8-competitive for online coloring interval graphs. This proof also yields a new discovery that in each minimal clique cover of an interval graph $G$, there is a clique of size $\frac{\omega(G)}{8}$.},
    identifier   = {05281948},
}