Suchergebnisse - Jansen, Klaus

Approximation results for the optimum cost chromatic partition problem

von Jansen, Klaus

Approximation results for wavelength routing in directed binary trees

von Jansen, Klaus

Exploiting the structure of incompatibility graphs in high level synthesis

von Jansen, Klaus

The disjoint cliques problem

von Jansen, Klaus, Scheffler, Petra, Woeginger, Gerhard J. 1964-2022

The complexity of detecting crossingfree configurations in the plane

von Jansen, Klaus, Woeginger, Gerhard J. 1964-2022

Scheduling with incompatible jobs

von Bodlaender, Hans L. 1960-, Jansen, Klaus 1961-, Woeginger, Gerhard J. 1964-2022

On the complexity of a licence constrained job assignment problem

von Jansen, Klaus

Restrictions of graph partition problems

Band 1

von Bodlaender, Hans L., Jansen, Klaus

On the complexity of the maximum cut problem

von Bodlaender, Hans L., Jansen, Klaus

The interconnection problem

von Jansen, Klaus

Processor optimization for flow graphs

von Jansen, Klaus

An optimal greedy algorithm for wavelength allocation in directed tree networks

von Erlebach, Thomas 1970-, Jansen, Klaus

Complexity results for the optimum cost chromatic partition problem

von Jansen, Klaus

Approximation algorithms for time constrained scheduling

von Jansen, Klaus, Öhring, Sabine

Analyse of scheduling problems with typed task systems

von Jansen, Klaus

Transfer flow graphs

von Jansen, Klaus

The allocation problem in hardware design

von Jansen, Klaus

Röntgenvergrößerung: Probleme d. Aufnahmetechnik u. d. Interpretation d. Röntgenbilder

von Jansen, Klaus-Bert

Approximative Algorithmen und Nichtapproximierbarkeit

von Jansen, Klaus 1937-, Margraf, Marian

Inhaltsverzeichnis

A rainbow about T-colorings for complete graphs

von Jansen, Klaus