Ilan Doron-Arad

35 papers A* 5A 3B 5Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
On the PTAS Complexity of Multidimensional Knapsack.
ITCS
Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi
2026 J jnl
Online Realizable Regression and Applications for ReLU Networks.
CoRR
Ilan Doron-Arad, Idan Mehalel, Elchanan Mossel
2026 J jnl
Why ReLU? A Bit-Model Dichotomy for Deep Network Training.
CoRR
Ilan Doron-Arad, Elchanan Mossel
2026 A* conf
You (Almost) Can't Beat Brute Force for 3-Matroid Intersection.
SODA
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2025 J jnl
An Algorithm-to-Contract Framework without Demand Queries.
CoRR
Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler, Inbal Talgam-Cohen
2025 A* conf
On the Hardness of Training Deep Neural Networks Discretely.
AAAI
Ilan Doron-Arad
2025 J jnl
Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs.
Discret. Appl. Math.
Ilan Doron-Arad, Hadas Shachnai
2024 A conf
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding.
APPROX/RANDOM
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024 B conf
Approximations and Hardness of Covering and Packing Partially Ordered Items.
WG
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024 J jnl
Approximations and Hardness of Packing Partially Ordered Items.
CoRR
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024 J jnl
Fine Grained Lower Bounds for Multidimensional Knapsack.
CoRR
Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi
2024 A* conf
Lower Bounds for Matroid Optimization Problems with a Linear Constraint.
ICALP
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024 A* conf
Non-Linear Paging.
ICALP
Ilan Doron-Arad, Joseph (Seffi) Naor
2024 J jnl
Non-Linear Paging.
CoRR
Ilan Doron-Arad, Joseph Naor
2024 J jnl
On the Hardness of Training Deep Neural Networks Discretely.
CoRR
Ilan Doron-Arad
2024 B conf
Unsplittable Flow on a Short Path.
IPEC
Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2024 J jnl
Unsplittable Flow on a Short Path.
CoRR
Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2024 J jnl
You (Almost) Can't Beat Brute Force for 3-Matroid Intersection.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 A conf
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding.
APPROX/RANDOM
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 A* conf
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets.
ICALP
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 — conf
An EPTAS for Budgeted Matroid Independent Set.
SOSA
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
An FPTAS for Budgeted Laminar Matroid Independent Set.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
An FPTAS for budgeted laminar matroid independent set.
Oper. Res. Lett.
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 B conf
Approximating Bin Packing with Conflict Graphs via Maximization Techniques.
WG
Ilan Doron-Arad, Hadas Shachnai
2023 J jnl
Approximating Bin Packing with Conflict Graphs via Maximization Techniques.
CoRR
Ilan Doron-Arad, Hadas Shachnai
2023 B conf
Budgeted Matroid Maximization: a Parameterized Viewpoint.
IPEC
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
Budgeted Matroid Maximization: a Parameterized Viewpoint.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023 J jnl
Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs.
CoRR
Ilan Doron-Arad, Hadas Shachnai
2023 J jnl
Tight Lower Bounds for Weighted Matroid Problems.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022 J jnl
An EPTAS for Budgeted Matroid Independent Set.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022 J jnl
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins.
CoRR
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2021 B conf
An APTAS for Bin Packing with Clique-Graph Conflicts.
WADS
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2020 J jnl
An APTAS for Bin Packing with Clique-graph Conflicts.
CoRR
Ilan Doron-Arad, Hadas Shachnai