A heuristic for the general routing problem, Information Processing Letters, 41, 1992, 333-339.

Processor-optimization for flow graphs, Theoretical Computer Science 104 ,1992, 285-298.

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

Scheduling with constrained processor allocation for interval orders, Computers and Operations Research 20, 1993, 587-595.

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

The allocation problem in hardware-design, Discrete Applied Mathematics 43, 1993, 37-46.

Transfer flow graphs, Discrete Mathematics 115, 1993, 187-199.

One strike against the min-max degree triangulation problem, Computational Geometry 3, 1993, 107-120. (gzipped ps-file)

The complexity of detecting crossingfree configurations in the plane (Coauthor: G.J. Woeginger, Graz), BIT 33, 1993, 580-595. (gzipped ps-file)

Scheduling of incompatible jobs on unrelated machines, International Journal of Foundations of Computer Science 4, 1993, 275-291.

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

An approximation algorithm for the licence and shift class design problem, European Journal of Operational Research 73, 1994, 127-131. (gzipped ps-file)

Analyse of scheduling problems with typed task systems, Discrete Applied Mathematics 52, 1994, 223-232.

Integral flow with disjoint bundles, Nordic Journal of Computing 1, 1994, 264-267.

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

Scheduling with incompatible jobs (Coauthors: H.L. Bodlaender, Utrecht and G. Woeginger, Graz), Discrete Applied Mathematics 55, 1994, 219-232.

Scheduling of conditional executed jobs on unrelated processors, Discrete Applied Mathematics 61, 1995, 245-255.

UET scheduling with chain-type precedence constraints (Coauthors: G.J. Woeginger and Z. Yu, Graz), Computers and Operations Research 22, 1995, 915-920. (gzipped ps-file)

The minimum broadcast time problem for several processor networks (Coauthor: H. Müller), Theoretical Computer Science 147, 1995, 69-85.

Restrictions of graph partition problems (Coauthor: H.L. Bodlaender), Theoretical Computer Science 148, 1995, 93-109.

A rainbow about $T$-colorings for complete graphs, Discrete Mathematics 154, 1996, 129-140.

The disjoint clique problem (Coauthoress: P. Scheffler and coauthor G.J. Woeginger), RAIRO Operations Research 31, 1997, 45-66.

Generalized coloring for tree-like graphs, (Coauthoress: P. Scheffler), Discrete Applied Mathematics 75, 1997, 135-155.

Approximation algorithms for time constrained scheduling, (Coauthoress: S. Öhring), Information and Computation 132, 1997, 85-108.

Ranking of graphs, (Coauthors: H.L. Bodlaender, J.S. Deogun, T. Kloks, D. Kratsch, H. Müller, and Z. Tuza), SIAM Journal on Discrete Mathematics 11, 1998, 168-181.

Approximation algorithms for the register allocation problem, (Coauthor: J. Reiter), Integration, the VLSI Journal 25, 1998, 89-102.

Directed tree networks, (Coauthors: T. Erlebach, C. Kaklamanis und G. Persiano), to appear in: Encyclopedia of Optimization, C.A. Floudas, P.M. Pardalos (eds.), Kluwer Academic Publisher. (gzipped ps-file)

An approximation scheme for bin packing with conflicts, Journal of Combinatorial Optimization 3, 1999, 363-377.

Optimal wavelength routing on directed fiber trees, (Coauthors: T. Erlebach, München, C. Kaklamanis, M. Mihail, P. Persiano), Theoretical Computer Science, Special Issue of ICALP 97, 221 (1999), 119-137.

Approximation results for the optimum cost chromatic partition problem, Journal of Algorithms 34 (2000), 54-89.

The complexity of call-scheduling, (Coauthor: T. Erlebach), Theoretical Computer Science 255 (2001), 33-50. (gzipped ps-file)

On the complexity of the maximum cut problem, (Coauthor: H.L. Bodlaender), Nordic Journal of Computing 7 (2000), 14-31.

Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks, (Coauthor: T. Erlebach), ACM Journal of Experimental Algorithms 4 (1999).

Linear time approximation schemes for scheduling mallable tasks, (Coauthor; L. Porkolab), to appear in: Algorithmica.

Improved approximation schemes for scheduling unrelated parallel machines, (Coauthor: L.Porkolab), to appear in: Mathematics of Operation Research.

Computing optimal preemptive schedules for parallel tasks: linear: linear programming approches, (Coauthor: Lorant Porkolab), to appear in: Mathematical Programming.

The mutal exclusion scheduling problem for permuation and comparability graphs, to appear in: Information and Computation.

The maximum edge-disjoint paths problem in bidireted paths, (Coauthor: T. Erlebach), to appear in: SIAM Journal on Discrete Mathematics.

Transformations of RT-descriptions guided by features of logic implementations to be verified, ABAKUS-Workshop, Innsbruck, 1988, 39-47.

An assignment problem for hardware design, Symposium Operations Research, Ulm 89, in: Methods of Operations Research 62, 1989, 263-272.

The processor optimization problem, OR Conference, Wien 90, in: Methods of Operations Research 64, 1990, 123-131.

Analysis of heuristics for the general capacitated routing problem, Proceedings Operations Research, W. Gaul, A. Bachem, W. Habenicht, W. Runge, W.W. Stahl (eds.), Stuttgart, Springer Verlag, 1991, 414-421.

Heuristics for several routing problems, Symposium Operations Research, P. Gritzmann, R. Hettich, R. Horst, E. Sachs (eds.), Trier, Springer Verlag, 1991, 156-159.

Allocation in hardware design, IFIP Workshop on Control Dominated Synthesis from a RTL description, Grenoble, 1992, 81-86.

On scheduling problems restricted to interval orders, Graph Theoretic Concepts in Computer Science, E.W. Mayr (ed.), Wiesbaden, LNCS, 657, 1992, 27-36. (gzipped ps-file)

Scheduling with incompatible jobs (Coauthors: H.L. Bodlaender and G. Woeginger), Graph Theoretic Concepts in Computer Science, E.W. Mayr (ed.), Wiesbaden, LNCS, 657, 1992, 37-49. (gzipped ps-file)

Some coloring results for tree like graphs (Coauthoress: P. Scheffler), Graph Theoretic Concepts in Computer Science, E.W. Mayr (ed.), Wiesbaden, LNCS, 657, 1992, 50-59. (gzipped ps-file)

Restrictions of graph partition problems (Coauthor: H.L. Bodlaender), Symposium Operations Research, A. Karmann, K. Mosler, M. Schader, G. Uebe (eds.), Hamburg, Springer Verlag, 1992, 105-108.

Maximum covering with D cliques (Coauthoress: P. Scheffler and coauthor G.J. Woeginger), Fundamentals of Computation Theory, Z. Esik (ed.), Szeged, LNCS, 710, 1993, 319-328. (gzipped ps-file)

On the complexity of scheduling incompatible jobs with unit-times, (Coauthor: H.L. Bodlaender), Mathematical Foundations of Computer Science, S. Sokolowski (ed.), Gdansk, LNCS, 711, 1993, 291-300. (gzipped ps-file)

The maximum $k$-dependent and $f$-dependent set problem, (Coauthors: A. Dessmark and A. Lingas), Algorithms and Computation, K.W. Ng, P. Raghavan, N.V. Balasubramanian, F.Y.L. Chin (eds.), Hongkong, LNCS, 762, 1993, 88-97. (gzipped ps-file)

A rainbow about $T$-colorings for complete graphs, Graph Theoretic Concepts in Computer Science, J. van Leeuwen (ed.), Utrecht, LNCS, 790, 1993, 189-199. (gzipped ps-file)

On the complexity of the maximum cut problem, (Coauthor: H.L. Bodlaender), Symposium on Theoretical Aspects of Computer Science, P. Enjalbert, E.W. Mayr, K.W. Wagner (eds.), Caen, LNCS, 775, 1994, 769-780. (gzipped ps-file)

The minimum broadcast time problem on several processor networks (Coauthor: H. Müller), Parallel and distributed Computing - theory and practice, M. Cosnard, A. Ferreira, J. Peters (eds.), Montreal, LNCS, 805, 1994, 219-234.(gzipped ps-file)

Ranking of graphs (Coauthors: H.L. Bodlaender, J.S. Deogun, T. Kloks, D. Kratsch, H. Müller and Z. Tuza), Graph Theoretic Concepts in Computer Science, G. Tinhofer (ed.), München, LNCS, 903, 1994, 292-304.(gzipped ps-file)

Approximation algorithms for time constrained scheduling (Coauthoress: S. Öhring), Parallel Algorithms for Irregularly Structured Problems, A. Ferreira, J. Rolim (eds.), Lyon, LNCS, 980, 1995, 143-158. (gzipped ps-file)

Scheduling of virtual connections in fast networks (Coauthor: T. Erlebach), Parallel Systems and Algorithms, PASA 96, F. Hoßfeld, E. Maehle and E.W. Mayr (eds.), Jülich, World Scientific, 1996, 13-32. (gzipped ps-file)

Call scheduling in trees, rings and meshes (Coauthor: T. Erlebach), Hawaii International Conference on System Sciences HICSS 30, 1997, Vol. 1, 221-222. (gzipped ps-file)

The optimum cost chromatic partition problem, Algorithms and Complexity CIAC 3, G. Bongiovanni, D.P. Bovet, G. Di Battista (eds.), Rome, LNCS, 1203, 1997, 25-36. (gzipped ps-file)

Approximation results for wavelength routing in directed trees, Workshop on Optics and Computer Science WOCS 2, P. Berthome, P. Marchand (eds.), Geneva, 1997. (gzipped ps-file)

A new approximation algorithm for the register allocation problem, (Coauthor: J. Reiter), Solving Irregularly Structured Problems in Parallel, IRREGULAR 97, G. Bilardi, A. Ferreira, R. Lüling, J. Rolim (eds.), Paderborn, LNCS, 1253, 1997, 135-146. (gzipped ps-file)

Constrained bipartite edge coloring with applications to wavelength routing, (Coauthors: C. Kaklamanis, G. Persiano and T. Erlebach), Automata, Languages and Programming, ICALP 97, P. Deagano, R. Gorrieri, A. Marchetti - Spaccamela (eds.), Bologna, LNCS, 1265, 1997, 493-504. (gzipped ps-file)

An optimal greedy algorithm for wavelength allocation in directed tree networks, (Coauthors: T. Erlebach, C. Kaklamanis, Patras und G. Persiano ), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 40, Network Design: Connectivity and Facilities Location P. M. Pardalos, D. Du (eds.), 1997, 117-130. (gzipped ps-file)

Approximation results for the optimum cost chromatic partition problem, Automata, Languages and Programming, ICALP 97, P. Deagano, R. Gorrieri, A. Marchetti - Spaccamela (eds.), Bologna, LNCS, 1256, 1997, 727-737, and DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 40, Network Design: Connectivity and Facilities Location P. M. Pardalos, D. Du (eds.), 1997, 143-168. (gzipped ps-file)

Off-line and on-line call scheduling in stars and trees, (Coauthor: T. Erlebach), Graph Theoretic Concepts in Computer Science, WG 97, R.M. Möhring (ed.), Berlin, LNCS, 1335, 1997, 199-213. (gzipped ps-file)

The mutual exclusion scheduling problem for permutation and comparability graphs, Symposium on Theoretical Aspects of Computer Science, STACS 98, M. Morvan, C. Meinel, D. Krob (eds.), Paris, LNCS, 1373, 1998, 287-297. (gzipped ps-file)

A new characterization of parity graphs and colorings with costs, Latin American Theoretical Informatics, LATIN 98, C.L. Lucchesi, A.V. Moura (eds.), Campinas, LNCS 1380, 1998, 249-260. (gzipped ps-file)

An approximation scheme for bin packing with conflicts, Skandinavian Workshop on Algorithm Theory, SWAT 98, S. Arnborg, L. Ivansson (eds.), Stockholm, LNCS 1432, 1998, 35-46. (gzipped ps-file)

Efficient implementation of an optimal greedy algorithm for wavelength assignment, (Coauthor: T. Erlebach), Workshop on Algorithm Engineering, K. Mehlhorn (ed.), WAE 98, Saarbrücken, 1998, 13-24. (gzipped ps-file)

Algorithms based on randomization and linear and semidefinite programming, (Coauthor: J. Rolim) , Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM 98, Branislav Rovan (ed.), Jasna, LNCS 1521, 1998, 122-134. (gzipped ps-file)

Maximizing the number of connections in optical tree networks, (Coauthor: T. Erlebach, ), International Symposium on Algorithms and Computation, ISAAC 98, K.Y. Chwa and O. H. Ibarra (eds.), Taejon, LNCS 1533, 1998, 179-188. (gzipped ps-file)

Linear time approximation schemes for scheduling problems, (Coauthor: L. Porkolab), 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 99, Baltimore, 1999, 490-498. (gzipped ps-file)

Improved approximation schemes for scheduling unrelated parallel machines, (Coauthor: L. Porkolab, ), 31st Annual ACM Symposium on Theory of Computing, STOC 99, Atlanta, 1999, 408-417. (gzipped ps-file)

Makespan minimization in job shops: a polynomial time approximation scheme, (Coauthors: R. Solis-Oba und M. Sviridenko), 31st Annual ACM Symposium on Theory of Computing, STOC 99, Atlanta, 1999, 394-399.(gzipped ps-file)

General multiprocessor task scheduling: approximate solutions in linear time, (Coauthor: L. Porkolab), WADS 99, Vancouver, LNCS 1663, 1999, 110-121. (gzipped ps-file)

A linear time approximation scheme for job shop scheduling, (Coauthors: R. Solis-Oba und M. Sviridenko), APPROX 99, Berkeley, LNCS 1671, 1999, 177-188. (gzipped ps-file)

Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem, (Coauthor: M. Sviridenko), 17th Symposium on Theoretical Aspects of Computer Science, STACS 2000, H. Reichel and S. Tison (eds), Lille, LNCS 1770, 2000, 455-565. (gzipped ps-file)

Approximation algorithms for flexible job shop problems, (Coauthors: M. Mastrolilli und R. Solis-Oba), 4th Latin American Theoretical Informatics, LATIN 2000, Punta del Este, LNCS 1776, 2000, 68-77. (gzipped ps-file)

Polynomial time approximation schemes for general multiprocessor job shop scheduling, (Coauthor: L. Porkolab), 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, U. Montanari, J. Rolim and E. Welzl (eds), Geneva, LNCS 1853, 2000, 878-889. (gzipped ps-file)

Conversion of coloring algorithms into maximum weight independent set algorithms, (Coauthor: T. Erlebach), Workshop on Approximation and Randomization Algorithms in Communication Networks, ARACNE 2000, J. Rolim et al. (eds), Geneva, Carleton Scientific, 2000, 135-146.(gzipped ps-file)

Parallel machine scheduling problems with controllable processing times, (Coauthor: M. Mastrolilli), Workshop on Approximation and Randomization Algorithms in Communication Networks, ARACNE 2000, J. Rolim et al. (eds), Geneva, Carleton Scientific, 2000, 179-190.(gzipped ps-file)

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees (Coauthor: T. Erlebach), to appear in: WAE 2000, Saarbrücken. (gzipped ps-file)

Preemptive scheduling on dedicated processors: applications of fractional graph coloring (Coauthor: L.Porkolab), MFCS 2000, M. Nielsen and B.Rovan (eds.), Bratislava, LNCS 1893, 2000, 446-455. (gzipped ps-file)

Preemptive parallel task scheduling in O(n)+poly(m) time (Coauthor: L.Porkolab), ISAAC 2000, D.T.Lee and S.H.Teng (eds.), Taipeh, LNCS 1969, 2000, 398-409.(gzipped ps-file)

Scheduling to minimize the average completion time of dedicated tasks (Coauthors: Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin and Claire Kenyon), FSTTCS 2000, S. Kapoor and S. Prasad (eds.), New Delhi, LNCS 1974, 2000, 454-464. (gzipped ps-file)

Polynomial-time approximation schemes for geometric graphs (Coauthors: Thomas Erlebach, Eike Seidel), SODA 2001, Washington, 671-679. (gzipped ps-file)

PTASs for MAX-BISECTION on planar and geometric graphs (Coauthors: Thomas Erlebach, Eike Seidel), STACS 01, A. Ferreire and H. Reichel (eds.), Dresden, LNCS 2010, 2001, 365-375(gzipped ps-file)

PTAS for scheduling general multiprocessor tasks (Coauthors: Aleksei V. Fishkin and Lorant Porkolab), to appear in: WEA 2001, (gzipped ps-file)

On minimizing average weighted completion time of multiprocessor tasks with release dates (Coauthors: Aleksei V. Fishkin and Lorant Porkolab), to appear in: ICALP 2001, (gzipped ps-file)

Grouping techniques for scheduling problems: simpler and faster (Coauthors: Aleksei V.Fishkin and Monaldo Mastrolilli), to appear in ESA 01, (gzipped ps-file)

Graph subcolorings: complexity and algorithms (Coauthors: J. Fiala, V.B. Le und E. Seidel), to appear in: WG 2001, Boltenhagen. (gzipped ps-file)

Approximation algorithms for fractional covering and packing problems, and applications, (invited talk), to appear in: FCT 2001, Riga. (gzipped ps-file)

Job shop scheduling problems with controllable processing times, (Coauthors: M. Mastrolilli, Lugano, and Roberto Solis-Oba, London), to appear in: ICTCS 2001, Torino.