| Load Balancing: The Long Road from Theory to Practice. | 0 | 0.34 | 2024 |
| A PTAS for Packing Hypercubes into a Knapsack | 0 | 0.34 | 2022 |
| Closing the Gap for Single Resource Constraint Scheduling. | 0 | 0.34 | 2021 |
| Peak Demand Minimization via Sliced Strip Packing. | 0 | 0.34 | 2021 |
| Frontmatter, Table of Contents, Preface, Conference Organization. | 0 | 0.34 | 2014 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings | 83 | 3.78 | 2013 |
| An Improved Knapsack Solver for Column Generation. | 2 | 0.39 | 2013 |
| A (5/3 + eps)-Approximation for 2D Strip Packing. | 0 | 0.34 | 2012 |
| Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). | 3 | 0.40 | 2011 |
| Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers | 17 | 0.99 | 2010 |
| On Packing Rectangles with Resource Augmentation: Maximizing the Profit | 1 | 0.36 | 2008 |
| Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 | 2 | 0.91 | 2007 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings | 32 | 2.61 | 2007 |
| 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes | 0 | 0.34 | 2007 |
| On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes | 2 | 0.37 | 2006 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings | 37 | 3.17 | 2006 |
| Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings | 30 | 14.68 | 2005 |
| 04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. | 0 | 0.34 | 2004 |
| Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers | 24 | 1.77 | 2004 |
| Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings | 35 | 3.22 | 2004 |
| Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NY, USA, August 24-26, 2003, Proceedings | 33 | 3.43 | 2003 |
| Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings | 22 | 1.55 | 2003 |
| Makespan Minimization in Job Shops: A Linear Time Approximation Scheme | 20 | 0.90 | 2003 |
| On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes | 24 | 1.52 | 2002 |
| Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function | 20 | 0.88 | 2002 |
| Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings | 12 | 1.09 | 2002 |
| On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates | 8 | 0.52 | 2001 |
| Approximation Algorithms for Fractional Covering and Packing Problems, and Applications | 2 | 0.42 | 2001 |
| Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings | 21 | 3.58 | 2001 |
| Improved Approximation Schemes for Scheduling Unrelated Parallel Machines | 54 | 2.33 | 2001 |
| Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings | 15 | 3.36 | 2000 |
| Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem | 13 | 0.76 | 2000 |
| On the Complexity of the Maximum Cut Problem | 14 | 0.85 | 2000 |
| A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs | 0 | 0.34 | 2000 |
| Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time | 9 | 0.80 | 2000 |
| Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring | 3 | 0.43 | 2000 |
| A Linear Time Approximation Scheme for the Job Shop Scheduling Problem | 8 | 0.81 | 1999 |
| Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings | 28 | 5.02 | 1999 |
| Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings | 17 | 2.89 | 1998 |
| Rankings of Graphs | 37 | 2.05 | 1998 |
| Algorithms Based on Randomization and Linear and Semidefinite Programming | 0 | 0.34 | 1998 |
| Maximizing the Number of Connections in Optical Tree Networks | 17 | 1.49 | 1998 |
| Constrained Bipartite Edge Coloring with Applications to Wavelength Routing | 29 | 2.53 | 1997 |
| Approximation Results for the Optimum Cost Partition Problem | 2 | 0.38 | 1997 |
| Off-Line and On-Line Call-Scheduling in Stars and Trees | 7 | 0.71 | 1997 |
| The Optimum Cost Chromatic Partition Problem | 36 | 1.87 | 1997 |
| A New Approximation Algorithm for the Register Allocation Problem | 0 | 0.34 | 1997 |
| An approximation scheme for scheduling of malleable parallel tasks. | 0 | 0.34 | 1997 |
| Restrictions of graph partition problems. Part I | 31 | 1.52 | 1995 |
| Scheduling of Incompatible Jobs on Unrelated Machines | 2 | 0.54 | 1993 |
