K. Jahnke < K. Jansen < K. Johansen

Facettes :

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
002655 (1998)	K. Jansen [Allemagne] ; J. Reiter [Allemagne]	An approximation algorithm for the register allocation problem
002791 (1998)	K. Jansen [Allemagne] ; J. Reiter [Allemagne]	An approximation algorithm for the register allocation problem
002975 (1997)	K. Jansen [Allemagne]	The optimum cost chromatic partition problem
002A14 (1997)	T. Erlebach [Allemagne] ; K. Jansen [Allemagne]	Off-line and on-line call-scheduling in stars and trees
002A34 (1997)	K. Jansen [Allemagne] ; P. Scheffler [Allemagne]	Generalized coloring for tree-like graphs
002A49 (1997)	C. Kaklamanis [Grèce] ; P. Persiano [Italie] ; T. Erlebach [Allemagne] ; K. Jansen [Allemagne]	Constrained bipartite edge coloring with applications to wavelength routing
002A56 (1997)	K. Jansen [Allemagne]	Approximation results for the optimum cost chromatic partition problem
002A57 (1997)	K. Jansen [Allemagne] ; S. Öhring [États-Unis]	Approximation algorithms for time constrained scheduling
002A69 (1997)	K. Jansen [Allemagne] ; J. Reiter [Allemagne]	A new approximation algorithm for the register allocation problem
002E40 (1995)	H. L. Bodlaender [Pays-Bas] ; J. S. Deogun [États-Unis] ; K. Jansen [Allemagne] ; T. Kloks [Pays-Bas] ; D. Kratsch [Allemagne] ; H. Müller [Allemagne] ; Zs. Tuza [Hongrie]	Rankings of graphs
002E97 (1995)	K. Jansen [Allemagne] ; G. J. Woeginger ; ZHONGLIANG YU	UET-scheduling with chain-type precedence constraints
002E99 (1995)	K. Jansen [Allemagne] ; H. Müller	The minimum broadcast time problem for several processor networks
003065 (1994)	K. Jansen [Allemagne]	On the complexity of allocation problems in high-level synthesis
003079 (1994)	K. Jansen [Allemagne]	An approximation algorithm for the license and shift class design problem
003210 (1993)	K. Jansen [Allemagne]	Transfer flow graphs
003212 (1993)	K. Jansen [Allemagne]	The interconnection problem
003215 (1993)	K. Jansen [Allemagne]	The allocation problem in hardware design
003224 (1993)	K. Jansen [Allemagne]	Scheduling with constrained processor allocation for interval orders
003250 (1993)	K. Jansen [Allemagne]	Bounds for the general capacitated routing problem
003374 (1992)	K. Jansen [Allemagne]	Processor optimization for flow graphs
003391 (1992)	K. Jansen [Allemagne]	An approximation algorithm for the general routing problem

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Merge

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Merge/Author.i -k "K. Jansen" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Merge/Author.i  \
                -Sk "K. Jansen" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Merge/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Merge
   |type=    indexItem
   |index=    Author.i
   |clé=    K. 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