 | 2007 |
|---|
| 5 |       | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the minimum load coloring problem.
J. Discrete Algorithms 5(3): 533-545 (2007) |
| 2005 |
|---|
| 4 | | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Ales Prívetivý,
Anand Srivastav:
On the Minimum Load Coloring Problem.
WAOA 2005: 15-26 |
| 2004 |
|---|
| 3 |  | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
CTW 2004: 16-20 |
| 2 | | Nitin Ahuja,
Andreas Baltz,
Benjamin Doerr,
Anand Srivastav:
Coloring Graphs with Minimal Edge Load.
Electronic Notes in Discrete Mathematics 17: 9-13 (2004) |
| 2002 |
|---|
| 1 | | Nitin Ahuja,
Anand Srivastav:
On Constrained Hypergraph Coloring and Scheduling.
APPROX 2002: 14-25 |
Data released under the ODC-BY 1.0 license — See also our legal information page