| 2002 |
|---|
| 5 | EE | Eran Halperin,
Ram Nathaniel,
Uri Zwick:
Coloring k-colorable graphs using relatively small palettes.
J. Algorithms 45(1): 72-90 (2002) |
| 2001 |
|---|
| 4 | EE | Eran Halperin,
Ram Nathaniel,
Uri Zwick:
Coloring k-colorable graphs using smaller palettes.
SODA 2001: 319-326 |
| 3 | EE | Michael Krivelevich,
Ram Nathaniel,
Benny Sudakov:
Approximating coloring and maximum independent sets in 3-uniform hypergraphs.
SODA 2001: 327-328 |
| 2 | EE | Eran Halperin,
Ram Nathaniel,
Uri Zwick:
Coloring k-colorable graphs using relatively small palettes
CoRR cs.DS/0105029: (2001) |
| 1 | | Michael Krivelevich,
Ram Nathaniel,
Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.
J. Algorithms 41(1): 99-113 (2001) |
