Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff
Trimming of graphs, with application to point labeling
Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science STACS 2008 ,
Bordeaux, France, February 21-23, 2008.

Florian Diedrich, Britta Kehden und Frank Neumann
Multi-objective problems in terms of relational algebra
Proceedings of the 10th International Conference on Relational Methods in Computer Science RelMiCS10 2008 ,
Frauenwörth, Germany, April 7-11, 2008.

Klaus Jansen and Roberto Solis-Oba
A polynomial time approximation scheme for the square packing problem
Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization IPCO 2008 ,
Bertinoro, Italy, May 26-28, 2008.

Klaus Jansen and Gouchuan Zhang
Maximizing the total profit of rectangles packed into a rectangle
Algorithmica 47 , April 2007, 323 - 342.

Florian Diedrich and Klaus Jansen
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science , volume 377 , issues 1-3, May 31, 2007, 181 - 204.

Janka Chlebíková and Klaus Jansen
The d-precoloring problem for k-degenerate graphs
Discrete Mathematics , volume 307, issue 16, 28 July 2007, 2042 - 2052.

Florian Diedrich and Klaus Jansen
An approximation algorithm for the general mixed packing and covering problem
International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007) ,
Hangzhou, China, April 07 - 09, 2007, Springer LNCS 4614 , 128 - 139.

Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
Approximation algorithms for 3D orthogonal knapsack
Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007) ,
Shanghai, China, May 22 - 25, 2007, Springer, LNCS 4484 , 34 - 45.

Klaus Jansen
Approximation algorithms for geometric intersection graphs
Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007) ,
Dornburg near Jena, Germany, June 21 - 23, 2007.

Klaus Jansen and Roberto Solis-Oba
New approximability results for 2-dimensional packing problems
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007) ,
Cesky Krumlov, Czech Republic, August 26 - 31, 2007.

Florian Diedrich and Ulrich Michael Schwarz
A framework for scheduling with online availability
13th International European Conference on Parallel and Distributed Computing (Euro-Par 2007) ,
Rennes, France, August 28 - 31, 2007, Springer LNCS 4641 , 205 - 213.

Ulrich Michael Schwarz
Tightness results for malleable task algorithms
Proceedings of the 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007) ,
Gdansk, Poland, September 9 - 12, 2007, Springer LNCS .

Florian Diedrich, Klaus Jansen, Fanny Pascual, und Denis Trystram
Approximation algorithms for scheduling with reservations
14th International Conference on High Performance Computing (HiPC 2007) ,
Goa, Indien, Dezember 18 - 21, 2007,Springer LNCS .

Klaus Jansen and Hu Zhang
An approximation algorithm for scheduling malleable tasks under general precedence constraints,
ACM Transactions on Algorithms , volume 2, number 3, July 2006, 416 - 434.

Klaus Jansen
An approximation algorithm for the general max-min resource sharing problem,
Mathematical Programming , volume 106, number 3, July 2006, 547 - 566.

Klaus Jansen
Approximation algorithm for the mixed fractional packing and covering problem,
SIAM Journal on Optimization , volume 17, 2006, 331 - 352.

Klaus Jansen and Lorant Porkolab
On preemptive resource constrained scheduling: polynomial time approximation schemes,
SIAM Journal on Discrete Mathematics , volume 20, 2006, 545 - 563.

Klaus Jansen and Roberto Solis-Oba
An asymptotic approximation algorithm for 3D-strip packing,
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2006) ,
Miami, Florida, USA, January 22 - 24, 2006.

Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff
A new approximation algorithm for labeling weighted points with sliding labels,
Proceedings of the 22nd European Workshop on Computational Geometry (EWCG 2006) ,
Delphi, Greece, March 27-29, 2006, 137-140.

Mihhail Aizatulin, Florian Diedrich, and Klaus Jansen
Implementation of approximation algorithms for the max-min resource sharing problem,
Proceedings of the 4th International Workshop on Experimental Algorithms (WEA 2006) ,
Menorca Island, Spain, May 24 - 27, 2006, Springer LNCS 4007 , 207 - 218.

Klaus Jansen, Monaldo Mastrollili, and Roberto Solis-Oba
Approximation algorithms for flexible job shop problems,
International Journal of Foundations of Computer Science , volume 16, issue 2, April 2005, 361-379.

Thomas Erlebach, Klaus Jansen, and Eike Seidel
Polynomial-time approximation schemes for geometric intersection graphs,
SIAM Journal on Computing , volume 34, issue 6, 2005, 1302-1323.

Klaus Jansen, Marek Karpinski, Andrzej Lingas, and Eike Seidel
Polynomial time approximation schemes for max-bisection on planar and geometric graphs,
SIAM Journal on Computing , volume 35, issue 1, 2005, 110-119.

Klaus Jansen and Lorant Porkolab
General multiprocessor task scheduling: approximate solutions in linear time,
SIAM Journal on Computing , volume 35, issue 3, 2005, 519-530.

Thomas Erlebach and Klaus Jansen
Conversion of coloring algorithms into maximum weight independent set algorithms,
Discrete Applied Mathematics , volume 148, issue 1 , 30 April 2005, 107-125.

Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba
Approximation schemes for job shop scheduling problems with controllable processing times,
European Journal of Operational Research , Volume 167, Issue 2 , 1 December 2005, 297-319.

Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, and Roberto Solis-Oba
On packing squares with resource augmentation: maximizing the profit,
Proceedings of Computing: The Australasian Theory Symposium (CATS 2005) ,
Newcastle, Australia, 30 January - 3 February, 2005, 61-67.

Klaus Jansen and Rob van Stee
On strip packing with rotations,
Proceedings of the 37th ACM Symposium on Theory of Computing (STOC 2005) ,
Baltimore, USA, May 21 - 24, 2005, 755-761.

Klaus Jansen and Hu Zhang
Scheduling malleable tasks with precedence constraints,
Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) ,
Las Vegas, NV, USA, July 17 - 20, 2005.

Aleksei Fishkin, Olga Gerber, Klaus Jansen, and Roberto Solis-Oba
Packing weighted rectangles into a square,
Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005) ,
Gdansk, Poland, August 29 - September 2, 2005.

Aleksei Fishkin, Klaus Jansen, S. Sevastianov, and R. Sitters
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delay,
Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005) ,
Mallorca, Spain, October 3-6, 2005.

Aleksei Fishkin, Olga Gerber, and Klaus Jansen
On efficient weighted rectangle packing with large resources,
Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005) ,
Sanya, Hainan, China, December 19 - 21, 2005.

Klaus Jansen and Hu Zhang
An approximation algorithm for scheduling malleable tasks under general precedence constraints,
Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005) ,
Sanya, Hainan, China, December 19 - 21, 2005.

Klaus Jansen
Scheduling malleable parallel tasks: an asymptotic fully polynomial-time approximation scheme,
Algorithmica 39 , January 2004, 59-81.

Klaus Jansen and Lorant Porkolab
Preemptive scheduling with dedicated processors: applications of fractional graph coloring,
Journal of Scheduling 7, January-February 2004, 35-48.

Klaus Jansen and Monaldo Mastrolilli
Approximation schemes for parallel machine scheduling problems with controllable processing times,
Computers and Operations Research 31, September 2004, 1565-1581.

Klaus Jansen and Guochuan Zhang
On rectangle packing: maximizing benefits,
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 ,
New Orleans, January 11-13, 2004, 204-213.

Miroslav Chlebík and Janka Chlebíková
On approximability of the independent set problem for low degree graphs,
Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO) 2004 ,
Smolenice Castle, Slovakia, June 21-23, 2004, LNCS , Springer.

Deshi Ye and Guochuan Zhang
On-line scheduling of parallel jobs,
Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO) 2004 ,
Smolenice Castle, Slovakia, June 21-23, 2004, LNCS , Springer.

Klaus Jansen and Guochuan Zhang
Maximizing the number of packed rectangles,
Proceedings of the 9th Scandinavian Workshop on Algorithm Theory ( SWAT 2004 ),
Humlebæk, Denmark, July 8-10, 2004, LNCS , Springer, 362-371.

Klaus Jansen
Approximation algorithms for the general max-min resource sharing problem: faster and simpler,
Proceedings of the 9th Scandinavian Workshop on Algorithm Theory ( SWAT 2004 ),
Humlebæk, Denmark, July 8-10, 2004, LNCS , Springer, 311-322.

Miroslav Chlebík and Janka Chlebíková
Improvement of nemhauser-trotter theorem and its applications in parametrized complexity,
Proceedings of the 9th Scandinavian Workshop on Algorithm Theory ( SWAT 2004 ),
Humlebæk, Denmark, July 8-10, 2004, LNCS , Springer.

Klaus Jansen
Approximation algorithms for mixed fractional packing and covering problems,
Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science , Toulouse, France, August 23-26, 2004, 223-236.

Olga Gerber, Aleksei V. Fishkin, and Klaus Jansen
On weighted rectangle packing with large resources,
Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science ,
Toulouse, France, August 23-26, 2004, 237-250.

Hu Zhang
Solving packing problem with weaker block solvers,
Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science ,
Toulouse, France, August 23-26, 2004.

Klaus Jansen
Approximation algorithms for mixed fractional packing and covering problems (invited talk),
Proceedings of the 2nd Workshop on Approximation and Online Algorith (WAOA 2004) ,
Bergen, Norway, September 14-17, 2004, Bergen, 2004, 6-7.

Klaus Jansen and Roberto Solis-Oba
An asymptotic fully polynomial time approximation scheme for bin covering.
Theoretical Computer Science 306, 2003, 543-551.

Jirí Fiala, Klaus Jansen, Van Bang Le, and Eike Seidel
Graph subcolorings: complexity and algorithms.
SIAM Journal on Discrete Mathematics 16(4), 2003, 635-650.

Klaus Jansen
The mutual exclusion scheduling problem for permutation and comparability graphs.
Information and Computation 180, 2003, 71-81.

Klaus Jansen and Lorant Porkolab
Computing optimal preemptive schedules for parallel tasks: linear programming approaches.
Mathematical Programming A 95, 2003, 617-630.

Klaus Jansen
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
Theoretical Computer Science 302, 2003, 239-256.

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
Makespan minimization in job shops: a linear time approximation scheme.
SIAM Journal on Discrete Mathematics 16, 2003, 288-300.

Guochuan Zhang, Xiao-Qiang Cai, and C.K. Wong
Optimal on-line algorithms for scheduling on parallel batch processing machines.
IIE Transactions on Scheduling and Logistics 35, 2003, 175-181.

Deshi Ye and Guochuan Zhang
On-line scheduling with extendable working time on a small number of machines.
Information Processing Letters 85, 2003, 171-177.

Aleksei Fishkin and Guochuan Zhang
On maximizing the throughput of multiprocessor tasks.
Theoretical Computer Science 302, 2003, 319-335.

Miroslav Chlebík and Janka Chlebíková
Inapproximability results for bounded variants of optimization problems, Electronic Colloquium on Computational Complexity, Report No. 26, 2003. (gzipped ps-file)

Aleksei V. Fishkin, Klaus Jansen, and Monaldo Mastrolilli
On minimizing average weighted completion time: a PTAS for job shop scheduling with release dates, Proceedings of 14th International Symposium on Algorithms and Computation (ISAAC), Kyoto, Japan, December 15-17, 2003, LNCS, Springer.

Miroslav Chlebík and Janka Chlebíková
Approximation hardness of minimum edge dominating set and minimum maximal matching, Proceedings of 14th International Symposium on Algorithms and Computation (ISAAC), Kyoto, Japan, December 15-17, 2003, LNCS, 2003, Springer. (gzipped ps-file)

Deshi Ye and Guochuan Zhang
On-line scheduling of parallel jobs with dependencies on 2-dimensional meshes, Proceedings of 14th International Symposium on Algorithms and Computation (ISAAC), Kyoto, Japan, December 15-17, 2003, LNCS. (gzipped ps-file)

Deshi Ye and Guochuan Zhang
On-line extensible bin packing with unequal bin sizes, Proceedings of the Workshop on Approximation and online Algorithms (WAOA), Budapest, Hungary, September 15-18, 2003, LNCS. (gzipped ps-file)

Janka Chlebíková and Klaus Jansen
The d-precoloring problem on k-degenerate graphs, Proceedings of 2th European Conference on Combinatorics, Graphs, and Applications (EUROCOMB), Prag, September 8-12, 2003, 81-85.

Klaus Jansen and Roberto Solis-Oba
Approximation algorithms for scheduling jobs with chain precedence constraints, Proceedings of 5th International Conference on Parallel Processing and Applied Mathematics (PPAM), Czestochowa, Poland, September 7-10, 2003. (gzipped ps-file), LNCS, Springer.

Miroslav Chlebík and Janka Chlebíková
Inapproximability results for bounded variants of optimization problems, Proceedings of 14th International Symposium on Fundamentals of Computation Theory (FCT), Malmo, Sweden, August 12-15, 2003, LNCS 2751 (A. Lingas, B. J. Nilsson, eds.), Springer, 2003, pages 27-38. (gzipped ps-file)

Miroslav Chlebík and Janka Chlebíková
Approximation hardness for small occurrence instances of NP-hard problems, Proceedings of 5th Conference on Algorithms and Complexity (CIAC), Rome, Italy, May 28-30, 2003, LNCS 2653 (R. Petreschi, G. Persiano, R. Silvestri, eds.), Springer, 152-164. (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
Linear time approximation schemes for scheduling malleable parallel tasks, Algorithmica 32, 2002, 507-520.

Thomas Erlebach and Klaus Jansen
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees, ACM Journal of Experimental Algorithms 7, 2002.

Klaus Jansen and Lorant Porkolab
Polynomial time approximation schemes for general multiprocessor job shop scheduling, Journal of Algorithms , 45, 2002, 167-191.

Janka Chlebíková
The structure of obstructions to treewidth and pathwidth, Discrete Applied Mathematics 120, no. 1-3, 2002, 59-69. (gzipped ps-file)

Janka Chlebíková
Partial k-trees with maximum chromatic number, Discrete Mathematics 259, no. 1-3, 2002, 269-276. (gzipped ps-file)

Miroslav Chlebík and Janka Chlebíková
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems, Electronic Colloquium on Computational Complexity, Report No. 73, 2002. (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
On preemptive resource constrained scheduling: polynomial-time approximations schemes, Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO'02), MIT Cambridge, W. Cook and A. Schulz (eds.), LNCS, Springer Verlag, 2002. (gzipped ps-file)

Klaus Jansen
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme, Proceedings of the European Symposium on Algorithms (ESA'02), Roma, Italy, R. Möhring and R. Raman (eds.), LNCS, Springer Verlag, 2002. (gzipped ps-file)

Klaus Jansen
Approximate strong separation with application in fractional graph coloring and preemptive scheduling, Proceedings of the Symposium on Theoretical Aspects of Computer Science, (STACS'02), Antibes, France, H. Alt and A. Ferreira (eds.), LNCS, Springer Verlag, 2002. (gzipped ps-file)

Klaus Jansen and Roberto Solis-Oba
An asympotic fully polynomial time approximation scheme for bin covering, Proceedings 13th International Symposium on Algorithms and Computation (ISAAC'02), Vancouver, Canada, LNCS, Springer Verlag, November 21 - 23, 2002. (gzipped ps-file)

Klaus Jansen and Hu Zhang
An approximation algorithm for the multicast congestion problem via minimum Steiner trees, Proceedings 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'02), Roma, Italy, September 21, 2002. (gzipped ps-file)

Guochuan Zhang
On variable-sized bin packing, Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'02), Roma, Italy, Carleton Scientific, September 21, 2002. (gzipped ps-file)

Aleksei V. Fishkin and Guochuan Zhang
On Maximizing the Throughput of Multiprocessor Tasks, Proceedings 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'02), Warszawa - Otwock, Poland, LNCS, Springer Verlag, August 26 - 30, 2002. (gzipped ps-file)

Klaus Jansen and Hu Zhang
Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings 2nd IFIP International Conference on Theoretical Computer Science (TCS'02), Montréal, Québec, Canada, August 25 - 30, 2002. (gzipped ps-file)

Miroslav Chlebík and Janka Chlebíková
Approximation Hardness of the Steiner Tree Problem on Graphs, Proceedings of 8th Scandinavian Workshop on Algorithm Theory (SWAT'02), Turku, Finland, July 3-5, 2002, LNCS 2368, M. Penttonen, E. M. Schmidt (eds.), Springer Verlag, pp. 170-179. (gzipped ps-file)

Thomas Erlebach and Klaus Jansen
The complexity of path coloring and call scheduling, Theoretical Computer Science 255, 2001, 33-50.

Klaus Jansen and Lorant Porkolab
Improved approximation schemes for scheduling unrelated parallel machines, Mathematics of Operations Research 26, 2001, 324-338.

Thomas Erlebach and Klaus Jansen
The maximum edge-disjoint paths problem in bidirected paths, SIAM Journal on Discrete Mathematics 14 , 2001, 326-355.

Klaus Jansen, M. Mastrolilli, and Roberto Solis-Oba
Job shop scheduling problems with controllable processing times, Proceedings of the 7th Italian Conference on Theoretical Computer Science (ICTCS'01), Torino, 2001. (gzipped ps-file)

Aleksei V.Fishkin, Klaus Jansen, and Monaldo Mastrolilli
Grouping techniques for scheduling problems: simpler and faster, Proceedings 9th Anual European Symposium (ESA'01), Friedhelm Meyer auf der Heide (Ed.), Arhus, LNCS 2161, Springer Verlag, 2001, 206-217. (gzipped ps-file)

Jirí Fiala, Aleksei V.Fishkin, and Fedor Fomin
Off-line and on-line distance constrained labelings of disk graphs, Proceedings 9th Anual European Symposium on Algorithms (ESA'01), Friedhelm Meyer auf der Heide (Ed.), Arhus, LNCS 2161, Springer Verlag, 2001, 464-475. ( gzipped ps-file)

Klaus Jansen
Approximation algorithms for fractional covering and packing problems, and applications, (invited talk), Proceedings 13th International Symposium on Fundamentals of Computation Theory (FCT'01),Rusins Freivalds (Ed.), Riga, LNCS 2138, Springer Verlag, 14, 2001. (gzipped ps-file)

Aleksei V. Fishkin, Klaus Jansen, and Lorant Porkolab
On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks, Proceedings 13th International Symposium on Fundamentals of Computation Theory (FCT'01), Rusins Freivalds (Ed.), Riga, LNCS 2138, Springer Verlag, 2001, 495-507. (gzipped ps-file)

Aleksei V. Fishkin, Klaus Jansen, and Lorant Porkolab
On minimizing average weighted completion time of multiprocessor tasks with release dates, Proceedings 28th International Colloquium on Automata, Languages and Programming (ICALP'01), Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (Eds.), Crete, LNCS 2076, Springer Verlag, 2001, 875-886. (gzipped ps-file)

Jirí Fiala, Klaus Jansen, V.B. Le, and Eike Seidel
Graph subcolorings: complexity and algorithms, WG'01, Boltenhagen. (gzipped ps-file)

Klaus Jansen, Marek Karpinski, Andrzej Lingas, and Eike Seidel
PTASs for MAX-BISECTION on Planar and Geometric Graphs, STACS'01, A. Ferreira and H. Reichel (eds.), Dresden, LNCS 2010, Springer Verlag, 2001, 365-375. (gzipped ps-file)

Thomas Erlebach, Klaus Jansen, and Eike Seidel
Polynomial-Time Approximation Schemes for Geometric Graphs, SODA'01, Washington, 2001, 671-679. (gzipped ps-file)

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

Hans Bodlaender and Klaus Jansen
On the complexity of the maximum cut problem, Nordic Journal of Computing 7, 2000, 14-31.

Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, and Claire Kenyon
Scheduling to minimize the average completion time of dedicated tasks, FSTTCS'00, K. Sanjiv, P. Sanjiva (Eds), New Delhi, LNCS 1974, Springer Verlag, 2000, 454-464. (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
Preemptive scheduling on dedicated processors: applications of fractional graph coloring, MFCS'00, M. Nielson and B. Rovan (eds.), Bratislava, LNCS 1893, Springer Verlag, 2000, 446-455. (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
Preemptive parallel task scheduling in O(n)+poly(m) time, ISAAC'00, D. T. Lee and S. H. Teng (eds.), Taipeh, LNCS 1969, Springer Verlag, 2000, 398-409. (gzipped ps-file)

Thomas Erlebach and Klaus Jansen
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees, WAE'00, Saarbrücken. (gzipped ps-file)

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

Thomas Erlebach and Klaus Jansen
Conversion of coloring algorithms into maximum weight independent set algorithms, 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)

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

Klaus Jansen, Monaldo Mastrolilli, and Roberto Solis-Oba
Approximation algorithms for flexible job shop problems, 4th Latin American Theoretical Informatics, LATIN 2000, Punta del Este, LNCS 1776, Springer Verlag, 2000, 68-77. (gzipped ps-file)

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

Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, and Pino Persiano
Optimal wavelength routing on directed fiber trees, Theoretical Computer Science 221, 1999, 119-137.

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

Thomas Erlebach and Klaus Jansen
Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks, ACM Journal of Experimental Algorithms 4, 1999

Klaus Jansen and Lorant Porkolab
Linear time approximation schemes for scheduling problems 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99, Baltimore, 1999, 490-498. (gzipped ps-file)

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

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
Makespan minimization in job shops: a polynomial time approximation scheme, 31st Annual ACM Symposium on Theory of Computing, STOC'99, Atlanta, 1999, 394-399. (gzipped ps-file)

Klaus Jansen and Lorant Porkolab
General multiprocessor task scheduling: approximate solutions in linear time, WADS'99, Vancouver, LNCS 1663, Springer Verlag, 1999, 110-121. (gzipped ps-file)

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
A linear time approximation scheme for job shop scheduling, APPROX'99, Berkeley, (LNCS 1671) , Springer Verlag, 1999, 177-188. (gzipped ps-file)