Ilan Doron Arad

Oper. Res. Lett., November, 2023

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Tight Lower Bounds for Weighted Matroid Problems.

[BibT_eX]

[DOI]

CoRR, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection.

[BibT_eX]

[DOI]

CoRR, 2023

Approximating Bin Packing with Conflict Graphs via Maximization Techniques.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

An EPTAS for Budgeted Matroid Independent Set.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Budgeted Matroid Maximization: a Parameterized Viewpoint.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins.

[BibT_eX]

[DOI]

CoRR, 2022

2021

An APTAS for Bin Packing with Clique-Graph Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

An APTAS for Bin Packing with Clique-graph Conflicts.

[BibT_eX]

[DOI]