| 2025 | IPCO | (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. | Christoph Hunkenschrder, Martin Kouteck, Asaf Levin, Tung Anh Vu |
| 2025 | MFCS | An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines. | Leah Epstein, Asaf Levin |
| 2025 | STACS | Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines. | Leah Epstein, Asaf Levin |
| 2025 | WADS | An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. | Leah Epstein, Asaf Levin |
| 2025 | WADS | Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. | Leah Epstein, Asaf Levin |
| 2024 | IPCO | Tight Lower Bounds for Block-Structured Integer Programs. | Christoph Hunkenschrder, Kim-Manuel Klein, Martin Kouteck, Alexandra Lassota, Asaf Levin |
| 2022 | STACS | Cardinality Constrained Scheduling in Online Models. | Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2021 | WAOA | EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. | G. Jaykrishnan, Asaf Levin |
| 2019 | ESA | Online Bin Covering with Limited Migration. | Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2019 | WAOA | A New Lower Bound for Classic Online Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2018 | CiE | A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines. | Ishai Kones, Asaf Levin |
| 2018 | ESA | A New and Improved Algorithm for Online Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2018 | ICALP | A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. | Martin Kouteck, Asaf Levin, Shmuel Onn |
| 2017 | ESA | Online Bin Packing with Cardinality Constraints Resolved. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2017 | WAOA | Lower Bounds for Several Online Variants of Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2017 | WAOA | Deadline TSP. | Boaz Farbstein, Asaf Levin |
| 2016 | CSR | Online Bounded Analysis. | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin |
| 2016 | WAOA | Batch Coloring of Graphs. | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin |
| 2013 | SODA | A unified approach to truthful scheduling on related machines. | Leah Epstein, Asaf Levin, Rob van Stee |
| 2013 | STACS | Improved Bounds for Online Preemptive Matching. | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
| 2012 | WG | The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
| 2011 | ESA | Robust Algorithms for Preemptive Scheduling. | Leah Epstein, Asaf Levin |
| 2011 | ICALP | On Variants of File Caching. | Leah Epstein, Csand Imreh, Asaf Levin, Judit Nagy-Gyrgy |
| 2010 | ICALP | Max-min Online Allocations with a Reordering Buffer. | Leah Epstein, Asaf Levin, Rob van Stee |
| 2010 | IPCO | Universal Sequencing on a Single Machine. | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julin Mestre, Martin Skutella, Leen Stougie |
| 2010 | MFCS | Online Clustering with Variable Sized Clusters. | Jnos Csirik, Leah Epstein, Csand Imreh, Asaf Levin |
| 2010 | PODC | Finding mobile data under delay constraints with searching costs. | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin |
| 2010 | STACS | Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. | Leah Epstein, Asaf Levin, Julin Mestre, Danny Segev |
| 2009 | SAGT | On Equilibria for ADM Minimization Games. | Leah Epstein, Asaf Levin |
| 2008 | ESA | Improved Randomized Results for That Interval Selection Problem. | Leah Epstein, Asaf Levin |
| 2007 | FCT | Multi-dimensional Packing with Conflicts. | Leah Epstein, Asaf Levin, Rob van Stee |
| 2007 | WAOA | On the Max Coloring Problem. | Leah Epstein, Asaf Levin |
| 2007 | WAOA | Minimum Weighted Sum Bin Packing. | Leah Epstein, Asaf Levin |
| 2007 | WAOA | Covering the Edges of Bipartite Graphs Using | Dorit S. Hochbaum, Asaf Levin |
| 2006 | ESA | Graph Coloring with Rejection. | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
| 2006 | ICALP | A Robust APTAS for the Classical Bin Packing Problem. | Leah Epstein, Asaf Levin |
| 2006 | WAOA | On Bin Packing with Conflicts. | Leah Epstein, Asaf Levin |
| 2006 | WAOA | The | Dorit S. Hochbaum, Asaf Levin |
| 2006 | WAOA | Approximating the Unweighted | Asaf Levin |
| 2005 | ESA | An Approximation Algorithm for the Minimum Latency Set Cover Problem. | Refael Hassin, Asaf Levin |
| 2005 | WAOA | SONET ADMs Minimization with Divisible Paths. | Leah Epstein, Asaf Levin |
| 2005 | WAOA | The Conference Call Search Problem in Wireless Networks. | Leah Epstein, Asaf Levin |
| 2005 | WAOA | Partial Multicuts in Trees. | Asaf Levin, Danny Segev |
| 2004 | ESA | Approximation Algorithms for Quickest Spanning Tree Problems. | Refael Hassin, Asaf Levin |
| 2004 | IPCO | The Constrained Minimum Weighted Sum of Job Completion Times Problem. | Asaf Levin, Gerhard J. Woeginger |
| 2004 | WAOA | A PTAS for Delay Minimization in Establishing Wireless Conference Calls. | Leah Epstein, Asaf Levin |
| 2004 | WAOA | Better Bounds for Minimizing SONET ADMs. | Leah Epstein, Asaf Levin |
| 2003 | ESA | The Minimum Generalized Vertex Cover Problem. | Refael Hassin, Asaf Levin |
| 2003 | WG | The Complexity of Graph Contractions. | Asaf Levin, Danil Paulusma, Gerhard J. Woeginger |
| 2001 | IPCO | Synthesis of 2-Commodity Flow Networks. | Refael Hassin, Asaf Levin |