Klaus Jansen Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Foto N. Afrati [83]
2Mihhail Aizatulin [148]
3Sanjeev Arora [116]
4Evripidis Bampis [83] [146]
5Hans L. Bodlaender [7] [12] [26] [30] [32] [33] [35] [55] [73]
6Andreas Brandstädt [158] [161]
7Moses Charikar [160]
8Chandra Chekuri [142]
9Janka Chlebíková [152]
10Jitender S. Deogun [32] [55]
11Anders Dessmark [27]
12Josep Díaz [150]
13Florian Diedrich [148] [151] [155] [157] [159] [163] [173] [176]
14Irit Dinur [177]
15Thomas Erlebach [42] [45] [49] [52] [53] [61] [62] [64] [66] [81] [84] [86] [87] [92] [101] [131] [134] [164] [166] [171]
16Jirí Fiala [90]
17Aleksei V. Fishkin [83] [94] [95] [97] [115] [125] [137] [139] [140] [141] [165]
18Olga Gerber [125] [137] [139] [141]
19Ashish Goel [169]
20Michel X. Goemans [98]
21Torben Hagerup [164] [166]
22Rolf Harren [155] [163]
23Dorit S. Hochbaum [63] [72]
24Christos Kaklamanis [52] [64] [171]
25Marek Karpinski [75] [91] [130]
26Sanjeev Khanna [127]
27Samir Khuller [85] [113]
28Ton Kloks (Antonius J. J. Kloks) [32] [55]
29Dieter Kratsch [32] [55] [158] [161]
30Van Bang Le [90]
31Stefano Leonardi [107]
32Andrzej Lingas [27] [75] [91] [130]
33Marian Margraf [117]
34Monaldo Mastrolilli [78] [80] [93] [97] [115] [117] [119] [132] [133] [165]
35Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [83]
36Milena Mihail [64]
37Moritz Minzlaff [164] [166]
38Haiko Müller [32] [34] [36] [55]
39Joseph Naor (Seffi Naor) [177]
40Sabine R. Öhring [39] [47]
41Fanny Pascual [157]
42Giuseppe Persiano (Pino Persiano) [52] [64] [171]
43Lorant Porkolab [67] [68] [70] [77] [79] [82] [88] [94] [95] [99] [100] [104] [111] [118] [129] [144]
44Lars Prädel [172]
45Omer Reingold [160]
46Joachim Reiter [43] [50] [56]
47José D. P. Rolim [59] [72] [89] [98] [116] [117] [127] [142] [150] [160] [169] [177]
48Dana Ron [127]
49Ronitt Rubinfeld [169]
50Amit Sahai [116]
51Petra Scheffler [2] [8] [11] [28] [48]
52Ulrich M. Schwarz [172] [176]
53Eike Seidel [90] [91] [92] [130] [131]
54Sergey V. Sevastianov [140]
55Alistair Sinclair [72]
56René Sitters (René A. Sitters) [140]
57Roberto Solis-Oba [69] [71] [78] [93] [103] [108] [110] [114] [128] [132] [133] [137] [141] [143] [149] [156] [167] [178]
58Jeremy Spinrad [158] [161]
59Rob van Stee [135]
60Maxim Sviridenko [69] [71] [76] [110]
61Ralf Thöle [155] [163] [168]
62Henning Thomas [155] [163]
63Luca Trevisan [98] [142]
64Denis Trystram [157] [176]
65Zsolt Tuza [32] [55]
66Vijay V. Vazirani [107]
67Gerhard J. Woeginger [1] [2] [7] [12] [24] [28] [30] [38]
68Alexander Wolff [164] [166]
69Zhongliang Yu [38]
70Guochuan Zhang [122] [124] [153]
71Hu Zhang [105] [136] [138] [147] [162]
72Uri Zwick [150]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)