An APTAS for Bin Packing with Clique-graph Conflicts. - Ilan Doron-Arad; Hadas Shachnai (CoRR, 2020)

An APTAS for Bin Packing with Clique-Graph Conflicts. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (WADS, 2021)

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2022)

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (APPROX/RANDOM, 2023)

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (ICALP, 2023)

Budgeted Matroid Maximization: a Parameterized Viewpoint. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (IPEC, 2023)

An EPTAS for Budgeted Matroid Independent Set. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (SOSA, 2023)

Approximating Bin Packing with Conflict Graphs via Maximization Techniques. - Ilan Doron-Arad; Hadas Shachnai (WG, 2023)

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2023)

Tight Lower Bounds for Weighted Matroid Problems. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2023)

An FPTAS for budgeted laminar matroid independent set. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (Oper. Res. Lett., 2023)

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (APPROX/RANDOM, 2024)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (ICALP, 2024)

Non-Linear Paging. - Ilan Doron-Arad; Joseph (Seffi) Naor (ICALP, 2024)

Unsplittable Flow on a Short Path. - Ilan Doron-Arad; Fabrizio Grandoni 001; Ariel Kulik (IPEC, 2024)

Approximations and Hardness of Covering and Packing Partially Ordered Items. - Ilan Doron-Arad; Guy Kortsarz; Joseph Naor; Baruch Schieber; Hadas Shachnai (WG, 2024)

Approximations and Hardness of Packing Partially Ordered Items. - Ilan Doron-Arad; Guy Kortsarz; Joseph Naor; Baruch Schieber; Hadas Shachnai (CoRR, 2024)

Fine Grained Lower Bounds for Multidimensional Knapsack. - Ilan Doron-Arad; Ariel Kulik; Pasin Manurangsi (CoRR, 2024)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2024)

On the Hardness of Training Deep Neural Networks Discretely. - Ilan Doron-Arad (AAAI, 2025)

Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs. - Ilan Doron-Arad; Hadas Shachnai (Discret. Appl. Math., 2025)

An Algorithm-to-Contract Framework without Demand Queries. - Ilan Doron-Arad; Hadas Shachnai; Gilad Shmerler; Inbal Talgam-Cohen (CoRR, 2025)