Ilan Doron-Arad
Technion - Israel Institute of Technology
H-index: 4
Asia-Israel
Top articles of Ilan Doron-Arad
Approximations and Hardness of Packing Partially Ordered Items
arXiv preprint arXiv:2403.01568
2024/3/3
Ilan Doron-Arad
H-Index: 0
Baruch Schieber
H-Index: 24
Non-Linear Paging
arXiv preprint arXiv:2404.13334
2024/4/20
Ilan Doron-Arad
H-Index: 0
An FPTAS for budgeted laminar matroid independent set
Operations Research Letters
2023/11/1
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
arXiv preprint arXiv:2308.12622
2023/8/24
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
arXiv preprint arXiv:2307.08592
2023/7/17
Ilan Doron-Arad
H-Index: 0
Tight lower bounds for weighted matroid problems
arXiv preprint arXiv:2307.07773
2023/7/15
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
Budgeted matroid maximization: a parameterized viewpoint
arXiv preprint arXiv:2307.04173
2023/7/9
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
Approximating bin packing with conflict graphs via maximization techniques
2023/6/28
Ilan Doron-Arad
H-Index: 0
An EPTAS for budgeted matching and budgeted matroid intersection
arXiv preprint arXiv:2302.05681
2023/2/11
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
An AFPTAS for bin packing with partition matroid via a new method for LP rounding
2023
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
Bin Packing with Partition Matroid can be Approximated within Bins
arXiv preprint arXiv:2212.01025
2022/12/2
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
An APTAS for bin packing with clique-graph conflicts
2021
Ilan Doron-Arad
H-Index: 0
Ariel Kulik
H-Index: 9
