Klaus Jansen

CoRR, 2022

High Multiplicity Scheduling on Uniform Machines in FPT-Time.

[BibT_eX]

[DOI]

Hauke Brinkop

CoRR, 2022

On the Complexity of Scheduling Problems With a Fixed Number of Identical Machines.

[BibT_eX]

[DOI]

Kai Kahler

CoRR, 2022

Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks.

[BibT_eX]

[DOI]

Thi Huyen Chau Nguyen

Werner Grass

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

A PTAS for Packing Hypercubes into a Knapsack.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Load Balancing: The Long Road from Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

An EPTAS for scheduling fork-join graphs with communication delay.

[BibT_eX]

[DOI]

Oliver Sinnen

Huijun Wang

Theor. Comput. Sci., 2021

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv.

[BibT_eX]

[DOI]

Hauke Brinkop

Tim Weißenfels

CoRR, 2021

New Bounds for the Vertices of the Integer Hull.

[BibT_eX]

[DOI]

Sebastian Berndt

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.

[BibT_eX]

[DOI]

Sebastian Berndt

Alexandra Lassota

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Fuzzy Simultaneous Congruences.

[BibT_eX]

[DOI]

Max A. Deppert

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On Order-preserving, Gap-avoiding Rectangle Packing.

[BibT_eX]

[DOI]

Sören Domrös

Daniel Lucas

Reinhard von Hanxleden

Proceedings of the 16th International Joint Conference on Computer Vision, 2021

Revisiting Order-Preserving, Gap-Avoiding Rectangle Packing.

[BibT_eX]

[DOI]

Sören Domrös

Daniel Lucas

Reinhard von Hanxleden

Proceedings of the Computer Vision, Imaging and Computer Graphics Theory and Applications, 2021

Closing the Gap for Single Resource Constraint Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Robust Online Algorithms for Dynamic Choosing Problems.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

Total Completion Time Minimization for Scheduling with Incompatibility Cliques.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Structural parameters for scheduling with assignment restrictions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.

[BibT_eX]

[DOI]

Alexandra Lassota

SIAM J. Discret. Math., 2020

A Quasi-Polynomial Approximation for the Restricted Assignment Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Fully dynamic bin packing revisited.

[BibT_eX]

[DOI]

Sebastian Berndt

Math. Program., 2020

Closing the Gap for Makespan Scheduling via Sparsification Techniques.

[BibT_eX]

[DOI]

José Verschae

Math. Oper. Res., 2020

About the Structure of the Integer Cone and Its Application to Bin Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

A note on the integrality gap of the configuration LP for restricted Santa Claus.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Inapproximability Results for Scheduling with Interval and Resource Restrictions.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Approximation Algorithms for Scheduling with Class Constraints.

[BibT_eX]

[DOI]

Alexandra Lassota

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Improved approximation for two dimensional Strip Packing with polynomial bounded width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

A Robust AFPTAS for Online Bin Packing with Polynomial Migration.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter.

[BibT_eX]

[DOI]

Thi Huyen Chau Nguyen

Werner Grass

CoRR, 2019

Robust Online Algorithms for Dynamic Problems.

[BibT_eX]

[DOI]

CoRR, 2019

An EPTAS for Scheduling on Unrelated Machines of Few Different Types.

[BibT_eX]

[DOI]

Algorithmica, 2019

Robust Online Algorithms for Certain Dynamic Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

An EPTAS for Machine Scheduling with Bag-Constraints.

[BibT_eX]

[DOI]

Kilian Grage

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times.

[BibT_eX]

[DOI]

Max A. Deppert

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Scheduling on (Un-)Related Machines with Setup Times.

[BibT_eX]

[DOI]

Alexander Mäcker

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

On Integer Programming and Convolution.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Local Search Breaks 1.75 for Graph Balancing.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Closing the Gap for Pseudo-Polynomial Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

The many facets of upper domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the optimality of exact and approximation algorithms for scheduling problems.

[BibT_eX]

[DOI]

Lin Chen

J. Comput. Syst. Sci., 2018

A PTAS for Scheduling Unrelated Machines of Few Different Types.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

A faster FPTAS for the Unbounded Knapsack Problem.

[BibT_eX]

[DOI]

Stefan Erich Julius Kraft

Eur. J. Comb., 2018

Estimating the Makespan of the Two-Valued Restricted Assignment Problem.

[BibT_eX]

[DOI]

Kati Land

Algorithmica, 2018

Compact LP Relaxations for Allocation Problems.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Scheduling Monotone Moldable Jobs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017

On the Configuration-LP of the Restricted Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

New Algorithmic Results for Bin Packing and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Structured Instances of Restricted Assignment with Two Processing Times.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Online Strip Packing with Polynomial Migration.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Bounding the Running Time of Algorithms for Scheduling and Packing Problems.

[BibT_eX]

[DOI]

Kati Land

SIAM J. Discret. Math., 2016

An Improved Approximation Scheme for Variable-Sized Bin Packing.

[BibT_eX]

[DOI]

Stefan Erich Julius Kraft

Theory Comput. Syst., 2016

Scheduling parallel jobs on heterogeneous platforms.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

New Approximability Results for Two-Dimensional Bin Packing.

[BibT_eX]

[DOI]

Lars Prädel

Algorithmica, 2016

Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique.

[BibT_eX]

[DOI]

Maren Kaluza

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Upper Domination: Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Non-preemptive Scheduling with Setup Times: A PTAS.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Improved approximation algorithms for scheduling parallel jobs on identical clusters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Algorithmic Aspects of Upper Domination.

[BibT_eX]

[DOI]

CoRR, 2015

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows.

[BibT_eX]

[DOI]

Niklas Paulsen

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

A (5/3 + ε)-approximation for strip packing.

[BibT_eX]

[DOI]

Comput. Geom., 2014

A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing.

[BibT_eX]

[DOI]

Lars Prädel

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

On the optimality of approximation schemes for the classical scheduling problem.

[BibT_eX]

[DOI]

Lin Chen

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Bin packing with fixed number of bins revisited.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Two for One: Tight Approximation of 2D Bin Packing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Online-Scheduling on Identical Machines with Bounded Migration.

[BibT_eX]

[DOI]

Thorsten Ehlers

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

An Improved Knapsack Solver for Column Generation.

[BibT_eX]

[DOI]

Stefan Erich Julius Kraft

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Tight approximation algorithms for scheduling with fixed jobs and nonavailability.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Packing Squares with Profits.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Scheduling malleable tasks with precedence constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A Fast Approximation Scheme for the Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

A (5/3 + eps)-Approximation for 2D Strip Packing.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2011

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Scheduling Jobs on Identical and Uniform Processors Revisited.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Approximation Algorithms for Scheduling and Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Scheduling Jobs on Heterogeneous Platforms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Faster Approximation Algorithms for Scheduling with Fixed Jobs.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Approximation Algorithms for Scheduling Parallel Jobs.

[BibT_eX]

[DOI]

Ralf Thöle

SIAM J. Comput., 2010

Trimming of Graphs, with Application to Point Labeling.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Approximation Algorithms for Scheduling with Reservations.

[BibT_eX]

[DOI]

Algorithmica, 2010

An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Approximating the Non-contiguous Multiple Organization Packing Problem.

[BibT_eX]

[DOI]

Christina Otte

Proceedings of the Theoretical Computer Science, 2010

A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling.

[BibT_eX]

[DOI]

Christina Otte

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Directed Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Parameterized Approximation Scheme for the Multiple Knapsack Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Rectangle packing with one-dimensional resource augmentation.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Approximation Algorithms for Multiple Strip Packing.

[BibT_eX]

[DOI]

Christina Otte

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Two for One: Tight Approximation of 2D Bin Packing.

[BibT_eX]

[DOI]

Lars Prädel

Ulrich M. Schwarz

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Improved approximation algorithms for scheduling with fixed jobs.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Approximation algorithms for general packing problems and their application to the multicast congestion problem.

[BibT_eX]

[DOI]

Math. Program., 2008

Approximation Algorithms for 3D Orthogonal Knapsack.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2008

On Packing Rectangles with Resource Augmentation: Maximizing the Profit.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2008

Grouping Techniques for Scheduling Problems: Simpler and Faster.

[BibT_eX]

[DOI]

Algorithmica, 2008

A Polynomial Time Approximation Scheme for the Square Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2.

[BibT_eX]

[DOI]

Ralf Thöle

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximative Algorithmen und Nichtapproximierbarkeit.

[BibT_eX]

[DOI]

Marian Margraf

De Gruyter Lehrbuch, de Gruyter, ISBN: 978-3-11-020317-2, 2008

2007

Scheduling Malleable Tasks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Faster and simpler approximation algorithms for mixed packing and covering problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The d-precoloring problem for k-degenerate graphs.

[BibT_eX]

[DOI]

Janka Chlebíková

Discret. Math., 2007

Maximizing the Total Profit of Rectangles Packed into a Rectangle.

[BibT_eX]

[DOI]

Algorithmica, 2007

Approximation Algorithms for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

New Approximability Results for 2-Dimensional Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

An Approximation Algorithm for the General Mixed Packing and Covering Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05., 2007

2006

Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Efficient Approximation and Online Algorithms, 2006

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An approximation algorithm for scheduling malleable tasks under general precedence constraints.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Approximation Algorithm for the Mixed Fractional Packing and Covering Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

An approximation algorithm for the general max-min resource sharing problem.

[BibT_eX]

[DOI]

Math. Program., 2006

Introduction.

[BibT_eX]

[DOI]

Evripidis Bampis

Discret. Appl. Math., 2006

Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.

[BibT_eX]

[DOI]

Mihhail Aizatulin

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

An asymptotic approximation algorithm for 3D-strip packing.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Eike Seidel

SIAM J. Comput., 2005

Approximation algorithms for flexible job shop problems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Approximation schemes for job shop scheduling problems with controllable processing times.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

Conversion of coloring algorithms into maximum weight independent set algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

On strip packing With rotations.

[BibT_eX]

[DOI]

Rob van Stee

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Packing Weighted Rectangles into a Square.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

On Efficient Weighted Rectangle Packing with Large Resources.

[BibT_eX]

[DOI]

Olga Gerber

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.

[BibT_eX]

[DOI]

Sergey V. Sevastianov

René Sitters

Proceedings of the Algorithms, 2005

On Packing Squares with Resource Augmentation: Maximizing the Profit.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2005, 2005

2004

Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.

[BibT_eX]

[DOI]

J. Sched., 2004

Approximation schemes for parallel machine scheduling problems with controllable processing times.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

Guest Editors' Introduction.

[BibT_eX]

[DOI]

Samir Khuller

Algorithmica, 2004

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme.

[BibT_eX]

[DOI]

Algorithmica, 2004

Approximation Algorithms for Mixed Fractional Packing and Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Maximizing the Number of Packed Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

On rectangle packing: maximizing benefits.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On Weighted Rectangle Packing with Large Resources.

[BibT_eX]

[DOI]

Olga Gerber

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Robust and Approximative Algorithms an Particular Graph Classes, 23.05., 2004

2003

An asymptotic fully polynomial time approximation scheme for bin covering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Approximate strong separation with application in fractional graph coloring and preemptive scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Graph Subcolorings: Complexity and Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Computing optimal preemptive schedules for parallel tasks: linear programming approaches.

[BibT_eX]

[DOI]

Math. Program., 2003

The mutual exclusion scheduling problem for permutation and comparability graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2003

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

A duality approach to problems of combined stopping and deciding under constraints.

[BibT_eX]

[DOI]

Thomas Balzer

Math. Methods Oper. Res., 2002

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2002

Polynomial time approximation schemes for general multiprocessor job shop scheduling.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.

[BibT_eX]

[DOI]

Algorithmica, 2002

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

The complexity of path coloring and call scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.

[BibT_eX]

[DOI]

Math. Oper. Res., 2001

Guest Editors' Introduction.

[BibT_eX]

[DOI]

José D. P. Rolim

Algorithmica, 2001

Polynomial-time approximation schemes for geometric graphs.

[BibT_eX]

[DOI]

Eike Seidel

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Job Shop Scheduling Problems with Controllable Processing Times.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

On the Complexity of the Maximum Cut Problem.

[BibT_eX]

Hans L. Bodlaender

Nord. J. Comput., 2000

A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs

[BibT_eX]

[DOI]

Marek Karpinski

Andrzej Lingas

Electron. Colloquium Comput. Complex., 2000

Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Parallel Machine Scheduling Problems with Controllable Processing Times.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

Scheduling to Minimize the Average Completion Time of Dedicated Tasks.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Optimal Wavelength Routing on Directed Fiber Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 1999

An Approximation Scheme for Bin Packing with Conflicts.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

1998

Rankings of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

An approximation algorithm for the register allocation problem.

[BibT_eX]

[DOI]

Joachim Reiter

Integr., 1998

Algorithms Based on Randomization and Linear and Semidefinite Programming.

[BibT_eX]

[DOI]

José D. P. Rolim

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

A New Characterization for Parity Graphs and a Coloring Problem with Costs.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Maximizing the Number of Connections in Optical Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Approximation Results for the Optimum Cost Chromatic Partition Problem

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Approximation Algorithms for Time Constrained Scheduling.

[BibT_eX]

[DOI]

Sabine R. Öhring

Inf. Comput., 1997

Off-Line and On-Line Call-Scheduling in Stars and Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

A New Approximation Algorithm for the Register Allocation Problem.

[BibT_eX]

[DOI]

Joachim Reiter

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Approximation Results for the Optimum Cost Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Call Scheduling in Trees, Rings and Meshes.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

An approximation scheme for scheduling of malleable parallel tasks.

[BibT_eX]

[DOI]

Proceedings of the Randomization Methods in Algorithm Design, 1997

An optimal greedy algorithm for wavelength allocation in directed tree networks.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

The Optimum Cost Chromatic Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Complexity Results for the Optimum Cost Chromatic Partition Problem

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Approximation Results for Wavelength Routing in Directed Binary Trees

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Scheduling of Virtual Connections in Fast Networks

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Approximation Algorithms for Register Allocation

[BibT_eX]

Joachim Reiter

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

1995

The Minimum Broadcast Time Problem for Several Processor Networks.

[BibT_eX]

[DOI]

Haiko Müller

Theor. Comput. Sci., 1995

Restrictions of Graph Partition Problems. Part I.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Theor. Comput. Sci., 1995

UET-scheduling with chain-type precedence constraints.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Zhongliang Yu

Comput. Oper. Res., 1995

1994

Integral Flow with Disjoint Bundles.

[BibT_eX]

Nord. J. Comput., 1994

On the complexity of allocation problems in high-level synthesis.

[BibT_eX]

[DOI]

Integr., 1994

Analysis of Scheduling Problems with Typed Task Systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Ranking of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Minimum Broadcast Time Problem.

[BibT_eX]

[DOI]

Haiko Müller

Proceedings of the Parallel and Distributed Computing, 1994

1993

Scheduling and Related Graph Theoretical Problems

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Scheduling of Conditional Executed Jobs on Unrelated Processors

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

A Rainbow about T-Colorings for Complete Graphs

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Scheduling of Conditional Executed Jobs

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Bounds for the general capacitated routing problem.

[BibT_eX]

[DOI]

Networks, 1993

The Interconnection Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Scheduling of Incompatible Jobs on Unrelated Machines.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Transfer flow graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

The Allocation Problem in Hardware Design.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

On the Complexity of Scheduling Incompatible Jobs with Unit-Times.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

The Maximum k-Dependent and f-Dependent Set Problem.

[BibT_eX]

[DOI]

Anders Dessmark

Andrzej Lingas

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Maximum Covering with D Cliques.

[BibT_eX]

[DOI]

Petra Scheffler

Gerhard J. Woeginger

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

The Complexity of Detecting Crossingfree Configurations in the Plane

[BibT_eX]