Klaus Jansen - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Scheduling Jobs on Heterogeneous PlatformsMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. cocoon 2011: 271-283 [doi]

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. ProceedingsLeslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim, editors, Volume 6845 of Lecture Notes in Computer Science, Springer, 2011. [doi]

A (5/3 + ε)-Approximation for Strip PackingRolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee. wads 2011: 475-487 [doi]

Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised PapersKlaus Jansen, Roberto Solis-Oba, editors, Volume 6534 of Lecture Notes in Computer Science, Springer, 2011. [doi]

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumptionKlaus Jansen, Roberto Solis-Oba. ipl, 111(10):479-482, 2011. [doi]

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young. dagstuhl-reports, 1(2):67-93, 2011. [doi]

2010

Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised PapersEvripidis Bampis, Klaus Jansen, editors, Volume 5893 of Lecture Notes in Computer Science, Springer, 2010. [doi]

A Fast 5/2-Approximation Algorithm for Hierarchical SchedulingMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. europar 2010: 157-167 [doi]

Approximating the Non-contiguous Multiple Organization Packing ProblemMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. ifipTCS 2010: 316-327 [doi]

Approximation Algorithms for Scheduling with ReservationsFlorian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram. algorithmica, 58(2):391-404, 2010. [doi]

Trimming of Graphs, with Application to Point LabelingThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff. mst, 47(3):613-636, 2010. [doi]

An ::::OPT:::: + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object LengthsKlaus Jansen, Roberto Solis-Oba. ipco 2010: 438-449 [doi]

Bin Packing with Fixed Number of Bins RevisitedKlaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter. swat 2010: 260-272 [doi]

Approximation Algorithms for Scheduling Parallel JobsKlaus Jansen, Ralf Thöle. siamcomp, 39(8):3571-3615, 2010. [doi]

Approximation Schemes for Scheduling Jobs with Chain Precedence ConstraintsKlaus Jansen, Roberto Solis-Oba. ijfcs, 21(1):27-49, 2010. [doi]

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. ProceedingsMaria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim, editors, Volume 6302 of Lecture Notes in Computer Science, Springer, 2010. [doi]

2009

Approximation Algorithms for Multiple Strip PackingMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. waoa 2010: 37-48 [doi]

Improved approximation algorithms for scheduling with fixed jobsFlorian Diedrich, Klaus Jansen. soda 2009: 675-684 [doi]

A Survey on Approximation Algorithms for Scheduling with Machine UnavailabilityFlorian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram. dfg 2009: 50-64 [doi]

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. ProceedingsIrit Dinur, Klaus Jansen, Joseph Naor, JosÃ© D. P. Rolim, editors, Volume 5687 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Parameterized approximation scheme for the multiple knapsack problemKlaus Jansen. soda 2009: 665-674 [doi]

Parameterized Approximation Scheme for the Multiple Knapsack ProblemKlaus Jansen. siamcomp, 39(4):1392-1412, 2009. [doi]

An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral VariablesKlaus Jansen. icalp 2009: 562-573 [doi]

Two for One: Tight Approximation of 2D Bin PackingKlaus Jansen, Lars PrÃ¤del, Ulrich M. Schwarz. wads 2009: 399-410 [doi]

Rectangle packing with one-dimensional resource augmentationKlaus Jansen, Roberto Solis-Oba. disopt, 6(3):310-323, 2009. [doi]

2008

Approximation Algorithms for 3D Orthogonal KnapsackFlorian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas. jcst, 23(5):749-762, 2008. [doi]

Trimming of Graphs, with Application to Point LabelingThomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff. STACS 2008: 265-276 [doi]

Grouping Techniques for Scheduling Problems: Simpler and FasterAleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli. algorithmica, 51(2):183-199, 2008. [doi]

On Packing Rectangles with Resource Augmentation: Maximizing the ProfitAleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba. aor, 3(1), 2008. [doi]

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. ProceedingsAshish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, editors, Volume 5171 of Lecture Notes in Computer Science, Springer, 2008.

Approximation algorithms for general packing problems and their application to the multicast congestion problemKlaus Jansen, Hu Zhang. mp, 114(1):183-206, 2008. [doi]

A Polynomial Time Approximation Scheme for the Square Packing ProblemKlaus Jansen, Roberto Solis-Oba. ipco 2008: 184-198 [doi]

Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2Klaus Jansen, Ralf Thöle. icalp 2008: 234-245 [doi]

Approximative Algorithmen und NichtapproximierbarkeitKlaus Jansen, Marian Margraf. de Gruyter, 2008. [doi]

2007

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph ClassesAndreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad. dagstuhl (empty year): [doi]

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, ProceedingsMoses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim, editors, Volume 4627 of Lecture Notes in Computer Science, Springer, 2007.

The d-precoloring problem for k-degenerate graphsJanka Chlebíková, Klaus Jansen. DM, 307(16):2042-2052, 2007. [doi]

Approximation Algorithms for 3D Orthogonal KnapsackFlorian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas. tamc 2007: 34-45 [doi]

Approximation Algorithms for Scheduling with ReservationsFlorian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram. hipc 2007: 297-307 [doi]

An Approximation Algorithm for the General Mixed Packing and Covering ProblemFlorian Diedrich, Klaus Jansen. escape 2007: 128-139 [doi]

Faster and simpler approximation algorithms for mixed packing and covering problemsFlorian Diedrich, Klaus Jansen. TCS, 377(1-3):181-204, 2007. [doi]

Maximizing the Total Profit of Rectangles Packed into a RectangleKlaus Jansen, Guochuan Zhang. algorithmica, 47(3):323-342, 2007. [doi]

New Approximability Results for 2-Dimensional Packing ProblemsKlaus Jansen, Roberto Solis-Oba. mfcs 2007: 103-114 [doi]

Approximation Algorithms for Geometric Intersection GraphsKlaus Jansen. criwg 2007: 151-153 [doi]

2006

Implementation of Approximation Algorithms for the Max-Min Resource Sharing ProblemMihhail Aizatulin, Florian Diedrich, Klaus Jansen. wea 2006: 207-218 [doi]

IntroductionEvripidis Bampis, Klaus Jansen. DAM, 154(4):609, 2006. [doi]

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 CompuJosep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick, editors, Volume 4110 of Lecture Notes in Computer Science, Springer, 2006.

An approximation algorithm for the general max-min resource sharing problemKlaus Jansen. mp, 106(3):547-566, 2006. [doi]

On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation SchemesKlaus Jansen, Lorant Porkolab. siamdm, 20(3):545-563, 2006. [doi]

An asymptotic approximation algorithm for 3D-strip packingKlaus Jansen, Roberto Solis-Oba. soda 2006: 143-152 [doi]

Approximation Algorithm for the Mixed Fractional Packing and Covering ProblemKlaus Jansen. siamjo, 17(2):331-352, 2006. [doi]

An approximation algorithm for scheduling malleable tasks under general precedence constraintsKlaus Jansen, Hu Zhang. talg, 2(3):416-434, 2006. [doi]

2005

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 ComputatChandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan, editors, Volume 3624 of Lecture Notes in Computer Science, Springer, 2005.

Conversion of coloring algorithms into maximum weight independent set algorithmsThomas Erlebach, Klaus Jansen. DAM, 148(1):107-125, 2005. [doi]

Polynomial-Time Approximation Schemes for Geometric Intersection GraphsThomas Erlebach, Klaus Jansen, Eike Seidel. siamcomp, 34(6):1302-1323, 2005. [doi]

On Packing Squares with Resource Augmentation: Maximizing the ProfitAleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba. cats 2005: 61-67 [doi]

Packing Weighted Rectangles into a SquareAleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba. mfcs 2005: 352-363 [doi]

On Efficient Weighted Rectangle Packing with Large ResourcesAleksei V. Fishkin, Olga Gerber, Klaus Jansen. isaac 2005: 1039-1050 [doi]

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration DelaysAleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters. esa 2005: 580-591 [doi]

General Multiprocessor Task Scheduling: Approximate Solutions in Linear TimeKlaus Jansen, Lorant Porkolab. siamcomp, 35(3):519-530, 2005. [doi]

Approximation algorithms for flexible job shop problemsKlaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba. ijfcs, 16(2):361-379, 2005. [doi]

Approximation schemes for job shop scheduling problems with controllable processing timesKlaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba. eor, 167(2):297-319, 2005. [doi]

On strip packing With rotationsKlaus Jansen, Rob van Stee. stoc 2005: 755-761 [doi]

An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence ConstraintsKlaus Jansen, Hu Zhang. isaac 2005: 236-245 [doi]

Scheduling malleable tasks with precedence constraintsKlaus Jansen, Hu Zhang. spaa 2005: 86-95 [doi]

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric GraphsKlaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel. siamcomp, 35(1):110-119, 2005. [doi]

2004

On Weighted Rectangle Packing with Large ResourcesAleksei V. Fishkin, Olga Gerber, Klaus Jansen. ifipTCS 2004: 237-250

Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised PapersKlaus Jansen, Roberto Solis-Oba, editors, Volume 2909 of Lecture Notes in Computer Science, Springer, 2004.

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation SchemeKlaus Jansen. algorithmica, 39(1):59-81, 2004. [doi]

Approximation schemes for parallel machine scheduling problems with controllable processing timesKlaus Jansen, Monaldo Mastrolilli. cor, 31(10):1565-1581, 2004. [doi]

Maximizing the Number of Packed RectanglesKlaus Jansen, Guochuan Zhang. swat 2004: 362-371 [doi]

Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and SimplerKlaus Jansen. swat 2004: 311-322 [doi]

On rectangle packing: maximizing benefitsKlaus Jansen, Guochuan Zhang. soda 2004: 204-213 [doi]

Approximation Algorithms for Mixed Fractional Packing and Covering ProblemsKlaus Jansen. waoa 2005: 6-8 [doi]

Approximation Algorithms for Mixed Fractional Packing and Covering ProblemsKlaus Jansen. ifipTCS 2004: 223-236

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 CompuKlaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Volume 3122 of Lecture Notes in Computer Science, Springer, 2004.

Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph ColoringKlaus Jansen, Lorant Porkolab. scheduling, 7(1):35-48, 2004. [doi]

2003

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 ApproxSanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai, editors, Volume 2764 of Lecture Notes in Computer Science, Springer, 2003.

Graph Subcolorings: Complexity and AlgorithmsJirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel. siamdm, 16(4):635-650, 2003. [doi]

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release DatesAleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli. isaac 2003: 319-328 [doi]

An asymptotic fully polynomial time approximation scheme for bin coveringKlaus Jansen, Roberto Solis-Oba. TCS, 306(1-3):543-551, 2003. [doi]

Guest Editors IntroductionKlaus Jansen, Samir Khuller. algorithmica, 38(3):415-416, 2003. [doi]

Makespan Minimization in Job Shops: A Linear Time Approximation SchemeKlaus Jansen, Roberto Solis-Oba, Maxim Sviridenko. siamdm, 16(2):288-300, 2003. [doi]

Approximation Algorithms for Scheduling Jobs with Chain Precedence ConstraintsKlaus Jansen, Roberto Solis-Oba. ppam 2004: 105-112 [doi]

Computing optimal preemptive schedules for parallel tasks: linear programming approachesKlaus Jansen, Lorant Porkolab. mp, 95(3):617-630, 2003. [doi]

Approximate strong separation with application in fractional graph coloring and preemptive schedulingKlaus Jansen. TCS, 302(1-3):239-256, 2003. [doi]

The mutual exclusion scheduling problem for permutation and comparability graphsKlaus Jansen. iandc, 180(2):71-81, 2003. [doi]

2002

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected TreesThomas Erlebach, Klaus Jansen. jea, 7:6, 2002. [doi]

An Asymptotic Fully Polynomial Time Approximation Scheme for Bin CoveringKlaus Jansen, Roberto Solis-Oba. isaac 2002: 175-186 [doi]

Linear-Time Approximation Schemes for Scheduling Malleable Parallel TasksKlaus Jansen, Lorant Porkolab. algorithmica, 32(3):507-520, 2002. [doi]

Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential FunctionKlaus Jansen, Hu Zhang. ifipTCS 2002: 255-266

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation SchemeKlaus Jansen. esa 2002: 562-573 [doi]

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation SchemesKlaus Jansen, Lorant Porkolab. ipco 2002: 329-349 [doi]

Polynomial time approximation schemes for general multiprocessor job shop schedulingKlaus Jansen, Lorant Porkolab. jal, 45(2):167-191, 2002. [doi]

Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, ProceedingsKlaus Jansen, Stefano Leonardi, Vijay V. Vazirani, editors, Volume 2462 of Lecture Notes in Computer Science, Springer, 2002.

Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive SchedulingKlaus Jansen. STACS 2002: 100-111 [doi]

2001

The Maximum Edge-Disjoint Paths Problem in Bidirected TreesThomas Erlebach, Klaus Jansen. siamdm, 14(3):326-355, 2001. [doi]

The complexity of path coloring and call schedulingThomas Erlebach, Klaus Jansen. TCS, 255(1-2):33-50, 2001. [doi]

Grouping Techniques for Scheduling Problems: Simpler and FasterAleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli. esa 2001: 206-217 [doi]

Guest Editors IntroductionKlaus Jansen, José D. P. Rolim. algorithmica, 30(3):351-352, 2001. [doi]

PreviousNext