Ram Nathaniel

According to our database, Ram Nathaniel authored at least 3 papers between 2001 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2002

Coloring k-colorable graphs using relatively small palettes.

Eran Halperin, Ram Nathaniel, Uri Zwick

J. Algorithms, 2002

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 smaller palettes.

Eran Halperin, Ram Nathaniel, Uri Zwick

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001