Le cluster Klaus Jansen - Thomas Erlebach
| 000299 (1993) | Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche] | Scheduling with incompatible jobs |
| 000302 (1993) | Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche] | Maximum covering with D cliques |
| 000260 (1997) | Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Off-line and on-line call-scheduling in stars and trees |
| 000262 (1997) | Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Constrained bipartite edge coloring with applications to wavelength routing |
| 000300 (1993) | Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] | On the complexity of scheduling incompatible jobs with unit-times |
| 000303 (1993) | Klaus Jansen ; Petra Scheffler | Generalized coloring for tree-like graphs |
| 000255 (1997) | Klaus Jansen [Allemagne] | The optimum cost chromatic partition problem |
| 000264 (1997) | Klaus Jansen [Allemagne] | Approximation results for the optimum cost chromatic partition problem |
| 000268 (1997) | Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne] | A new approximation algorithm for the register allocation problem |
| 000293 (1994) | Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne] | The minimum broadcast time problem |
| 000301 (1993) | Klaus Jansen [Allemagne] | On scheduling problems restricted to interval orders |
| This area was generated with Dilib version V0.6.31. |  |