| Publication | Date of Publication | Type |
|---|
| A PTAS for packing hypercubes into a knapsack | 2024-06-24 | Paper |
| Load balancing: the long road from theory to practice | 2024-05-24 | Paper |
On Integer Programming, Discrepancy, and Convolution
Mathematics of Operations Research | 2024-02-27 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
A rainbow about T-colorings for complete graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Peak demand minimization via sliced strip packing
Algorithmica | 2023-12-13 | Paper |
Peak Demand Minimization via Sliced Strip Packing.
(available as arXiv preprint) | 2023-11-20 | Paper |
| A Tight (3/2+ε) Approximation for Skewed Strip Packing. | 2023-10-31 | Paper |
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Algorithmica | 2023-10-06 | Paper |
scientific article; zbMATH DE number 7740908 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
On the complexity of scheduling problems with a fixed number of parallel identical machines
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Solving cut-problems in quadratic time for graphs with bounded treewidth
Lecture Notes in Computer Science | 2023-08-14 | Paper |
scientific article; zbMATH DE number 7724212 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
The double exponential runtime is tight for 2-stage stochastic ILPs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
scientific article; zbMATH DE number 7650890 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
An approximation scheme for bin packing with conflicts
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Empowering the configuration-IP: new PTAS results for scheduling with setup times
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
| Exact polynomial time algorithm for the response time analysis of harmonic tasks | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7561568 (Why is no real title available?) | 2022-07-21 | Paper |
Local search breaks 1.75 for graph balancing
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559087 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| On integer programming and convolution | 2022-07-18 | Paper |
Closing the Gap for Pseudo-Polynomial Strip Packing
(available as arXiv preprint) | 2022-05-11 | Paper |
Online Bin Covering with Limited Migration
(available as arXiv preprint) | 2022-05-11 | Paper |
Tightness of sensitivity and proximity bounds for integer linear programs
(available as arXiv preprint) | 2022-03-24 | Paper |
Robust online algorithms for dynamic choosing problems
(available as arXiv preprint) | 2022-03-22 | Paper |
The double exponential runtime is tight for 2-stage stochastic ILPs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Theory of Computing Systems | 2021-09-28 | Paper |
Online strip packing with polynomial migration
(available as arXiv preprint) | 2021-07-28 | Paper |
An EPTAS for scheduling fork-join graphs with communication delay
Theoretical Computer Science | 2021-03-09 | Paper |
About the Structure of the Integer Cone and Its Application to Bin Packing
Mathematics of Operations Research | 2021-01-08 | Paper |
Closing the gap for makespan scheduling via sparsification techniques
Mathematics of Operations Research | 2021-01-08 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
SIAM Journal on Computing | 2020-12-04 | Paper |
Near-linear time algorithm for \(n\)-fold ILPs via color coding
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Structural parameters for scheduling with assignment restrictions
Theoretical Computer Science | 2020-10-21 | Paper |
A note on the integrality gap of the configuration LP for restricted Santa Claus
Information Processing Letters | 2020-10-07 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Approximation and Online Algorithms | 2020-08-24 | Paper |
Robust online algorithms for certain dynamic packing problems
(available as arXiv preprint) | 2020-08-24 | Paper |
Linear time algorithms for multiple cluster scheduling and multiple strip packing
Lecture Notes in Computer Science | 2020-07-20 | Paper |
| New Bounds for the Vertices of the Integer Hull | 2020-06-18 | Paper |
Complexity and inapproximability results for parallel task scheduling and strip packing
Theory of Computing Systems | 2020-02-27 | Paper |
Fully dynamic bin packing revisited
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Approximation schemes for machine scheduling with resource (in-)dependent processing times
ACM Transactions on Algorithms | 2019-11-25 | Paper |
A robust AFPTAS for online bin packing with polynomial migration
SIAM Journal on Discrete Mathematics | 2019-10-30 | Paper |
| Compact LP relaxations for allocation problems | 2019-10-25 | Paper |
| Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows | 2019-10-24 | Paper |
Improved approximation for two dimensional strip packing with polynomial bounded width
Theoretical Computer Science | 2019-09-10 | Paper |
An EPTAS for scheduling on unrelated machines of few different types
Algorithmica | 2019-09-10 | Paper |
On the optimality of approximation schemes for the classical scheduling problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
New approximability results for two-dimensional bin packing
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Improved approximation algorithms for scheduling with fixed jobs | 2019-05-06 | Paper |
| Parameterized approximation scheme for the multiple knapsack problem | 2019-05-06 | Paper |
Complexity and inapproximability results for parallel task scheduling and strip packing
Lecture Notes in Computer Science | 2018-11-28 | Paper |
A PTAS for scheduling unrelated machines of few different types
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Approximation schemes for machine scheduling with resource (in-)dependent processing times
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the configuration-LP of the restricted assignment problem
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
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 | 2018-07-16 | Paper |
Approximation results for the optimum cost chromatic partition problem
Automata, Languages and Programming | 2018-07-04 | Paper |
Constrained bipartite edge coloring with applications to wavelength routing
Automata, Languages and Programming | 2018-07-04 | Paper |
On the optimality of exact and approximation algorithms for scheduling problems
Journal of Computer and System Sciences | 2018-06-06 | Paper |
Estimating the makespan of the two-valued restricted assignment problem
Algorithmica | 2018-05-23 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
| Non-preemptive scheduling with setup times: a PTAS | 2018-01-11 | Paper |
scientific article; zbMATH DE number 6820261 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
A faster FPTAS for the unbounded knapsack problem
European Journal of Combinatorics | 2017-11-14 | Paper |
| Estimating the makespan of the two-valued restricted assignment problem | 2017-10-17 | Paper |
An EPTAS for scheduling on unrelated machines of few different types
Lecture Notes in Computer Science | 2017-09-22 | Paper |
scientific article; zbMATH DE number 6767525 (Why is no real title available?)
(available as arXiv preprint) | 2017-08-31 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
(available as arXiv preprint) | 2017-08-31 | Paper |
Structural parameters for scheduling with assignment restrictions
Lecture Notes in Computer Science | 2017-07-21 | Paper |
New algorithmic results for bin packing and scheduling
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Improved approximation for two dimensional strip packing with polynomial bounded width
Lecture Notes in Computer Science | 2017-05-05 | Paper |
Structured instances of restricted assignment with two processing times
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| Scheduling parallel jobs on heterogeneous platforms | 2017-02-14 | Paper |
An efficient PTAS for parallel machine scheduling with capacity constraints
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Makespan minimization in job shops: a polynomial time approximation scheme
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Improved approximation schemes for scheduling unrelated parallel machines
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A faster FPTAS for the unbounded knapsack problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
New approximability results for two-dimensional bin packing
Algorithmica | 2016-03-23 | Paper |
A PTAS for scheduling unrelated machines of few different types
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Precedence scheduling with unit execution time is equivalent to parametrized biclique
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Bounding the running time of algorithms for scheduling and packing problems
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
Improved approximation algorithms for scheduling parallel jobs on identical clusters
Theoretical Computer Science | 2015-09-16 | Paper |
An approximation algorithm for scheduling malleable tasks under general precedence constraints
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| On rectangle packing, maximizing benefits | 2015-08-03 | Paper |
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Journal of Scheduling | 2015-01-22 | Paper |
A new asymptotic approximation algorithm for 3-dimensional strip packing
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Two for one: tight approximation of 2D bin packing
International Journal of Foundations of Computer Science | 2014-07-04 | Paper |
A \((5/3+\varepsilon)\)-approximation for strip packing
Computational Geometry | 2014-01-22 | Paper |
On packing rectangles with resource augmentation: maximizing the profit
Algorithmic Operations Research | 2013-12-11 | Paper |
Bounding the running time of algorithms for scheduling and packing problems
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A robust AFPTAS for online bin packing with polynomial migration
Automata, Languages, and Programming | 2013-08-06 | Paper |
An Improved Knapsack Solver for Column Generation
Computer Science – Theory and Applications | 2013-06-14 | Paper |
A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
Information Processing Letters | 2013-03-28 | Paper |
| Trimming of graphs, with application to point labeling | 2013-03-19 | Paper |
Trimming of graphs, with application to point labeling
(available as arXiv preprint) | 2013-03-19 | Paper |
Bin packing with fixed number of bins revisited
Journal of Computer and System Sciences | 2013-02-21 | Paper |
An improved approximation scheme for variable-sized bin packing
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Packing squares with profits
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Scheduling jobs on identical and uniform processors revisited
Approximation and Online Algorithms | 2012-07-16 | Paper |
Approximation algorithms for scheduling and packing problems
Approximation and Online Algorithms | 2012-07-16 | Paper |
A Fast Approximation Scheme for the Multiple Knapsack Problem
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths
Mathematics of Operations Research | 2012-05-24 | Paper |
Scheduling malleable tasks with precedence constraints
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Scheduling jobs on heterogeneous platforms
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A \((5/3 + \varepsilon )\)-approximation for strip packing
Lecture Notes in Computer Science | 2011-08-12 | Paper |
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Approximation algorithms for scheduling parallel jobs
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximating the non-contiguous multiple organization packing problem
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Trimming of graphs, with application to point labeling
Theory of Computing Systems | 2010-10-06 | Paper |
Approximation algorithms for scheduling with reservations
Algorithmica | 2010-09-16 | Paper |
Parameterized approximation scheme for the multiple knapsack problem
SIAM Journal on Computing | 2010-09-06 | Paper |
On strip packing with rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
An asymptotic approximation algorithm for 3D-strip packing
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Bin packing with fixed number of bins revisited
Lecture Notes in Computer Science | 2010-06-22 | Paper |
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Approximation algorithms for multiple strip packing
Approximation and Online Algorithms | 2010-05-11 | Paper |
Approximation schemes for scheduling jobs with chain precedence constraints
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
A structural lemma in 2-dimensional packing, and its implications on approximability
Algorithms and Computation | 2009-12-17 | Paper |
Two for One: Tight Approximation of 2D Bin Packing
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization | 2009-08-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
Automata, Languages and Programming | 2009-07-14 | Paper |
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
An Approximation Algorithm for the General Mixed Packing and Covering Problem
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
New Approximability Results for 2-Dimensional Packing Problems
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
Automata, Languages and Programming | 2008-08-28 | Paper |
Grouping techniques for scheduling problems: simpler and faster
Algorithmica | 2008-07-01 | Paper |
Approximation Algorithms for Geometric Intersection Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
A Polynomial Time Approximation Scheme for the Square Packing Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Approximation algorithms for general packing problems and their application to the multicast congestion problem
Mathematical Programming. Series A. Series B | 2008-06-03 | Paper |
| Approximative Algorithmen und Nichtapproximierbarkeit | 2008-05-20 | Paper |
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Journal of Scheduling | 2007-12-20 | Paper |
Approximation Algorithms for 3D Orthogonal Knapsack
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
Experimental Algorithms | 2007-09-14 | Paper |
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
The \(d\)-precoloring problem for \(k\)-degenerate graphs
Discrete Mathematics | 2007-06-26 | Paper |
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science | 2007-06-06 | Paper |
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
SIAM Journal on Optimization | 2007-05-22 | Paper |
Maximizing the total profit of rectangles packed into a rectangle
Algorithmica | 2007-04-26 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
An approximation algorithm for the general max-min resource sharing problem
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
SIAM Journal on Computing | 2006-06-01 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Mathematics of Operations Research | 2005-11-11 | Paper |
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
SIAM Journal on Computing | 2005-10-28 | Paper |
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing | 2005-09-16 | Paper |
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
International Journal of Foundations of Computer Science | 2005-09-12 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Approximation schemes for job shop scheduling problems with controllable processing times
European Journal of Operational Research | 2005-08-04 | Paper |
A memetic algorithm to schedule planned maintenance for the national grid
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
| scientific article; zbMATH DE number 2185607 (Why is no real title available?) | 2005-07-04 | Paper |
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2163023 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2163022 (Why is no real title available?) | 2005-04-29 | Paper |
Approximation schemes for parallel machine scheduling problems with controllable processing times
Computers & Operations Research | 2004-11-12 | Paper |
Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086377 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086932 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080224 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080263 (Why is no real title available?) | 2004-08-04 | Paper |
An asymptotic fully polynomial time approximation scheme for bin covering.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2044496 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044932 (Why is no real title available?) | 2004-02-18 | Paper |
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Graph Subcolorings: Complexity and Algorithms
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1979497 (Why is no real title available?) | 2003-09-14 | Paper |
The mutual exclusion scheduling problem for permutation and comparability graphs.
Information and Computation | 2003-08-19 | Paper |
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
Theoretical Computer Science | 2003-08-17 | Paper |
Computing optimal preemptive schedules for parallel tasks: linear programming approaches
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1947422 (Why is no real title available?) | 2003-07-08 | Paper |
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1877047 (Why is no real title available?) | 2003-03-05 | Paper |
| scientific article; zbMATH DE number 1839475 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1839427 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1759431 (Why is no real title available?) | 2002-11-04 | Paper |
| Polynomial-time approximation schemes for geometric graphs | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1754641 (Why is no real title available?) | 2002-06-12 | Paper |
Linear-Time approximation schemes for scheduling malleable parallel tasks
Algorithmica | 2002-05-21 | Paper |
| scientific article; zbMATH DE number 1688377 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670878 (Why is no real title available?) | 2001-12-06 | Paper |
The maximum edge-disjoint paths problem in bidirected trees
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
An approximation scheme for bin packing with conflicts
Journal of Combinatorial Optimization | 2001-11-06 | Paper |
The complexity of path coloring and call scheduling
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1560345 (Why is no real title available?) | 2001-02-01 | Paper |
Approximation Results for the Optimum Cost Chromatic Partition Problem
Journal of Algorithms | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1512677 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1500536 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1496855 (Why is no real title available?) | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418275 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1414279 (Why is no real title available?) | 2000-03-16 | Paper |
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1354124 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1333600 (Why is no real title available?) | 1999-09-19 | Paper |
| scientific article; zbMATH DE number 1305441 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1241387 (Why is no real title available?) | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1163713 (Why is no real title available?) | 1998-09-06 | Paper |
| scientific article; zbMATH DE number 1189243 (Why is no real title available?) | 1998-08-13 | Paper |
| scientific article; zbMATH DE number 1163711 (Why is no real title available?) | 1998-08-04 | Paper |
| scientific article; zbMATH DE number 1107733 (Why is no real title available?) | 1998-06-23 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
The disjoint cliques problem
RAIRO - Operations Research | 1998-02-19 | Paper |
Generalized coloring for tree-like graphs
Discrete Applied Mathematics | 1997-08-10 | Paper |
Approximation algorithms for time constrained scheduling
Information and Computation | 1997-07-06 | Paper |
The minimum broadcast time problem for several processor networks
Theoretical Computer Science | 1997-02-28 | Paper |
Restrictions of graph partition problems. I
Theoretical Computer Science | 1997-02-28 | Paper |
On the complexity of allocation problems in high-level synthesis
Integration | 1997-02-27 | Paper |
A rainbow about \(T\)-colorings for complete graphs
Discrete Mathematics | 1996-11-25 | Paper |
Scheduling of conditional executed jobs on unrelated processors
Discrete Applied Mathematics | 1996-05-30 | Paper |
An approximation algorithm for the license and shift class design problem
European Journal of Operational Research | 1995-02-19 | Paper |
Scheduling with incompatible jobs
Discrete Applied Mathematics | 1995-02-01 | Paper |
UET-scheduling with chain-type precedence constraints
Computers & Operations Research | 1995-01-01 | Paper |
Analysis of scheduling problems with typed task systems
Discrete Applied Mathematics | 1994-09-27 | Paper |
| scientific article; zbMATH DE number 512918 (Why is no real title available?) | 1994-07-14 | Paper |
| scientific article; zbMATH DE number 598111 (Why is no real title available?) | 1994-06-29 | Paper |
| scientific article; zbMATH DE number 512916 (Why is no real title available?) | 1994-06-20 | Paper |
Scheduling of incompatible jobs on unrelated machines
International Journal of Foundations of Computer Science | 1994-05-09 | Paper |
| scientific article; zbMATH DE number 512917 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 522858 (Why is no real title available?) | 1994-03-24 | Paper |
The complexity of detecting crossingfree configurations in the plane
BIT | 1994-03-22 | Paper |
One strike against the min-max degree triangulation problem
Computational Geometry | 1993-10-17 | Paper |
Bounds for the general capacitated routing problem
Networks | 1993-09-05 | Paper |
The allocation problem in hardware design
Discrete Applied Mathematics | 1993-08-17 | Paper |
Scheduling with constrained processor allocation for interval orders
Computers & Operations Research | 1993-08-10 | Paper |
Transfer flow graphs
Discrete Mathematics | 1993-06-20 | Paper |
The interconnection problem
Journal of Computer and System Sciences | 1993-05-16 | Paper |
An approximation algorithm for the general routing problem
Information Processing Letters | 1993-01-16 | Paper |
Processor optimization for flow graphs
Theoretical Computer Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 19351 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4197386 (Why is no real title available?) | 1990-01-01 | Paper |
