| 2009 |
|---|
| 172 | EE | Klaus Jansen:
Parameterized approximation scheme for the multiple knapsack problem.
SODA 2009: 665-674 |
| 171 | EE | Florian Diedrich,
Klaus Jansen:
Improved approximation algorithms for scheduling with fixed jobs.
SODA 2009: 675-684 |
| 170 | EE | Thomas Erlebach,
Klaus Jansen,
Christos Kaklamanis,
Giuseppe Persiano:
Directed Tree Networks.
Encyclopedia of Optimization 2009: 716-725 |
| 2008 |
|---|
| 169 | | Ashish Goel,
Klaus Jansen,
José D. P. Rolim,
Ronitt Rubinfeld:
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
Springer 2008 |
| 168 | EE | Klaus Jansen,
Ralf Thöle:
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2.
ICALP (1) 2008: 234-245 |
| 167 | EE | Klaus Jansen,
Roberto Solis-Oba:
A Polynomial Time Approximation Scheme for the Square Packing Problem.
IPCO 2008: 184-198 |
| 166 | EE | Thomas Erlebach,
Torben Hagerup,
Klaus Jansen,
Moritz Minzlaff,
Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling.
STACS 2008: 265-276 |
| 165 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster.
Algorithmica 51(2): 183-199 (2008) |
| 164 | EE | Thomas Erlebach,
Torben Hagerup,
Klaus Jansen,
Moritz Minzlaff,
Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling
CoRR abs/0802.2854: (2008) |
| 163 | EE | Florian Diedrich,
Rolf Harren,
Klaus Jansen,
Ralf Thöle,
Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack.
J. Comput. Sci. Technol. 23(5): 749-762 (2008) |
| 162 | EE | Klaus Jansen,
Hu Zhang:
Approximation algorithms for general packing problems and their application to the multicast congestion problem.
Math. Program. 114(1): 183-206 (2008) |
| 2007 |
|---|
| 161 | | Andreas Brandstädt,
Klaus Jansen,
Dieter Kratsch,
Jeremy Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 160 | | Moses Charikar,
Klaus Jansen,
Omer Reingold,
José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
Springer 2007 |
| 159 | EE | Florian Diedrich,
Klaus Jansen:
An Approximation Algorithm for the General Mixed Packing and Covering Problem.
ESCAPE 2007: 128-139 |
| 158 | EE | Andreas Brandstädt,
Klaus Jansen,
Dieter Kratsch,
Jeremy Spinrad:
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007 |
| 157 | EE | Florian Diedrich,
Klaus Jansen,
Fanny Pascual,
Denis Trystram:
Approximation Algorithms for Scheduling with Reservations.
HiPC 2007: 297-307 |
| 156 | EE | Klaus Jansen,
Roberto Solis-Oba:
New Approximability Results for 2-Dimensional Packing Problems.
MFCS 2007: 103-114 |
| 155 | EE | Florian Diedrich,
Rolf Harren,
Klaus Jansen,
Ralf Thöle,
Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack.
TAMC 2007: 34-45 |
| 154 | EE | Klaus Jansen:
Approximation Algorithms for Geometric Intersection Graphs.
WG 2007: 151-153 |
| 153 | EE | Klaus Jansen,
Guochuan Zhang:
Maximizing the Total Profit of Rectangles Packed into a Rectangle.
Algorithmica 47(3): 323-342 (2007) |
| 152 | EE | Janka Chlebíková,
Klaus Jansen:
The d-precoloring problem for k-degenerate graphs.
Discrete Mathematics 307(16): 2042-2052 (2007) |
| 151 | EE | Florian Diedrich,
Klaus Jansen:
Faster and simpler approximation algorithms for mixed packing and covering problems.
Theor. Comput. Sci. 377(1-3): 181-204 (2007) |
| 2006 |
|---|
| 150 | | Josep Díaz,
Klaus Jansen,
José D. P. Rolim,
Uri Zwick:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings
Springer 2006 |
| 149 | EE | Klaus Jansen,
Roberto Solis-Oba:
An asymptotic approximation algorithm for 3D-strip packing.
SODA 2006: 143-152 |
| 148 | EE | Mihhail Aizatulin,
Florian Diedrich,
Klaus Jansen:
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.
WEA 2006: 207-218 |
| 147 | EE | Klaus Jansen,
Hu Zhang:
An approximation algorithm for scheduling malleable tasks under general precedence constraints.
ACM Transactions on Algorithms 2(3): 416-434 (2006) |
| 146 | EE | Evripidis Bampis,
Klaus Jansen:
Introduction.
Discrete Applied Mathematics 154(4): 609 (2006) |
| 145 | EE | Klaus Jansen:
An approximation algorithm for the general max-min resource sharing problem.
Math. Program. 106(3): 547-566 (2006) |
| 144 | EE | Klaus Jansen,
Lorant Porkolab:
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.
SIAM J. Discrete Math. 20(3): 545-563 (2006) |
| 143 | EE | Klaus Jansen,
Roberto Solis-Oba:
Preface.
Theor. Comput. Sci. 361(2-3): 131-132 (2006) |
| 2005 |
|---|
| 142 | | Chandra Chekuri,
Klaus Jansen,
José D. P. Rolim,
Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings
Springer 2005 |
| 141 | EE | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen,
Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit.
CATS 2005: 61-67 |
| 140 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Sergey V. Sevastianov,
René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
ESA 2005: 580-591 |
| 139 | EE | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen:
On Efficient Weighted Rectangle Packing with Large Resources.
ISAAC 2005: 1039-1050 |
| 138 | EE | Klaus Jansen,
Hu Zhang:
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints.
ISAAC 2005: 236-245 |
| 137 | EE | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen,
Roberto Solis-Oba:
Packing Weighted Rectangles into a Square.
MFCS 2005: 352-363 |
| 136 | EE | Klaus Jansen,
Hu Zhang:
Scheduling malleable tasks with precedence constraints.
SPAA 2005: 86-95 |
| 135 | EE | Klaus Jansen,
Rob van Stee:
On strip packing With rotations.
STOC 2005: 755-761 |
| 134 | EE | Thomas Erlebach,
Klaus Jansen:
Conversion of coloring algorithms into maximum weight independent set algorithms.
Discrete Applied Mathematics 148(1): 107-125 (2005) |
| 133 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times.
European Journal of Operational Research 167(2): 297-319 (2005) |
| 132 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems.
Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) |
| 131 | EE | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
SIAM J. Comput. 34(6): 1302-1323 (2005) |
| 130 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
SIAM J. Comput. 35(1): 110-119 (2005) |
| 129 | EE | Klaus Jansen,
Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.
SIAM J. Comput. 35(3): 519-530 (2005) |
| 2004 |
|---|
| 128 | | Klaus Jansen,
Roberto Solis-Oba:
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers
Springer 2004 |
| 127 | | Klaus Jansen,
Sanjeev Khanna,
José D. P. Rolim,
Dana Ron:
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings
Springer 2004 |
| 126 | | Klaus Jansen:
Approximation Algorithms for Mixed Fractional Packing and Covering Problems.
IFIP TCS 2004: 223-236 |
| 125 | | Aleksei V. Fishkin,
Olga Gerber,
Klaus Jansen:
On Weighted Rectangle Packing with Large Resources.
IFIP TCS 2004: 237-250 |
| 124 | EE | Klaus Jansen,
Guochuan Zhang:
On rectangle packing: maximizing benefits.
SODA 2004: 204-213 |
| 123 | EE | Klaus Jansen:
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.
SWAT 2004: 311-322 |
| 122 | EE | Klaus Jansen,
Guochuan Zhang:
Maximizing the Number of Packed Rectangles.
SWAT 2004: 362-371 |
| 121 | EE | Klaus Jansen:
Approximation Algorithms for Mixed Fractional Packing and Covering Problems.
WAOA 2004: 6-8 |
| 120 | EE | Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme.
Algorithmica 39(1): 59-81 (2004) |
| 119 | EE | Klaus Jansen,
Monaldo Mastrolilli:
Approximation schemes for parallel machine scheduling problems with controllable processing times.
Computers & OR 31(10): 1565-1581 (2004) |
| 118 | EE | Klaus Jansen,
Lorant Porkolab:
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.
J. Scheduling 7(1): 35-48 (2004) |
| 2003 |
|---|
| 117 | | Klaus Jansen,
Marian Margraf,
Monaldo Mastrolilli,
José D. P. Rolim:
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
Springer 2003 |
| 116 | | Sanjeev Arora,
Klaus Jansen,
José D. P. Rolim,
Amit Sahai:
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NY, USA, August 24-26, 2003, Proceedings
Springer 2003 |
| 115 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates.
ISAAC 2003: 319-328 |
| 114 | EE | Klaus Jansen,
Roberto Solis-Oba:
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.
PPAM 2003: 105-112 |
| 113 | EE | Klaus Jansen,
Samir Khuller:
Guest Editors' Introduction.
Algorithmica 38(3): 415-416 (2003) |
| 112 | EE | Klaus Jansen:
The mutual exclusion scheduling problem for permutation and comparability graphs.
Inf. Comput. 180(2): 71-81 (2003) |
| 111 | EE | Klaus Jansen,
Lorant Porkolab:
Computing optimal preemptive schedules for parallel tasks: linear programming approaches.
Math. Program. 95(3): 617-630 (2003) |
| 110 | EE | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discrete Math. 16(2): 288-300 (2003) |
| 109 | EE | Klaus Jansen:
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
Theor. Comput. Sci. 302(1-3): 239-256 (2003) |
| 108 | EE | Klaus Jansen,
Roberto Solis-Oba:
An asymptotic fully polynomial time approximation scheme for bin covering.
Theor. Comput. Sci. 306(1-3): 543-551 (2003) |
| 2002 |
|---|
| 107 | | Klaus Jansen,
Stefano Leonardi,
Vijay V. Vazirani:
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings
Springer 2002 |
| 106 | EE | Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme.
ESA 2002: 562-573 |
| 105 | | Klaus Jansen,
Hu Zhang:
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function.
IFIP TCS 2002: 255-266 |
| 104 | EE | Klaus Jansen,
Lorant Porkolab:
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.
IPCO 2002: 329-349 |
| 103 | EE | Klaus Jansen,
Roberto Solis-Oba:
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.
ISAAC 2002: 175-186 |
| 102 | EE | Klaus Jansen:
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling.
STACS 2002: 100-111 |
| 101 | EE | Thomas Erlebach,
Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
ACM Journal of Experimental Algorithmics 7: 6 (2002) |
| 100 | EE | Klaus Jansen,
Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
Algorithmica 32(3): 507-520 (2002) |
| 99 | EE | Klaus Jansen,
Lorant Porkolab:
Polynomial time approximation schemes for general multiprocessor job shop scheduling.
J. Algorithms 45(2): 167-191 (2002) |
| 2001 |
|---|
| 98 | | Michel X. Goemans,
Klaus Jansen,
José D. P. Rolim,
Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings
Springer 2001 |
| 97 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster.
ESA 2001: 206-217 |
| 96 | EE | Klaus Jansen:
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.
FCT 2001: 14 |
| 95 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Lorant Porkolab:
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.
FCT 2001: 495-507 |
| 94 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Lorant Porkolab:
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.
ICALP 2001: 875-886 |
| 93 | EE | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times.
ICTCS 2001: 107-122 |
| 92 | EE | Thomas Erlebach,
Klaus Jansen,
Eike Seidel:
Polynomial-time approximation schemes for geometric graphs.
SODA 2001: 671-679 |
| 91 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
STACS 2001: 365-375 |
| 90 | EE | Jirí Fiala,
Klaus Jansen,
Van Bang Le,
Eike Seidel:
Graph Subcolorings: Complexity and Algorithms.
WG 2001: 154-165 |
| 89 | EE | Klaus Jansen,
José D. P. Rolim:
Guest Editors' Introduction.
Algorithmica 30(3): 351-352 (2001) |
| 88 | EE | Klaus Jansen,
Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
Math. Oper. Res. 26(2): 324-338 (2001) |
| 87 | EE | Thomas Erlebach,
Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.
SIAM J. Discrete Math. 14(3): 326-355 (2001) |
| 86 | EE | Thomas Erlebach,
Klaus Jansen:
The complexity of path coloring and call scheduling.
Theor. Comput. Sci. 255(1-2): 33-50 (2001) |
| 2000 |
|---|
| 85 | | Klaus Jansen,
Samir Khuller:
Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings
Springer 2000 |
| 84 | EE | Thomas Erlebach,
Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
Algorithm Engineering 2000: 195-206 |
| 83 | EE | Foto N. Afrati,
Evripidis Bampis,
Aleksei V. Fishkin,
Klaus Jansen,
Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks.
FSTTCS 2000: 454-464 |
| 82 | EE | Klaus Jansen,
Lorant Porkolab:
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.
ICALP 2000: 878-889 |
| 81 | | Thomas Erlebach,
Klaus Jansen:
Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms.
ICALP Satellite Workshops 2000: 135-146 |
| 80 | | Klaus Jansen,
Monaldo Mastrolilli:
Parallel Machine Scheduling Problems with Controllable Processing Times.
ICALP Satellite Workshops 2000: 179-190 |
| 79 | EE | Klaus Jansen,
Lorant Porkolab:
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.
ISAAC 2000: 398-409 |
| 78 | | Klaus Jansen,
Monaldo Mastrolilli,
Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems.
LATIN 2000: 68-77 |
| 77 | EE | Klaus Jansen,
Lorant Porkolab:
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.
MFCS 2000: 446-455 |
| 76 | EE | Klaus Jansen,
Maxim Sviridenko:
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
STACS 2000: 455-465 |
| 75 | EE | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas:
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(64): (2000) |
| 74 | | Klaus Jansen:
Approximation Results for the Optimum Cost Chromatic Partition Problem.
J. Algorithms 34(1): 54-89 (2000) |
| 73 | | Hans L. Bodlaender,
Klaus Jansen:
On the Complexity of the Maximum Cut Problem.
Nord. J. Comput. 7(1): 14-31 (2000) |
| 1999 |
|---|
| 72 | | Dorit S. Hochbaum,
Klaus Jansen,
José D. P. Rolim,
Alistair Sinclair:
Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings
Springer 1999 |
| 71 | | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
RANDOM-APPROX 1999: 177-188 |
| 70 | EE | Klaus Jansen,
Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
SODA 1999: 490-498 |
| 69 | EE | Klaus Jansen,
Roberto Solis-Oba,
Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
STOC 1999: 394-399 |
| 68 | EE | Klaus Jansen,
Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
STOC 1999: 408-417 |
| 67 | EE | Klaus Jansen,
Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.
WADS 1999: 110-121 |
| 66 | EE | Thomas Erlebach,
Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
ACM Journal of Experimental Algorithmics 4: 4 (1999) |
| 65 | | Klaus Jansen:
An Approximation Scheme for Bin Packing with Conflicts.
J. Comb. Optim. 3(4): 363-377 (1999) |
| 64 | EE | Thomas Erlebach,
Klaus Jansen,
Christos Kaklamanis,
Milena Mihail,
Pino Persiano:
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci. 221(1-2): 119-137 (1999) |
| 1998 |
|---|
| 63 | | Klaus Jansen,
Dorit S. Hochbaum:
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
Springer 1998 |
| 62 | | Thomas Erlebach,
Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
Algorithm Engineering 1998: 13-24 |
| 61 | EE | Thomas Erlebach,
Klaus Jansen:
Maximizing the Number of Connections in Optical Tree Networks.
ISAAC 1998: 179-188 |
| 60 | EE | Klaus Jansen:
A New Characterization for Parity Graphs and a Coloring Problem with Costs.
LATIN 1998: 249-260 |
| 59 | EE | Klaus Jansen,
José D. P. Rolim:
Algorithms Based on Randomization and Linear and Semidefinite Programming.
SOFSEM 1998: 124-134 |
| 58 | | Klaus Jansen:
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs.
STACS 1998: 287-297 |
| 57 | EE | Klaus Jansen:
An Approximation Scheme for Bin Packing with Conflicts.
SWAT 1998: 35-46 |
| 56 | EE | Klaus Jansen,
Joachim Reiter:
An approximation algorithm for the register allocation problem.
Integration 25(2): 89-102 (1998) |
| 55 | EE | Hans L. Bodlaender,
Jitender S. Deogun,
Klaus Jansen,
Ton Kloks,
Dieter Kratsch,
Haiko Müller,
Zsolt Tuza:
Rankings of Graphs.
SIAM J. Discrete Math. 11(1): 168-181 (1998) |
| 1997 |
|---|
| 54 | | Klaus Jansen:
The Optimum Cost Chromatic Partition Problem.
CIAC 1997: 25-36 |
| 53 | EE | Thomas Erlebach,
Klaus Jansen:
Call Scheduling in Trees, Rings and Meshes.
HICSS (1) 1997: 221- |
| 52 | | Christos Kaklamanis,
Pino Persiano,
Thomas Erlebach,
Klaus Jansen:
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
ICALP 1997: 493-504 |
| 51 | | Klaus Jansen:
Approximation Results for the Optimum Cost Partition Problem.
ICALP 1997: 727-737 |
| 50 | | Klaus Jansen,
Joachim Reiter:
A New Approximation Algorithm for the Register Allocation Problem.
IRREGULAR 1997: 135-146 |
| 49 | | Thomas Erlebach,
Klaus Jansen:
Off-Line and On-Line Call-Scheduling in Stars and Trees.
WG 1997: 199-213 |
| 48 | EE | Klaus Jansen,
Petra Scheffler:
Generalized Coloring for Tree-like Graphs.
Discrete Applied Mathematics 75(2): 135-155 (1997) |
| 47 | | Klaus Jansen,
Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling.
Inf. Comput. 132(2): 85-108 (1997) |
| 46 | | Klaus Jansen:
Approximation Results for the Optimum Cost Chromatic Partition Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 97-01: (1997) |
| 45 | | Thomas Erlebach,
Klaus Jansen:
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht 97-03: (1997) |
| 1996 |
|---|
| 44 | EE | Klaus Jansen:
A rainbow about T-colorings for complete graphs.
Discrete Mathematics 154(1-3): 129-139 (1996) |
| 43 | | Klaus Jansen,
Joachim Reiter:
Approximation Algorithms for Register Allocation
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-13: (1996) |
| 42 | | Thomas Erlebach,
Klaus Jansen:
Scheduling of Virtual Connections in Fast Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-19: (1996) |
| 41 | | Klaus Jansen:
Approximation Results for Wavelength Routing in Directed Binary Trees
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-37: (1996) |
| 40 | | Klaus Jansen:
Complexity Results for the Optimum Cost Chromatic Partition Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-41: (1996) |
| 1995 |
|---|
| 39 | | Klaus Jansen,
Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling.
IRREGULAR 1995: 143-157 |
| 38 | EE | Klaus Jansen,
Gerhard J. Woeginger,
Zhongliang Yu:
UET-scheduling with chain-type precedence constraints.
Computers & OR 22(9): 915-920 (1995) |
| 37 | EE | Klaus Jansen:
Scheduling of Conditional Executed Jobs on Unrelated Processors.
Discrete Applied Mathematics 61(3): 245-255 (1995) |
| 36 | EE | Klaus Jansen,
Haiko Müller:
The Minimum Broadcast Time Problem for Several Processor Networks.
Theor. Comput. Sci. 147(1&2): 69-85 (1995) |
| 35 | EE | Hans L. Bodlaender,
Klaus Jansen:
Restrictions of Graph Partition Problems. Part I.
Theor. Comput. Sci. 148(1): 93-109 (1995) |
| 1994 |
|---|
| 34 | | Klaus Jansen,
Haiko Müller:
The Minimum Broadcast Time Problem.
Canada-France Conference on Parallel and Distributed Computing 1994: 219-234 |
| 33 | | Hans L. Bodlaender,
Klaus Jansen:
On the Complexity of the Maximum Cut Problem.
STACS 1994: 769-780 |
| 32 | | Hans L. Bodlaender,
Jitender S. Deogun,
Klaus Jansen,
Ton Kloks,
Dieter Kratsch,
Haiko Müller,
Zsolt Tuza:
Ranking of Graphs.
WG 1994: 292-304 |
| 31 | EE | Klaus Jansen:
Analysis of Scheduling Problems with Typed Task Systems.
Discrete Applied Mathematics 52(3): 223-232 (1994) |
| 30 | EE | Hans L. Bodlaender,
Klaus Jansen,
Gerhard J. Woeginger:
Scheduling with Incompatible Jobs.
Discrete Applied Mathematics 55(3): 219-232 (1994) |
| 29 | | Klaus Jansen:
Integral Flow with Disjoint Bundles.
Nord. J. Comput. 1(2): 264-267 (1994) |
| 1993 |
|---|
| 28 | | Klaus Jansen,
Petra Scheffler,
Gerhard J. Woeginger:
Maximum Covering with D Cliques.
FCT 1993: 319-328 |
| 27 | | Anders Dessmark,
Klaus Jansen,
Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem.
ISAAC 1993: 88-98 |
| 26 | | Hans L. Bodlaender,
Klaus Jansen:
On the Complexity of Scheduling Incompatible Jobs with Unit-Times.
MFCS 1993: 291-300 |
| 25 | | Klaus Jansen:
A Rainbow About T-Colorings for Complete Graphs.
WG 1993: 189-199 |
| 24 | | Klaus Jansen,
Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane.
BIT 33(4): 580-595 (1993) |
| 23 | | Klaus Jansen:
One Strike Against the Min-max Degree Triangulation Problem.
Comput. Geom. 3: 107-120 (1993) |
| 22 | EE | Klaus Jansen:
Scheduling with constrained processor allocation for interval orders.
Computers & OR 20(6): 587-595 (1993) |
| 21 | EE | Klaus Jansen:
The Allocation Problem in Hardware Design.
Discrete Applied Mathematics 43(1): 37-46 (1993) |
| 20 | EE | Klaus Jansen:
Transfer flow graphs.
Discrete Mathematics 115(1-3): 187-199 (1993) |
| 19 | | Klaus Jansen:
Scheduling of Incompatible Jobs on Unrelated Machines.
Int. J. Found. Comput. Sci. 4(4): 275-291 (1993) |
| 18 | | Klaus Jansen:
The Interconnection Problem.
J. Comput. Syst. Sci. 46(1): 27-38 (1993) |
| 17 | | Klaus Jansen:
Scheduling of Conditional Executed Jobs
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-01: (1993) |
| 16 | | Klaus Jansen:
A Rainbow about T-Colorings for Complete Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-03: (1993) |
| 15 | | Klaus Jansen:
Scheduling of Conditional Executed Jobs on Unrelated Processors
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-04: (1993) |
| 14 | | Klaus Jansen:
Scheduling and Related Graph Theoretical Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht 93-24: (1993) |
| 1992 |
|---|
| 13 | | Klaus Jansen:
On Scheduling Problems Restricted to Interval Orders.
WG 1992: 27-36 |
| 12 | | Hans L. Bodlaender,
Klaus Jansen,
Gerhard J. Woeginger:
Scheduling with Incompatible Jobs.
WG 1992: 37-49 |
| 11 | | Klaus Jansen,
Petra Scheffler:
Generalized Coloring for Tree-like Graphs.
WG 1992: 50-59 |
| 10 | | Klaus Jansen:
An Approximation Algorithm for the General Routing Problem.
Inf. Process. Lett. 41(6): 333-339 (1992) |
| 9 | | Klaus Jansen:
Processor Optimization for Flow Graphs.
Theor. Comput. Sci. 104(2): 285-298 (1992) |
| 8 | | Klaus Jansen,
Petra Scheffler:
Generalized Coloring for Tree-like Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-08: (1992) |
| 7 | | Hans L. Bodlaender,
Klaus Jansen,
Gerhard J. Woeginger:
Scheduling with Incompatible Jobs
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09: (1992) |
| 6 | | Klaus Jansen:
Scheduling with Constrained Processor Allocation for Interval Orders
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-11: (1992) |
| 5 | | Klaus Jansen:
On the Complexity of One Branching Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-12: (1992) |
| 4 | | Klaus Jansen:
One Strike Against the Min-Max Degree Triangulation Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-14: (1992) |
| 3 | | Klaus Jansen:
On the Complexity of a Licence Constrained Job Assignment Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-15: (1992) |
| 2 | | Klaus Jansen,
Petra Scheffler,
Gerhard J. Woeginger:
The Disjoint Cliques Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-23: (1992) |
| 1 | | Klaus Jansen,
Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane
Universität Trier, Mathematik/Informatik, Forschungsbericht 92-25: (1992) |
