Search the dblp DataBase
Klaus Jansen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Aleksei V. Fishkin , Olga Gerber , Klaus Jansen , Roberto Solis-Oba On Packing Squares with Resource Augmentation: Maximizing the Profit. [Citation Graph (0, 0)][DBLP ] CATS, 2005, pp:61-67 [Conf ] Klaus Jansen , Haiko Müller The Minimum Broadcast Time Problem. [Citation Graph (0, 0)][DBLP ] Canada-France Conference on Parallel and Distributed Computing, 1994, pp:219-234 [Conf ] Klaus Jansen The Optimum Cost Chromatic Partition Problem. [Citation Graph (0, 0)][DBLP ] CIAC, 1997, pp:25-36 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli Grouping Techniques for Scheduling Problems: Simpler and Faster. [Citation Graph (0, 0)][DBLP ] ESA, 2001, pp:206-217 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Sergey V. Sevastyanov , René Sitters Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. [Citation Graph (0, 0)][DBLP ] ESA, 2005, pp:580-591 [Conf ] Klaus Jansen Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:562-573 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Lorant Porkolab On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:495-507 [Conf ] Klaus Jansen Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:14- [Conf ] Klaus Jansen , Petra Scheffler , Gerhard J. Woeginger Maximum Covering with D Cliques. [Citation Graph (0, 0)][DBLP ] FCT, 1993, pp:319-328 [Conf ] Foto N. Afrati , Evripidis Bampis , Aleksei V. Fishkin , Klaus Jansen , Claire Kenyon Scheduling to Minimize the Average Completion Time of Dedicated Tasks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2000, pp:454-464 [Conf ] Thomas Erlebach , Klaus Jansen Call Scheduling in Trees, Rings and Meshes. [Citation Graph (0, 0)][DBLP ] HICSS (1), 1997, pp:221-0 [Conf ] Thomas Erlebach , Klaus Jansen Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. [Citation Graph (0, 0)][DBLP ] ICALP Satellite Workshops, 2000, pp:135-146 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Lorant Porkolab On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. [Citation Graph (0, 0)][DBLP ] ICALP, 2001, pp:875-886 [Conf ] Klaus Jansen Approximation Results for the Optimum Cost Partition Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:727-737 [Conf ] Klaus Jansen , Monaldo Mastrolilli Parallel Machine Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] ICALP Satellite Workshops, 2000, pp:179-190 [Conf ] Klaus Jansen , Lorant Porkolab Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:878-889 [Conf ] Christos Kaklamanis , Pino Persiano , Thomas Erlebach , Klaus Jansen Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:493-504 [Conf ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Job Shop Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:107-122 [Conf ] Klaus Jansen Approximation Algorithms for Mixed Fractional Packing and Covering Problems. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2004, pp:223-236 [Conf ] Klaus Jansen , Hu Zhang Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2002, pp:255-266 [Conf ] Aleksei V. Fishkin , Olga Gerber , Klaus Jansen On Weighted Rectangle Packing with Large Resources. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2004, pp:237-250 [Conf ] Klaus Jansen , Lorant Porkolab On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. [Citation Graph (0, 0)][DBLP ] IPCO, 2002, pp:329-349 [Conf ] Klaus Jansen , Sabine R. Öhring Approximation Algorithms for Time Constrained Scheduling. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1995, pp:143-157 [Conf ] Klaus Jansen , Joachim Reiter A New Approximation Algorithm for the Register Allocation Problem. [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1997, pp:135-146 [Conf ] Anders Dessmark , Klaus Jansen , Andrzej Lingas The Maximum k-Dependent and f-Dependent Set Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 1993, pp:88-98 [Conf ] Thomas Erlebach , Klaus Jansen Maximizing the Number of Connections in Optical Tree Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:179-188 [Conf ] Aleksei V. Fishkin , Olga Gerber , Klaus Jansen On Efficient Weighted Rectangle Packing with Large Resources. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:1039-1050 [Conf ] Aleksei V. Fishkin , Klaus Jansen , Monaldo Mastrolilli On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:319-328 [Conf ] Klaus Jansen , Lorant Porkolab Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:398-409 [Conf ] Klaus Jansen , Roberto Solis-Oba An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:175-186 [Conf ] Klaus Jansen , Hu Zhang An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:236-245 [Conf ] Klaus Jansen A New Characterization for Parity Graphs and a Coloring Problem with Costs. [Citation Graph (0, 0)][DBLP ] LATIN, 1998, pp:249-260 [Conf ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation Algorithms for Flexible Job Shop Problems. [Citation Graph (0, 0)][DBLP ] LATIN, 2000, pp:68-77 [Conf ] Hans L. Bodlaender , Klaus Jansen On the Complexity of Scheduling Incompatible Jobs with Unit-Times. [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:291-300 [Conf ] Aleksei V. Fishkin , Olga Gerber , Klaus Jansen , Roberto Solis-Oba Packing Weighted Rectangles into a Square. [Citation Graph (0, 0)][DBLP ] MFCS, 2005, pp:352-363 [Conf ] Klaus Jansen , Lorant Porkolab Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:446-455 [Conf ] Klaus Jansen , Roberto Solis-Oba Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. [Citation Graph (0, 0)][DBLP ] PPAM, 2003, pp:105-112 [Conf ] Klaus Jansen , Roberto Solis-Oba , Maxim Sviridenko A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 1999, pp:177-188 [Conf ] Thomas Erlebach , Klaus Jansen , Eike Seidel Polynomial-time approximation schemes for geometric graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:671-679 [Conf ] Klaus Jansen , Lorant Porkolab Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:490-498 [Conf ] Klaus Jansen , Roberto Solis-Oba An asymptotic approximation algorithm for 3D-strip packing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:143-152 [Conf ] Klaus Jansen , Guochuan Zhang On rectangle packing: maximizing benefits. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:204-213 [Conf ] Klaus Jansen , José D. P. Rolim Algorithms Based on Randomization and Linear and Semidefinite Programming. [Citation Graph (0, 0)][DBLP ] SOFSEM, 1998, pp:124-134 [Conf ] Klaus Jansen , Hu Zhang Scheduling malleable tasks with precedence constraints. [Citation Graph (0, 0)][DBLP ] SPAA, 2005, pp:86-95 [Conf ] Hans L. Bodlaender , Klaus Jansen On the Complexity of the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP ] STACS, 1994, pp:769-780 [Conf ] Klaus Jansen Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. [Citation Graph (0, 0)][DBLP ] STACS, 2002, pp:100-111 [Conf ] Klaus Jansen The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:287-297 [Conf ] Klaus Jansen , Marek Karpinski , Andrzej Lingas , Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:365-375 [Conf ] Klaus Jansen , Maxim Sviridenko Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:455-465 [Conf ] Klaus Jansen , Lorant Porkolab Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:408-417 [Conf ] Klaus Jansen , Rob van Stee On strip packing With rotations. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:755-761 [Conf ] Klaus Jansen , Roberto Solis-Oba , Maxim Sviridenko Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:394-399 [Conf ] Klaus Jansen Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:311-322 [Conf ] Klaus Jansen An Approximation Scheme for Bin Packing with Conflicts. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:35-46 [Conf ] Klaus Jansen , Guochuan Zhang Maximizing the Number of Packed Rectangles. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:362-371 [Conf ] Klaus Jansen , Lorant Porkolab General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. [Citation Graph (0, 0)][DBLP ] WADS, 1999, pp:110-121 [Conf ] Thomas Erlebach , Klaus Jansen Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2000, pp:195-206 [Conf ] Thomas Erlebach , Klaus Jansen Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 1998, pp:13-24 [Conf ] Klaus Jansen Approximation Algorithms for Mixed Fractional Packing and Covering Problems. [Citation Graph (0, 0)][DBLP ] WAOA, 2004, pp:6-8 [Conf ] Mihhail Aizatulin , Florian Diedrich , Klaus Jansen Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:207-218 [Conf ] Hans L. Bodlaender , Klaus Jansen , Gerhard J. Woeginger Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP ] WG, 1992, pp:37-49 [Conf ] Hans L. Bodlaender , Jitender S. Deogun , Klaus Jansen , Ton Kloks , Dieter Kratsch , Haiko Müller , Zsolt Tuza Ranking of Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:292-304 [Conf ] Thomas Erlebach , Klaus Jansen Off-Line and On-Line Call-Scheduling in Stars and Trees. [Citation Graph (0, 0)][DBLP ] WG, 1997, pp:199-213 [Conf ] Jirí Fiala , Klaus Jansen , Van Bang Le , Eike Seidel Graph Subcolorings: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:154-165 [Conf ] Klaus Jansen On Scheduling Problems Restricted to Interval Orders. [Citation Graph (0, 0)][DBLP ] WG, 1992, pp:27-36 [Conf ] Klaus Jansen A Rainbow About T-Colorings for Complete Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:189-199 [Conf ] Klaus Jansen , Petra Scheffler Generalized Coloring for Tree-like Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1992, pp:50-59 [Conf ] Klaus Jansen Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2004, v:39, n:1, pp:59-81 [Journal ] Klaus Jansen , Samir Khuller Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:38, n:3, pp:415-416 [Journal ] Klaus Jansen , Lorant Porkolab Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2002, v:32, n:3, pp:507-520 [Journal ] Klaus Jansen , José D. P. Rolim Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:30, n:3, pp:351-352 [Journal ] Klaus Jansen , Gerhard J. Woeginger The Complexity of Detecting Crossingfree Configurations in the Plane. [Citation Graph (0, 0)][DBLP ] BIT, 1993, v:33, n:4, pp:580-595 [Journal ] Klaus Jansen One Strike Against the Min-max Degree Triangulation Problem. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1993, v:3, n:, pp:107-120 [Journal ] Klaus Jansen Scheduling with constrained processor allocation for interval orders. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1993, v:20, n:6, pp:587-595 [Journal ] Klaus Jansen , Monaldo Mastrolilli Approximation schemes for parallel machine scheduling problems with controllable processing times. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2004, v:31, n:10, pp:1565-1581 [Journal ] Klaus Jansen , Gerhard J. Woeginger , Zhongliang Yu UET-scheduling with chain-type precedence constraints. [Citation Graph (0, 0)][DBLP ] Computers & OR, 1995, v:22, n:9, pp:915-920 [Journal ] Evripidis Bampis , Klaus Jansen Introduction. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:4, pp:609- [Journal ] Hans L. Bodlaender , Klaus Jansen , Gerhard J. Woeginger Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:55, n:3, pp:219-232 [Journal ] Thomas Erlebach , Klaus Jansen Conversion of coloring algorithms into maximum weight independent set algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:148, n:1, pp:107-125 [Journal ] Klaus Jansen Scheduling of Conditional Executed Jobs on Unrelated Processors. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:61, n:3, pp:245-255 [Journal ] Klaus Jansen , Petra Scheffler Generalized Coloring for Tree-like Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:75, n:2, pp:135-155 [Journal ] Klaus Jansen The Allocation Problem in Hardware Design. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:43, n:1, pp:37-46 [Journal ] Klaus Jansen Analysis of Scheduling Problems with Typed Task Systems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:52, n:3, pp:223-232 [Journal ] Klaus Jansen , Marek Karpinski , Andrzej Lingas A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:64, pp:- [Journal ] Klaus Jansen The mutual exclusion scheduling problem for permutation and comparability graphs. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:180, n:2, pp:71-81 [Journal ] Klaus Jansen , Sabine R. Öhring Approximation Algorithms for Time Constrained Scheduling. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1997, v:132, n:2, pp:85-108 [Journal ] Klaus Jansen Scheduling of Incompatible Jobs on Unrelated Machines. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1993, v:4, n:4, pp:275-291 [Journal ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation algorithms for flexible job shop problems. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:361-379 [Journal ] Klaus Jansen , Joachim Reiter An approximation algorithm for the register allocation problem. [Citation Graph (0, 0)][DBLP ] Integration, 1998, v:25, n:2, pp:89-102 [Journal ] Klaus Jansen An Approximation Algorithm for the General Routing Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:41, n:6, pp:333-339 [Journal ] Klaus Jansen Approximation Results for the Optimum Cost Chromatic Partition Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:34, n:1, pp:54-89 [Journal ] Klaus Jansen , Lorant Porkolab Polynomial time approximation schemes for general multiprocessor job shop scheduling. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2002, v:45, n:2, pp:167-191 [Journal ] Klaus Jansen An Approximation Scheme for Bin Packing with Conflicts. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 1999, v:3, n:4, pp:363-377 [Journal ] Klaus Jansen The Interconnection Problem. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:46, n:1, pp:27-38 [Journal ] Thomas Erlebach , Klaus Jansen Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:6- [Journal ] Thomas Erlebach , Klaus Jansen Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:4- [Journal ] Klaus Jansen , Lorant Porkolab Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP ] Math. Oper. Res., 2001, v:26, n:2, pp:324-338 [Journal ] Klaus Jansen An approximation algorithm for the general max-min resource sharing problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:106, n:3, pp:547-566 [Journal ] Klaus Jansen , Lorant Porkolab Computing optimal preemptive schedules for parallel tasks: linear programming approaches. [Citation Graph (0, 0)][DBLP ] Math. Program., 2003, v:95, n:3, pp:617-630 [Journal ] Hans L. Bodlaender , Klaus Jansen On the Complexity of the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 2000, v:7, n:1, pp:14-31 [Journal ] Klaus Jansen Integral Flow with Disjoint Bundles. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1994, v:1, n:2, pp:264-267 [Journal ] Klaus Jansen , Lorant Porkolab Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2004, v:7, n:1, pp:35-48 [Journal ] Thomas Erlebach , Klaus Jansen , Eike Seidel Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:34, n:6, pp:1302-1323 [Journal ] Klaus Jansen , Marek Karpinski , Andrzej Lingas , Eike Seidel Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:1, pp:110-119 [Journal ] Klaus Jansen , Lorant Porkolab General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:3, pp:519-530 [Journal ] Hans L. Bodlaender , Jitender S. Deogun , Klaus Jansen , Ton Kloks , Dieter Kratsch , Haiko Müller , Zsolt Tuza Rankings of Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1998, v:11, n:1, pp:168-181 [Journal ] Thomas Erlebach , Klaus Jansen The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:3, pp:326-355 [Journal ] Klaus Jansen , Roberto Solis-Oba , Maxim Sviridenko Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2003, v:16, n:2, pp:288-300 [Journal ] Klaus Jansen , Hu Zhang An approximation algorithm for scheduling malleable tasks under general precedence constraints. [Citation Graph (0, 0)][DBLP ] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:416-434 [Journal ] Hans L. Bodlaender , Klaus Jansen Restrictions of Graph Partition Problems. Part I. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:148, n:1, pp:93-109 [Journal ] Thomas Erlebach , Klaus Jansen The complexity of path coloring and call scheduling. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:33-50 [Journal ] Thomas Erlebach , Klaus Jansen , Christos Kaklamanis , Milena Mihail , Pino Persiano Optimal Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal ] Klaus Jansen Approximate strong separation with application in fractional graph coloring and preemptive scheduling. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:302, n:1-3, pp:239-256 [Journal ] Klaus Jansen Processor Optimization for Flow Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:104, n:2, pp:285-298 [Journal ] Klaus Jansen , Haiko Müller The Minimum Broadcast Time Problem for Several Processor Networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:147, n:1&2, pp:69-85 [Journal ] Klaus Jansen , Roberto Solis-Oba An asymptotic fully polynomial time approximation scheme for bin covering. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:543-551 [Journal ] Klaus Jansen , Roberto Solis-Oba Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:361, n:2-3, pp:131-132 [Journal ] Florian Diedrich , Klaus Jansen Faster and simpler approximation algorithms for mixed packing and covering problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:377, n:1-3, pp:181-204 [Journal ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Approximation schemes for job shop scheduling problems with controllable processing times. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:167, n:2, pp:297-319 [Journal ] Klaus Jansen , Roberto Solis-Oba New Approximability Results for 2-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:103-114 [Conf ] Florian Diedrich , Rolf Harren , Klaus Jansen , Ralf Thöle , Henning Thomas Approximation Algorithms for 3D Orthogonal Knapsack. [Citation Graph (0, 0)][DBLP ] TAMC, 2007, pp:34-45 [Conf ] Florian Diedrich , Klaus Jansen An Approximation Algorithm for the General Mixed Packing and Covering Problem. [Citation Graph (0, 0)][DBLP ] ESCAPE, 2007, pp:128-139 [Conf ] Klaus Jansen , Guochuan Zhang Maximizing the Total Profit of Rectangles Packed into a Rectangle. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:47, n:3, pp:323-342 [Journal ] Klaus Jansen Transfer flow graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:115, n:1-3, pp:187-199 [Journal ] Klaus Jansen A rainbow about T-colorings for complete graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:154, n:1-3, pp:129-139 [Journal ] Janka Chlebíková , Klaus Jansen The d-precoloring problem for k-degenerate graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:16, pp:2042-2052 [Journal ] 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. [Citation Graph (, )][DBLP ] A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. [Citation Graph (, )][DBLP ] A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. [Citation Graph (, )][DBLP ] Approximation Algorithms for Scheduling with Reservations. [Citation Graph (, )][DBLP ] Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. [Citation Graph (, )][DBLP ] An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. [Citation Graph (, )][DBLP ] An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. [Citation Graph (, )][DBLP ] A Polynomial Time Approximation Scheme for the Square Packing Problem. [Citation Graph (, )][DBLP ] Parameterized approximation scheme for the multiple knapsack problem. [Citation Graph (, )][DBLP ] Improved approximation algorithms for scheduling with fixed jobs. [Citation Graph (, )][DBLP ] Trimming of Graphs, with Application to Point Labeling. [Citation Graph (, )][DBLP ] Bin Packing with Fixed Number of Bins Revisited. [Citation Graph (, )][DBLP ] Two for One: Tight Approximation of 2D Bin Packing. [Citation Graph (, )][DBLP ] Approximation Algorithms for Multiple Strip Packing. [Citation Graph (, )][DBLP ] Approximation Algorithms for Geometric Intersection Graphs. [Citation Graph (, )][DBLP ] Grouping Techniques for Scheduling Problems: Simpler and Faster. [Citation Graph (, )][DBLP ] Trimming of Graphs, with Application to Point Labeling [Citation Graph (, )][DBLP ] Search in 0.009secs, Finished in 0.017secs