Coloring k-colorable graphs using smaller palettes. - Eran Halperin; Ram Nathaniel; Uri Zwick (SODA, 2001)

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. - Michael Krivelevich; Ram Nathaniel; Benny Sudakov (J. Algorithms, 2001)

Coloring k-colorable graphs using relatively small palettes. - Eran Halperin; Ram Nathaniel; Uri Zwick (J. Algorithms, 2002)