Algorithms and Complexity Group

Publications in Journals (1992 - 1998)

Klaus Jansen
An approximation algorithm for the general routing problem
Information Processing Letters, 41, 333-339, 1992

Klaus Jansen
Processor-optimization for flow graphs
Theoretical Computer Science 104(2), 285-298, 1992

Klaus Jansen
The interconnection problem
Journal of Computer and System Science 46, 27-38, 1993

Klaus Jansen
Scheduling with constrained processor allocation for interval orders
Computers and Operations Research 20(6), 587-595, 1993

Klaus Jansen
Bounds for the general capacitated routing problem
Networks 23, 165-173, 1993

Klaus Jansen
The allocation problem in hardware-design
Discrete Applied Mathematics 43(1), 37-46, 1993

Klaus Jansen
Transfer flow graphs
Discrete Mathematics 115(1-3), 187-199, 1993

Klaus Jansen
One strike against the min-max degree triangulation problem
Computational Geometry 3, 107-120, 1993

Klaus Jansen and Gerhard Woeginger
The complexity of detecting crossingfree configurations in the plane 
BIT 33(4), 580-595, 1993

Klaus Jansen
Scheduling of incompatible jobs on unrelated machines
International Journal of Foundations of Computer Science 4(4), 275-291, 1993

Klaus Jansen
Exploiting the special structure of conflict graphs in high level synthesis
Commentationes Mathematicae Universitatis Carolinae 35(1) 155-167, 1994

Klaus Jansen
An approximation algorithm for the licence and shift class design problem
European Journal of Operational Research 73, 127-131, 1994

Klaus Jansen
Analysis of scheduling problems with typed task systems
Discrete Applied Mathematics 52(3), 223-232, 1994

Klaus Jansen
Integral flow with disjoint bundles
Nordic Journal of Computing 1(2), 264-267, 1994

Klaus Jansen
On the complexity of allocation problems in high-level synthesis
Integration, the VLSI Journal 17, 241-252, 1994

Hans L. Bodlaender, Klaus Jansen, and Gerhard Woeginger
Scheduling with incompatible jobs
Discrete Applied Mathematics 55(3), 219-232, 1994

Klaus Jansen
Scheduling of conditional executed jobs on unrelated processors
Discrete Applied Mathematics 61(3), 245-255, 1995

Klaus Jansen, Gerhard J. Woeginger, and Zhongliang Yu
UET scheduling with chain-type precedence constraints
Computers and Operations Research 22(9), 915-920, 1995

Klaus Jansen and Haiko Müller
The minimum broadcast time problem for several processor networks 
Theoretical Computer Science 147(1-2), 69-85, 1995

Klaus Jansen and Hans L. Bodlaender
Restrictions of graph partition problems 
Theoretical Computer Science 148(1), 93-109, 1995

Klaus Jansen
A rainbow about $T$-colorings for complete graphs
Discrete Mathematics 154(1-3), 129-139, 1996

Klaus Jansen, Petra Scheffler, and Gerhard J. Woeginger
The disjoint clique problem
RAIRO Operations Research 31, 45-66, 1997

Klaus Jansen and Petra Scheffler
Generalized coloring for tree-like graphs
Discrete Applied Mathematics 75(2), 135-155, 1997

Klaus Jansen and Sabine Öhring
Approximation algorithms for time constrained scheduling
Information and Computation 132(2), 85-108, 1997

Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, and Zsolt Tuza
Rankings of graphs
SIAM Journal on Discrete Mathematics 11(1), 168-181, 1998

Klaus Jansen and Joachim Reiter
Approximation algorithms for the register allocation problem
Integration, the VLSI Journal 25(2), 89-102, 1998

Klaus Jansen, Thomas Erlebach, Christos Kaklamanis, and Giuseppe Persiano
Directed tree networks
Encyclopedia of Optimization, Kluwer Academic Publisher