Ilan Doron-Arad

Idan Mehalel

Elchanan Mossel

CoRR, February, 2026

Why ReLU? A Bit-Model Dichotomy for Deep Network Training.

[BibT_eX]

[DOI]

Elchanan Mossel

CoRR, February, 2026

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection.

[BibT_eX]

[DOI]

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

On the PTAS Complexity of Multidimensional Knapsack.

[BibT_eX]

[DOI]

Pasin Manurangsi

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

An Algorithm-to-Contract Framework without Demand Queries.

[BibT_eX]

[DOI]

CoRR, July, 2025

Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

On the Hardness of Training Deep Neural Networks Discretely.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

Fine Grained Lower Bounds for Multidimensional Knapsack.

[BibT_eX]

[DOI]

Pasin Manurangsi

CoRR, 2024

Approximations and Hardness of Packing Partially Ordered Items.

[BibT_eX]

[DOI]

CoRR, 2024

Approximations and Hardness of Covering and Packing Partially Ordered Items.

[BibT_eX]

[DOI]

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

Unsplittable Flow on a Short Path.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Non-Linear Paging.

[BibT_eX]

[DOI]

Joseph (Seffi) Naor

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Lower Bounds for Matroid Optimization Problems with a Linear Constraint.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

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

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

An FPTAS for budgeted laminar matroid independent set.

[BibT_eX]

[DOI]

Oper. Res. Lett., November, 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]