Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Klaus Jansen - MaRDI portal

Klaus Jansen

From MaRDI portal
(Redirected from Person:197694)
Person:243609

Available identifiers

zbMath Open jansen.klausDBLPj/KlausJansenWikidataQ102197688 ScholiaQ102197688MaRDI QIDQ243609

List of research outcomes





PublicationDate of PublicationType
A PTAS for packing hypercubes into a knapsack2024-06-24Paper
Load balancing: the long road from theory to practice2024-05-24Paper
On Integer Programming, Discrepancy, and Convolution2024-02-27Paper
A rainbow about T-colorings for complete graphs2024-01-05Paper
Rankings of graphs2024-01-05Paper
Peak demand minimization via sliced strip packing2023-12-13Paper
Peak Demand Minimization via Sliced Strip Packing.2023-11-20Paper
A Tight (3/2+ε) Approximation for Skewed Strip Packing.2023-10-31Paper
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing2023-10-06Paper
https://portal.mardi4nfdi.de/entity/Q60759452023-09-20Paper
Solving cut-problems in quadratic time for graphs with bounded treewidth2023-08-14Paper
On the complexity of scheduling problems with a fixed number of parallel identical machines2023-08-14Paper
https://portal.mardi4nfdi.de/entity/Q61684542023-08-08Paper
The double exponential runtime is tight for 2-stage stochastic ILPs2023-03-14Paper
Online bin covering with limited migration2023-03-10Paper
https://portal.mardi4nfdi.de/entity/Q58742752023-02-07Paper
An approximation scheme for bin packing with conflicts2022-12-09Paper
Empowering the configuration-IP: new PTAS results for scheduling with setup times2022-10-24Paper
Exact polynomial time algorithm for the response time analysis of harmonic tasks2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50912332022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912342022-07-21Paper
On Integer Programming and Convolution.2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904212022-07-18Paper
Online Bin Covering with Limited Migration2022-05-11Paper
Closing the Gap for Pseudo-Polynomial Strip Packing2022-05-11Paper
Tightness of sensitivity and proximity bounds for integer linear programs2022-03-24Paper
Robust online algorithms for dynamic choosing problems2022-03-22Paper
The double exponential runtime is tight for 2-stage stochastic ILPs2021-12-21Paper
Approximation results for makespan minimization with budgeted uncertainty2021-09-28Paper
https://portal.mardi4nfdi.de/entity/Q50026162021-07-28Paper
An EPTAS for scheduling fork-join graphs with communication delay2021-03-09Paper
Closing the Gap for Makespan Scheduling via Sparsification Techniques2021-01-08Paper
About the Structure of the Integer Cone and Its Application to Bin Packing2021-01-08Paper
A Quasi-Polynomial Approximation for the Restricted Assignment Problem2020-12-04Paper
Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding2020-12-04Paper
Structural parameters for scheduling with assignment restrictions2020-10-21Paper
A note on the integrality gap of the configuration LP for restricted Santa Claus2020-10-07Paper
Approximation results for makespan minimization with budgeted uncertainty2020-08-24Paper
Robust online algorithms for certain dynamic packing problems2020-08-24Paper
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing2020-07-20Paper
New Bounds for the Vertices of the Integer Hull2020-06-18Paper
Complexity and inapproximability results for parallel task scheduling and strip packing2020-02-27Paper
Fully dynamic bin packing revisited2020-01-17Paper
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times2019-11-25Paper
A Robust AFPTAS for Online Bin Packing with Polynomial Migration2019-10-30Paper
Compact LP Relaxations for Allocation Problems2019-10-25Paper
Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows2019-10-24Paper
An EPTAS for scheduling on unrelated machines of few different types2019-09-10Paper
Improved approximation for two dimensional strip packing with polynomial bounded width2019-09-10Paper
On the optimality of approximation schemes for the classical scheduling problem2019-06-20Paper
New Approximability Results for Two-Dimensional Bin Packing2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338782019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46338792019-05-06Paper
Complexity and inapproximability results for parallel task scheduling and strip packing2018-11-28Paper
A PTAS for Scheduling Unrelated Machines of Few Different Types2018-07-24Paper
Approximation schemes for machine scheduling with resource (in-)dependent processing times2018-07-16Paper
About the Structure of the Integer Cone and its Application to Bin Packing2018-07-16Paper
On the Configuration-LP of the Restricted Assignment Problem2018-07-16Paper
Constrained bipartite edge coloring with applications to wavelength routing2018-07-04Paper
Approximation results for the optimum cost chromatic partition problem2018-07-04Paper
On the optimality of exact and approximation algorithms for scheduling problems2018-06-06Paper
Estimating the makespan of the two-valued restricted assignment problem2018-05-23Paper
The many facets of upper domination2018-03-13Paper
Non-preemptive scheduling with setup times: a PTAS2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45982122017-12-19Paper
A faster FPTAS for the unbounded knapsack problem2017-11-14Paper
Estimating The Makespan of The Two-Valued Restricted Assignment Problem2017-10-17Paper
An EPTAS for scheduling on unrelated machines of few different types2017-09-22Paper
https://portal.mardi4nfdi.de/entity/Q53518952017-08-31Paper
A quasi-polynomial approximation for the restricted assignment problem2017-08-31Paper
New Algorithmic Results for Bin Packing and Scheduling2017-07-21Paper
Structural parameters for scheduling with assignment restrictions2017-07-21Paper
Improved approximation for two dimensional strip packing with polynomial bounded width2017-05-05Paper
Structured Instances of Restricted Assignment with Two Processing Times2017-04-07Paper
Scheduling parallel jobs on heterogeneous platforms2017-02-14Paper
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints2017-02-01Paper
Algorithmic Aspects of Upper Domination: A Parameterised Perspective2016-11-09Paper
Upper Domination: Complexity and Approximation2016-09-29Paper
Makespan minimization in job shops2016-09-29Paper
Improved approximation schemes for scheduling unrelated parallel machines2016-09-29Paper
A faster FPTAS for the unbounded knapsack problem2016-04-04Paper
New approximability results for two-dimensional bin packing2016-03-23Paper
A PTAS for Scheduling Unrelated Machines of Few Different Types2016-03-10Paper
Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique2016-03-10Paper
Bounding the Running Time of Algorithms for Scheduling and Packing Problems2016-03-04Paper
Improved approximation algorithms for scheduling parallel jobs on identical clusters2015-09-16Paper
An approximation algorithm for scheduling malleable tasks under general precedence constraints2015-09-02Paper
https://portal.mardi4nfdi.de/entity/Q55012612015-08-03Paper
Preemptive scheduling with dedicated processors: applications of fractional graph coloring2015-01-22Paper
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing2015-01-13Paper
Tight approximation algorithms for scheduling with fixed jobs and nonavailability2014-09-09Paper
TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING2014-07-04Paper
A \((5/3+\varepsilon)\)-approximation for strip packing2014-01-22Paper
https://portal.mardi4nfdi.de/entity/Q28673172013-12-11Paper
Bounding the Running Time of Algorithms for Scheduling and Packing Problems2013-08-12Paper
A Robust AFPTAS for Online Bin Packing with Polynomial Migration,2013-08-06Paper
An Improved Knapsack Solver for Column Generation2013-06-14Paper
A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption2013-03-28Paper
Trimming of Graphs, with Application to Point Labeling2013-03-19Paper
Bin packing with fixed number of bins revisited2013-02-21Paper
An Improved Approximation Scheme for Variable-Sized Bin Packing2012-09-25Paper
APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS2012-08-27Paper
Packing Squares with Profits2012-08-22Paper
Approximation Algorithms for Scheduling and Packing Problems2012-07-16Paper
Scheduling Jobs on Identical and Uniform Processors Revisited2012-07-16Paper
A Fast Approximation Scheme for the Multiple Knapsack Problem2012-06-15Paper
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths2012-05-24Paper
Scheduling malleable tasks with precedence constraints2012-05-11Paper
Scheduling Jobs on Heterogeneous Platforms2011-08-17Paper
A (5/3 + ε)-Approximation for Strip Packing2011-08-12Paper
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables2011-04-15Paper
Approximation Algorithms for Scheduling Parallel Jobs2011-04-04Paper
Approximating the Non-contiguous Multiple Organization Packing Problem2010-10-27Paper
Trimming of graphs, with application to point labeling2010-10-06Paper
Approximation algorithms for scheduling with reservations2010-09-16Paper
Parameterized Approximation Scheme for the Multiple Knapsack Problem2010-09-06Paper
An asymptotic approximation algorithm for 3D-strip packing2010-08-16Paper
On strip packing With rotations2010-08-16Paper
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths2010-06-22Paper
Bin Packing with Fixed Number of Bins Revisited2010-06-22Paper
Approximation Algorithms for Multiple Strip Packing2010-05-11Paper
APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS2010-03-09Paper
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability2009-12-17Paper
Two for One: Tight Approximation of 2D Bin Packing2009-10-20Paper
Rectangle packing with one-dimensional resource augmentation2009-08-19Paper
Algorithms and Computation2009-08-07Paper
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables2009-07-14Paper
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability2009-07-09Paper
An Approximation Algorithm for the General Mixed Packing and Covering Problem2009-03-03Paper
New Approximability Results for 2-Dimensional Packing Problems2008-09-17Paper
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 22008-08-28Paper
Grouping techniques for scheduling problems: simpler and faster2008-07-01Paper
Approximation Algorithms for Geometric Intersection Graphs2008-07-01Paper
A Polynomial Time Approximation Scheme for the Square Packing Problem2008-06-10Paper
Approximation algorithms for general packing problems and their application to the multicast congestion problem2008-06-03Paper
Approximative Algorithmen und Nichtapproximierbarkeit2008-05-20Paper
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications2008-03-14Paper
Preemptive scheduling with dedicated processors: applications of fractional graph coloring2007-12-20Paper
Approximation Algorithms for 3D Orthogonal Knapsack2007-11-13Paper
Parallel Processing and Applied Mathematics2007-09-25Paper
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem2007-09-14Paper
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes2007-09-06Paper
The \(d\)-precoloring problem for \(k\)-degenerate graphs2007-06-26Paper
Faster and simpler approximation algorithms for mixed packing and covering problems2007-06-06Paper
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem2007-05-22Paper
Maximizing the total profit of rectangles packed into a rectangle2007-04-26Paper
Algorithms and Computation2006-11-14Paper
Algorithms and Computation2006-11-14Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Algorithms – ESA 20052006-06-27Paper
An approximation algorithm for the general max-min resource sharing problem2006-06-14Paper
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time2006-06-01Paper
Approximation and Online Algorithms2005-12-14Paper
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines2005-11-11Paper
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs2005-10-28Paper
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs2005-09-16Paper
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS2005-09-12Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Algorithm Theory - SWAT 20042005-09-07Paper
A memetic algorithm to schedule planned maintenance for the national grid2005-08-04Paper
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees2005-08-04Paper
Approximation schemes for job shop scheduling problems with controllable processing times2005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q30247692005-07-04Paper
Conversion of coloring algorithms into maximum weight independent set algorithms2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q46734092005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46734102005-04-29Paper
Approximation schemes for parallel machine scheduling problems with controllable processing times2004-11-12Paper
Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47368312004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375372004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44724672004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44725142004-08-04Paper
An asymptotic fully polynomial time approximation scheme for bin covering.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44483602004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44487552004-02-18Paper
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme2004-01-08Paper
Graph Subcolorings: Complexity and Algorithms2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44259522003-09-14Paper
The mutual exclusion scheduling problem for permutation and comparability graphs.2003-08-19Paper
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.2003-08-17Paper
Computing optimal preemptive schedules for parallel tasks: linear programming approaches2003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q44113912003-07-08Paper
Polynomial time approximation schemes for general multiprocessor job shop scheduling2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47967062003-03-05Paper
https://portal.mardi4nfdi.de/entity/Q47826922002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47827442002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45363802002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27683622002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q45350692002-06-12Paper
Linear-Time approximation schemes for scheduling malleable parallel tasks2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27625182002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27542042001-12-06Paper
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees2001-11-11Paper
An approximation scheme for bin packing with conflicts2001-11-06Paper
The complexity of path coloring and call scheduling2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45271962001-02-01Paper
Approximation Results for the Optimum Cost Chromatic Partition Problem2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q45083642000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q45015552000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q45008432000-08-27Paper
https://portal.mardi4nfdi.de/entity/Q49418352000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49426162000-03-16Paper
Optimal wavelength routing on directed fiber trees2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42684371999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42603731999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42523251999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42249271999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q43953261998-09-06Paper
https://portal.mardi4nfdi.de/entity/Q38390081998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43953241998-08-04Paper
https://portal.mardi4nfdi.de/entity/Q43736821998-06-23Paper
Rankings of Graphs1998-05-11Paper
The disjoint cliques problem1998-02-19Paper
Generalized coloring for tree-like graphs1997-08-10Paper
Approximation algorithms for time constrained scheduling1997-07-06Paper
Restrictions of graph partition problems. I1997-02-28Paper
The minimum broadcast time problem for several processor networks1997-02-28Paper
On the complexity of allocation problems in high-level synthesis1997-02-27Paper
A rainbow about \(T\)-colorings for complete graphs1996-11-25Paper
Scheduling of conditional executed jobs on unrelated processors1996-05-30Paper
An approximation algorithm for the license and shift class design problem1995-02-19Paper
Scheduling with incompatible jobs1995-02-01Paper
UET-scheduling with chain-type precedence constraints1995-01-01Paper
Analysis of scheduling problems with typed task systems1994-09-27Paper
https://portal.mardi4nfdi.de/entity/Q42816301994-07-14Paper
https://portal.mardi4nfdi.de/entity/Q42991181994-06-29Paper
https://portal.mardi4nfdi.de/entity/Q42816281994-06-20Paper
Scheduling of incompatible jobs on unrelated machines1994-05-09Paper
https://portal.mardi4nfdi.de/entity/Q42816291994-04-07Paper
https://portal.mardi4nfdi.de/entity/Q42842531994-03-24Paper
The complexity of detecting crossingfree configurations in the plane1994-03-22Paper
One strike against the min-max degree triangulation problem1993-10-17Paper
Bounds for the general capacitated routing problem1993-09-05Paper
The allocation problem in hardware design1993-08-17Paper
Scheduling with constrained processor allocation for interval orders1993-08-10Paper
Transfer flow graphs1993-06-20Paper
The interconnection problem1993-05-16Paper
An approximation algorithm for the general routing problem1993-01-16Paper
Processor optimization for flow graphs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39767901992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q52036571990-01-01Paper

Research outcomes over time

This page was built for person: Klaus Jansen