Get started
Author

Ilan Doron-Arad

Observed names: Arad, Ilan Doron, Doron-Arad, Ilan, Ilan Doron Arad
ORCID: 0009-0007-9235-2175
Observed ORCID: 0009-0007-9235-2175
OpenAlex ID: A5063648053
An FPTAS for budgeted laminar matroid independent set
2023 · Ilan Doron-Arad, Ariel Kulik, et al. · Operations Research Letters · 6
PDF
An EPTAS for Budgeted Matroid Independent Set
2023 · Ilan Doron-Arad, Ariel Kulik, et al. · Society for Industrial and Applied Mathematics eBooks · 5
An APTAS for Bin Packing with Clique-Graph Conflicts
2021 · Ilan Doron-Arad, Ariel Kulik, et al. · Lecture notes in computer science · 4
PDF
Approximating Bin Packing with Conflict Graphs via Maximization Techniques
2023 · Ilan Doron-Arad, Hadas Shachnai · Lecture notes in computer science · 2
PDF
On the Hardness of Training Deep Neural Networks Discretely
2025 · Ilan Doron-Arad · Proceedings of the AAAI Conference on Artificial Intelligence · 1
PDF
Fine Grained Lower Bounds for Multidimensional Knapsack
2024 · Doron-Arad, Ilan, Kulik, Ariel, et al. · arXiv (Cornell University) · 1
PDF
Non-Linear Paging
2024 · Doron-Arad, Ilan, Joseph, et al. · arXiv (Cornell University) · 1
PDF
Budgeted Matroid Maximization: a Parameterized Viewpoint
2023 · Doron-Arad, Ilan, Kulik, Ariel, et al. · arXiv (Cornell University) · 1
PDF
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets
2022 · Doron-Arad, Ilan, Kulik, Ariel, et al. · arXiv (Cornell University) · 1
PDF
An APTAS for Bin Packing with Clique-graph Conflicts
2020 · Ilan Doron Arad, Hadas Shachnai · arXiv (Cornell University) · 1
On the VC Dimension of Autoregressive Linear Threshold Functions
2026 · Doron-Arad, Ilan, Mehalel, Idan, et al. · arXiv (Cornell University)
More of the same? Are scientific papers losing originality?
2026 · Doron-Arad, Ilan, Mossel, Elchanan · arXiv (Cornell University)
PDF
Tight Approximation Results for Matroid Optimization with a Linear Constraint
2026 · Doron-Arad, Ilan, Shachnai, Hadas, et al. · arXiv (Cornell University)
A Tight $\widetilde Ω(\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover
2026 · Doron-Arad, Ilan, Joseph, et al. · arXiv (Cornell University)
PDF
Stochastic Autoregressive Learning
2026 · Doron-Arad, Ilan, Mehalel, Idan, et al. · arXiv (Cornell University)
PDF
An EPTAS for budgeted matching, budgeted matroid independent set, and budgeted matroid intersection via representative sets
2026 · Ilan Doron-Arad, Ariel Kulik, et al. · Mathematical Programming
Incremental Dominating Set
2026 · Arad, Ilan Doron, Gal, Jonathan, et al. · arXiv (Cornell University)
Genetic Algorithms with Optimization Guided Operators
2026 · Brandenberger, Anna, Doron-Arad, Ilan, et al. · arXiv (Cornell University)
PDF
A lower bound for Jaccard center
2026 · Ilan Doron-Arad · Information Processing Letters
A Theory of Online Learning with Autoregressive Chain-of-Thought Reasoning
2026 · Doron-Arad, Ilan, Mehalel, Idan, et al. · arXiv (Cornell University)
PDF
Why ReLU? A Bit-Model Dichotomy for Deep Network Training
2026 · Doron-Arad, Ilan, Mossel, Elchanan · arXiv (Cornell University)
PDF
Online Realizable Regression and Applications for ReLU Networks
2026 · Doron-Arad, Ilan, Mehalel, Idan, et al. · arXiv (Cornell University)
PDF
You (Almost) Can’t Beat Brute Force for 3-Matroid Intersection
2026 · Ilan Doron-Arad, Ariel Kulik, et al. · Society for Industrial and Applied Mathematics eBooks
PDF
Incremental Dominating Set
2026 · Arad, Ilan Doron, Gal, Jonathan, et al. · arXiv (Cornell University)
PDF
Tight Approximation Results for Matroid Optimization with a Linear Constraint
2026 · Doron-Arad, Ilan, Shachnai, Hadas, et al. · arXiv (Cornell University)
PDF
Works count: 39
Citation count: 25
H-index: 3
I10-index:
Year
Topic
Type