Klaus Jansen

According to our database1, Klaus Jansen authored at least 224 papers between 1990 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
An EPTAS for Machine Scheduling with Bag-Constraints.
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.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Scheduling on (Un-)Related Machines with Setup Times.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

On Integer Programming and Convolution.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Local Search Breaks 1.75 for Graph Balancing.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Closing the Gap for Pseudo-Polynomial Strip Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Online Bin Covering with Limited Migration.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
The many facets of upper domination.
Theor. Comput. Sci., 2018

On the optimality of exact and approximation algorithms for scheduling problems.
J. Comput. Syst. Sci., 2018

Compact LP Relaxations for Allocation Problems.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Scheduling Monotone Moldable Jobs in Linear Time.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width.
Proceedings of the WALCOM: Algorithms and Computation, 2017

An EPTAS for Scheduling on Unrelated Machines of Few Different Types.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

On the Configuration-LP of the Restricted Assignment Problem.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

About the Structure of the Integer Cone and its Application to Bin Packing.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Quasi-Polynomial Approximation for the Restricted Assignment Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Structural Parameters for Scheduling with Assignment Restrictions.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

New Algorithmic Results for Bin Packing and Scheduling.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Structured Instances of Restricted Assignment with Two Processing Times.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Online Strip Packing with Polynomial Migration.
Proceedings of the Approximation, 2017

2016
Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors.
Encyclopedia of Algorithms, 2016

Scheduling parallel jobs on heterogeneous platforms.
Electronic Notes in Discrete Mathematics, 2016

Estimating The Makespan of The Two-Valued Restricted Assignment Problem.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

A PTAS for Scheduling Unrelated Machines of Few Different Types.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Approximation schemes for machine scheduling with resource (in-)dependent processing times.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Upper Domination: Complexity and Approximation.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Non-preemptive Scheduling with Setup Times: A PTAS.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Improved approximation algorithms for scheduling parallel jobs on identical clusters.
Theor. Comput. Sci., 2015

A Faster FPTAS for the Unbounded Knapsack Problem.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

Fully Dynamic Bin Packing Revisited .
Proceedings of the Approximation, 2015

2014
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

On the optimality of approximation schemes for the classical scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Two for One: Tight Approximation of 2D Bin Packing.
Int. J. Found. Comput. Sci., 2013

Bounding the Running Time of Algorithms for Scheduling and Packing Problems.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Online-Scheduling on Identical Machines with Bounded Migration.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

New Approximability Results for Two-Dimensional Bin Packing.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

A Robust AFPTAS for Online Bin Packing with Polynomial Migration, .
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

An Improved Knapsack Solver for Column Generation.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Tight approximation algorithms for scheduling with fixed jobs and nonavailability.
ACM Trans. Algorithms, 2012

Packing Squares with Profits.
SIAM J. Discrete Math., 2012

A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A Fast Approximation Scheme for the Multiple Knapsack Problem.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

An Improved Approximation Scheme for Variable-Sized Bin Packing.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Tight Approximation for Scheduling Parallel Jobs on Identical Clusters.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

A (5/3 + eps)-Approximation for 2D Strip Packing.
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.
Math. Oper. Res., 2011

A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption.
Inf. Process. Lett., 2011

Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms.
Discrete Math., Alg. and Appl., 2011

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

Scheduling Jobs on Identical and Uniform Processors Revisited.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Approximation Algorithms for Scheduling and Packing Problems.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

A (5/3 + ε)-Approximation for Strip Packing.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Scheduling Jobs on Heterogeneous Platforms.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Faster Approximation Algorithms for Scheduling with Fixed Jobs.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
Approximation Algorithms for Scheduling Parallel Jobs.
SIAM J. Comput., 2010

Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.
Int. J. Found. Comput. Sci., 2010

Bin Packing with Fixed Number of Bins Revisited.
Proceedings of the Algorithm Theory, 2010

An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Approximating the Non-contiguous Multiple Organization Packing Problem.
Proceedings of the Theoretical Computer Science, 2010

A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling.
Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009
Directed Tree Networks.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Rectangle packing with one-dimensional resource augmentation.
Discrete Optimization, 2009

Approximation Algorithms for Multiple Strip Packing.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Two for One: Tight Approximation of 2D Bin Packing.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Parameterized approximation scheme for the multiple knapsack problem.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Improved approximation algorithms for scheduling with fixed jobs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.
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.
Math. Program., 2008

On Packing Rectangles with Resource Augmentation: Maximizing the Profit.
Algorithmic Operations Research, 2008

Trimming of Graphs, with Application to Point Labeling.
Proceedings of the STACS 2008, 2008

A Polynomial Time Approximation Scheme for the Square Packing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximative Algorithmen und Nichtapproximierbarkeit.
de Gruyter, ISBN: 978-3-11-020317-2, 2008

2007
Scheduling Malleable Tasks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Faster and simpler approximation algorithms for mixed packing and covering problems.
Theor. Comput. Sci., 2007

The d-precoloring problem for k-degenerate graphs.
Discrete Mathematics, 2007

Maximizing the Total Profit of Rectangles Packed into a Rectangle.
Algorithmica, 2007

Approximation Algorithms for Geometric Intersection Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Approximation Algorithms for 3D Orthogonal Knapsack.
Proceedings of the Theory and Applications of Models of Computation, 2007

New Approximability Results for 2-Dimensional Packing Problems.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Approximation Algorithms for Scheduling with Reservations.
Proceedings of the High Performance Computing, 2007

An Approximation Algorithm for the General Mixed Packing and Covering Problem.
Proceedings of the Combinatorics, 2007

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
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.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

Preface.
Theor. Comput. Sci., 2006

Approximation Algorithm for the Mixed Fractional Packing and Covering Problem.
SIAM Journal on Optimization, 2006

On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.
SIAM J. Discrete Math., 2006

An approximation algorithm for the general max-min resource sharing problem.
Math. Program., 2006

Introduction.
Discrete Applied Mathematics, 2006

Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

An asymptotic approximation algorithm for 3D-strip packing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs.
SIAM J. Comput., 2005

Approximation schemes for job shop scheduling problems with controllable processing times.
European Journal of Operational Research, 2005

On strip packing With rotations.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Scheduling malleable tasks with precedence constraints.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Packing Weighted Rectangles into a Square.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On Efficient Weighted Rectangle Packing with Large Resources.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
Proceedings of the Algorithms, 2005

On Packing Squares with Resource Augmentation: Maximizing the Profit.
Proceedings of the Theory of Computing 2005, 2005

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

Approximation schemes for parallel machine scheduling problems with controllable processing times.
Computers & OR, 2004

Guest Editors' Introduction.
Algorithmica, 2004

Approximation Algorithms for Mixed Fractional Packing and Covering Problems.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Maximizing the Number of Packed Rectangles.
Proceedings of the Algorithm Theory, 2004

Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.
Proceedings of the Algorithm Theory, 2004

On rectangle packing: maximizing benefits.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximation Algorithms for Mixed Fractional Packing and Covering Problems.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

On Weighted Rectangle Packing with Large Resources.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes.
Proceedings of the Robust and Approximative Algorithms an Particular Graph Classes, 23.05., 2004

2003
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme.
SIAM J. Discrete Math., 2003

Computing optimal preemptive schedules for parallel tasks: linear programming approaches.
Math. Program., 2003

Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints.
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.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
A duality approach to problems of combined stopping and deciding under constraints.
Math. Meth. of OR, 2002

Polynomial time approximation schemes for general multiprocessor job shop scheduling.
J. Algorithms, 2002

Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme.
Proceedings of the Algorithms, 2002

2001
The complexity of path coloring and call scheduling.
Theor. Comput. Sci., 2001

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees.
SIAM J. Discrete Math., 2001

Guest Editors' Introduction.
Algorithmica, 2001

Graph Subcolorings: Complexity and Algorithms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
Proceedings of the STACS 2001, 2001

Polynomial-time approximation schemes for geometric graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Job Shop Scheduling Problems with Controllable Processing Times.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Grouping Techniques for Scheduling Problems: Simpler and Faster.
Proceedings of the Algorithms, 2001

2000
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC), 2000

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
Proceedings of the Algorithm Engineering, 2000

Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
Proceedings of the STACS 2000, 2000

Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Approximation Algorithms for Flexible Job Shop Problems.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Parallel Machine Scheduling Problems with Controllable Processing Times.
Proceedings of the ICALP Workshops 2000, 2000

Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms.
Proceedings of the ICALP Workshops 2000, 2000

Scheduling to Minimize the Average Completion Time of Dedicated Tasks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci., 1999

General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

A Linear Time Approximation Scheme for the Job Shop Scheduling Problem.
Proceedings of the Randomization, 1999

1998
Rankings of Graphs.
SIAM J. Discrete Math., 1998

An approximation algorithm for the register allocation problem.
Integration, 1998

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
Proceedings of the Algorithm Engineering, 1998

An Approximation Scheme for Bin Packing with Conflicts.
Proceedings of the Algorithm Theory, 1998

The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs.
Proceedings of the STACS 98, 1998

Algorithms Based on Randomization and Linear and Semidefinite Programming.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

A New Characterization for Parity Graphs and a Coloring Problem with Costs.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Maximizing the Number of Connections in Optical Tree Networks.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Approximation Results for the Optimum Cost Chromatic Partition Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Off-Line and On-Line Call-Scheduling in Stars and Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

A New Approximation Algorithm for the Register Allocation Problem.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Approximation Results for the Optimum Cost Partition Problem.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Call Scheduling in Trees, Rings and Meshes.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

An approximation scheme for scheduling of malleable parallel tasks.
Proceedings of the Randomization Methods in Algorithm Design, 1997

Approximation results for the optimum cost chromatic partition problem.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

An optimal greedy algorithm for wavelength allocation in directed tree networks.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

The Optimum Cost Chromatic Partition Problem.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Complexity Results for the Optimum Cost Chromatic Partition Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Approximation Results for Wavelength Routing in Directed Binary Trees
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Scheduling of Virtual Connections in Fast Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Approximation Algorithms for Register Allocation
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

1995
The Minimum Broadcast Time Problem for Several Processor Networks.
Theor. Comput. Sci., 1995

Restrictions of Graph Partition Problems. Part I.
Theor. Comput. Sci., 1995

Scheduling of Conditional Executed Jobs on Unrelated Processors.
Discrete Applied Mathematics, 1995

UET-scheduling with chain-type precedence constraints.
Computers & OR, 1995

Approximation Algorithms for Time Constrained Scheduling.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994
Integral Flow with Disjoint Bundles.
Nord. J. Comput., 1994

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

Analysis of Scheduling Problems with Typed Task Systems.
Discrete Applied Mathematics, 1994

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

On the Complexity of the Maximum Cut Problem.
Proceedings of the STACS 94, 1994

The Minimum Broadcast Time Problem.
Proceedings of the Parallel and Distributed Computing, 1994

1993
Scheduling and Related Graph Theoretical Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Scheduling of Conditional Executed Jobs on Unrelated Processors
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

A Rainbow about T-Colorings for Complete Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Scheduling of Conditional Executed Jobs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Bounds for the general capacitated routing problem.
Networks, 1993

The Interconnection Problem.
J. Comput. Syst. Sci., 1993

Scheduling of Incompatible Jobs on Unrelated Machines.
Int. J. Found. Comput. Sci., 1993

Transfer flow graphs.
Discrete Mathematics, 1993

The Allocation Problem in Hardware Design.
Discrete Applied Mathematics, 1993

Scheduling with constrained processor allocation for interval orders.
Computers & OR, 1993

One Strike Against the Min-max Degree Triangulation Problem.
Comput. Geom., 1993

The Complexity of Detecting Crossingfree Configurations in the Plane.
BIT, 1993

A Rainbow About T-Colorings for Complete Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

On the Complexity of Scheduling Incompatible Jobs with Unit-Times.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

The Maximum k-Dependent and f-Dependent Set Problem.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Maximum Covering with D Cliques.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
The Complexity of Detecting Crossingfree Configurations in the Plane
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

The Disjoint Cliques Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

On the Complexity of a Licence Constrained Job Assignment Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

One Strike Against the Min-Max Degree Triangulation Problem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

On the Complexity of One Branching Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Scheduling with Constrained Processor Allocation for Interval Orders
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Scheduling with Incompatible Jobs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Generalized Coloring for Tree-like Graphs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Processor Optimization for Flow Graphs.
Theor. Comput. Sci., 1992

An Approximation Algorithm for the General Routing Problem.
Inf. Process. Lett., 1992

Generalized Coloring for Tree-like Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

On Scheduling Problems Restricted to Interval Orders.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

Scheduling with Incompatible Jobs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

1990
Ein Zuordnungsproblem im Hardware-Design.
PhD thesis, 1990


  Loading...