Klaus Helling < Klaus Jansen < Klaus Kornwachs

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 23.
[0-20] [0 - 20][0 - 23][20-22][20-40]

Ident.	Authors (with country if any)	Title
000F16 (1997)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne]	Generalized coloring for tree-like graphs
000F27 (1997)	Klaus Jansen [Allemagne]	The optimum cost chromatic partition problem
000F48 (1997)	Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne]	Off-line and on-line call-scheduling in stars and trees
000F63 (1997)	Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne]	Constrained bipartite edge coloring with applications to wavelength routing
000F68 (1997)	Klaus Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
000F69 (1997)	Klaus Jansen [Allemagne] ; Sabine Öhring	Approximation Algorithms for Time Constrained Scheduling
000F78 (1997)	Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]	A new approximation algorithm for the register allocation problem
001011 (1996)	Klaus Jansen [Allemagne]	A rainbow about T -colorings for complete graphs
001086 (1995)	Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche] ; Zhongliang Yu [Autriche, République populaire de Chine]	UET-scheduling with chain-type precedence constraints
001087 (1995)	Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne]	The minimum broadcast time problem for several processor networks
001094 (1995)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	Restrictions of graph partition problems. Part I
001197 (1994)	Klaus Jansen [Allemagne]	On the complexity of allocation problems in high-level synthesis
001222 (1994)	Klaus Jansen [Allemagne]	An approximation algorithm for the license and shift class design problem
001229 (1994)	Klaus Jansen [Allemagne] ; Haiko Müller [Allemagne]	The minimum broadcast time problem
001282 (1993)	Klaus Jansen [Allemagne]	Scheduling with constrained processor allocation for interval orders
001310 (1993)	Klaus Jansen [Allemagne, Autriche] ; Gerhard J. Woeginger [Allemagne, Autriche]	The complexity of detecting crossingfree configurations in the plane
001315 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne] ; Gerhard J. Woeginger [Autriche]	Scheduling with incompatible jobs
001323 (1993)	Hans L. Bodlaender [Pays-Bas] ; Klaus Jansen [Allemagne]	On the complexity of scheduling incompatible jobs with unit-times
001326 (1993)	Klaus Jansen [Allemagne]	On scheduling problems restricted to interval orders
001328 (1993)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]	Maximum covering with D cliques
001334 (1993)	Klaus Jansen ; Petra Scheffler	Generalized coloring for tree-like graphs

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Author.i -k "Klaus Jansen" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Author.i  \
                -Sk "Klaus Jansen" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Author.i
   |clé=    Klaus Jansen
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024