| Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. | 0 | 0.34 | 2021 |
| Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. | 0 | 0.34 | 2020 |
| Structural parameters for scheduling with assignment restrictions. | 1 | 0.35 | 2020 |
| Makespan minimization on unrelated parallel machines with a few bags. | 0 | 0.34 | 2020 |
| Approximation algorithms for the graph balancing problem with two speeds and two job lengths | 0 | 0.34 | 2019 |
| A local search algorithm for the constrained max cut problem on hypergraphs. | 0 | 0.34 | 2018 |
| Labeling Total Graphs with a Condition at Distance Two. | 0 | 0.34 | 2018 |
| Makespan Minimization on Unrelated Parallel Machines with a Few Bags. | 0 | 0.34 | 2018 |
| Labeling Mycielski Graphs with a Condition at Distance Two. | 0 | 0.34 | 2018 |
| L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. | 1 | 0.36 | 2017 |
| Structural Parameters for Scheduling with Assignment Restrictions. | 2 | 0.37 | 2017 |
| A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves | 10 | 0.70 | 2017 |
| A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights. | 4 | 0.46 | 2016 |
| A New Characterization of Disk Graphs and its Application. | 0 | 0.34 | 2016 |
| On some results for the L(2, 1)-labeling on Cartesian sum graphs. | 0 | 0.34 | 2016 |
| Special Issue on Approximation and Online Algorithms | 0 | 0.34 | 2015 |
| Analysis of a local search algorithm for the k-facility location problem. | 0 | 0.34 | 2015 |
| SAGE: String-overlap Assembly of GEnomes. | 6 | 0.65 | 2014 |
| Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings | 45 | 2.63 | 2013 |
| L(2, 1)L(2, 1)-labelings on the modular product of two graphs. | 4 | 0.41 | 2013 |
| Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers | 22 | 1.23 | 2012 |
| Packing Squares with Profits | 0 | 0.34 | 2012 |
| A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption | 0 | 0.34 | 2011 |
| Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers | 20 | 0.89 | 2011 |
| Improved Lower Bound for Online Strip Packing - (Extended Abstract). | 1 | 0.35 | 2011 |
| A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths | 0 | 0.34 | 2011 |
| An OPT+1 algorithm for the cutting stock problem with constant number of object lengths | 2 | 0.43 | 2010 |
| Approximation Schemes For Scheduling Jobs With Chain Precedence Constraints | 0 | 0.34 | 2010 |
| L(2,1)-Labelings on the composition of n graphs | 4 | 0.43 | 2010 |
| Improvements on Existing Search Engines through Categorization | 0 | 0.34 | 2010 |
| Rectangle packing with one-dimensional resource augmentation | 18 | 0.74 | 2009 |
| Improving the Performance of Online Mapping Applications with Prefetching | 0 | 0.34 | 2009 |
| On Packing Rectangles with Resource Augmentation: Maximizing the Profit | 1 | 0.36 | 2008 |
| A polynomial time approximation scheme for the square packing problem | 13 | 0.59 | 2008 |
| Web Prefetching with Machine Learning Algorithms | 1 | 0.37 | 2008 |
| New approximability results for 2-dimensional packing problems | 18 | 0.82 | 2007 |
| Efficient algorithms for robustness in resource allocation and scheduling problems | 1 | 0.36 | 2006 |
| Gene assembly algorithms for ciliates | 0 | 0.34 | 2006 |
| An asymptotic approximation algorithm for 3D-strip packing | 17 | 0.76 | 2006 |
| On packing squares with resource augmentation: maximizing the profit | 5 | 0.49 | 2005 |
| Packing weighted rectangles into a square | 17 | 0.87 | 2005 |
| Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers | 18 | 1.20 | 2005 |
| Reducing the size of NFAs by using equivalences and preorders | 23 | 4.68 | 2005 |
| Approximation schemes for job shop scheduling problems with controllable processing times | 20 | 0.89 | 2005 |
| Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers | 24 | 1.77 | 2004 |
| An asymptotic fully polynomial time approximation scheme for bin covering | 8 | 0.56 | 2003 |
| Approximation algorithms for scheduling jobs with chain precedence constraints | 5 | 0.56 | 2003 |
| Makespan Minimization in Job Shops: A Linear Time Approximation Scheme | 20 | 0.90 | 2003 |
| A framework for designing approximation algorithms for scheduling problems | 0 | 0.34 | 2003 |
| Approximation Algorithms for Bounded Facility Location Problems | 4 | 0.44 | 2001 |
