| 2026 | SODA | You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2025 | IJCAI | Finding Possible Winners in Spatial Voting with Incomplete Information. | Hadas Shachnai, Rotem Shavitt, Andreas Wiese |
| 2024 | AAAI | Spatial Voting with Incomplete Voter Information. | Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld |
| 2024 | ICALP | Lower Bounds for Matroid Optimization Problems with a Linear Constraint. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2024 | WG | Approximations and Hardness of Covering and Packing Partially Ordered Items. | Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2023 | FOCS | Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. | Ariel Kulik, Matthias Mnich, Hadas Shachnai |
| 2023 | ICALP | An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2023 | ISAAC | Improved Approximation for Two-Dimensional Vector Multiple Knapsack. | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
| 2023 | WG | Approximating Bin Packing with Conflict Graphs via Maximization Techniques. | Ilan Doron-Arad, Hadas Shachnai |
| 2021 | ESA | Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. | Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
| 2021 | WADS | An APTAS for Bin Packing with Clique-Graph Conflicts. | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2020 | ESA | A (1-e | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai |
| 2020 | FOCS | Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. | Ariel Kulik, Hadas Shachnai |
| 2019 | ESA | Generalized Assignment via Submodular Optimization with Reserved Capacity. | Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
| 2018 | SPAA | Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. | Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
| 2017 | Algosensors | Fast Distributed Approximation for Max-Cut. | Keren Censor-Hillel, Rina Levy, Hadas Shachnai |
| 2016 | ALENEX | Real-Time k-bounded Preemptive Scheduling. | Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir |
| 2016 | SPAA | Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. | Dmitriy Katz, Baruch Schieber, Hadas Shachnai |
| 2015 | ESA | A Multivariate Approach for Weighted FPT Algorithms. | Hadas Shachnai, Meirav Zehavi |
| 2014 | ESA | Representative Families: A Unified Tradeoff-Based Approach. | Hadas Shachnai, Meirav Zehavi |
| 2014 | INFOCOM | Scheduling jobs with dwindling resource requirements in clouds. | Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir |
| 2014 | MFCS | Deterministic Parameterized Algorithms for the Graph Motif Problem. | Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi |
| 2014 | MFCS | Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). | Hadas Shachnai, Ariella Voloshin, Shmuel Zaks |
| 2014 | WG | Parameterized Algorithms for Graph Partitioning Problems. | Hadas Shachnai, Meirav Zehavi |
| 2013 | ESA | Tractable Parameterizations for the Minimum Linear Arrangement Problem. | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai |
| 2013 | IPCO | All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. | Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir |
| 2013 | IPCO | The Euclidean k-Supplier Problem. | Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai |
| 2012 | Algosensors | Packing Resizable Items with Application to Video Delivery over Wireless Networks. | Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir |
| 2012 | ICALP | Parameterized Approximation via Fidelity Preserving Transformations. | Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai |
| 2012 | LATIN | A Theory and Algorithms for Combinatorial Reoptimization. | Hadas Shachnai, Gal Tamir, Tami Tamir |
| 2011 | SODA | Fast Information Spreading in Graphs with Large Weak Conductance. | Keren Censor-Hillel, Hadas Shachnai |
| 2010 | FUN | Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. | Magns M. Halldrsson, Hadas Shachnai |
| 2010 | PODC | Partial information spreading with application to distributed maximum coverage. | Keren Censor-Hillel, Hadas Shachnai |
| 2009 | SODA | Maximizing submodular set functions subject to multiple linear constraints. | Ariel Kulik, Hadas Shachnai, Tami Tamir |
| 2009 | WAOA | Minimal Cost Reconfiguration of Data Placement in Storage Area Network. | Hadas Shachnai, Gal Tamir, Tami Tamir |
| 2008 | WAOA | On Lagrangian Relaxation and Subset Selection Problems. | Ariel Kulik, Hadas Shachnai |
| 2007 | FCT | Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. | Hadas Shachnai, Omer Yehezkely |
| 2006 | PODC | Transactional contention management as a non-clairvoyant scheduling problem. | Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir |
| 2005 | ESA | Fairness-Free Periodic Scheduling with Vacations. | Jir Sgall, Hadas Shachnai, Tami Tamir |
| 2005 | WAOA | Approximation Schemes for Packing with Item Fragmentation. | Hadas Shachnai, Tami Tamir, Omer Yehezkely |
| 2004 | ICALP | Improved Results for Data Migration and Open Shop Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2004 | WAOA | Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2004 | WAOA | Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. | Hadas Shachnai, Oded Shmueli, Robert Sayegh |
| 2003 | ICALP | Real-Time Scheduling with a Budget. | Joseph Naor, Hadas Shachnai, Tami Tamir |
| 2002 | ESA | Minimizing Makespan and Preemption Costs on a System of Uniform Machines. | Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger |
| 2002 | LATIN | Tight Bounds for Online Class-Constrained Packing. | Hadas Shachnai, Tami Tamir |
| 2002 | SODA | Throughput maximization of real-time scheduling with batching. | Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2002 | SODA | Scheduling split intervals. | Reuven Bar-Yehuda, Magns M. Halldrsson, Joseph Naor, Hadas Shachnai, Irina Shapira |
| 2001 | ESA | Strongly Competitive Algorithms for Caching with Pipelined Prefetching. | Alexander Gaysinsky, Alon Itai, Hadas Shachnai |
| 2001 | SPAA | Finding large independent sets of hypergraphs in parallel. | Hadas Shachnai, Aravind Srinivasan |
| 1999 | COCOON | Multi-coloring Trees. | Magns M. Halldrsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
| 1999 | ESA | Sum Multi-coloring of Graphs. | Amotz Bar-Noy, Magns M. Halldrsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
| 1999 | SIGMETRICS | Self-Tuning Synchronization Mechanisms in Network Operating Systems. | Yuval Hershko, Daniel Segal, Hadas Shachnai |
| 1998 | MASCOTS | Dynamic Schemes for Speculative Execution of Code. | Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv |
| 1997 | MASCOTS | Channel Based Scheduling of Parallelizable Task. | Jason Glasgow, Hadas Shachnai |
| 1997 | OPODIS | IDABased Protocols for Reliable Multicast. | Hagit Attiya, Hadas Shachnai |
| 1995 | SIGMETRICS | DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer. | Joel L. Wolf, Philip S. Yu, Hadas Shachnai |
| 1994 | CIAC | Efficient Reorganization of Binary Search Trees. | Micha Hofri, Hadas Shachnai |