On Lagrangian Relaxation and Subset Selection Problems. - Ariel Kulik; Hadas Shachnai (WAOA, 2008)

Maximizing submodular set functions subject to multiple linear constraints. - Ariel Kulik; Hadas Shachnai; Tami Tamir (SODA, 2009)

There is no EPTAS for two-dimensional knapsack. - Ariel Kulik; Hadas Shachnai (Inf. Process. Lett., 2010)

Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints - Ariel Kulik; Hadas Shachnai; Tami Tamir (CoRR, 2011)

Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. - Ariel Kulik; Hadas Shachnai; Oded Shmueli; Robert Sayegh (Theor. Comput. Sci., 2011)

Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. - Ariel Kulik; Hadas Shachnai; Tami Tamir (Math. Oper. Res., 2013)

On Lagrangian Relaxation and Reoptimization Problems. - Ariel Kulik; Hadas Shachnai; Gal Tamir (CoRR, 2015)

Parameterized approximation via fidelity preserving transformations. - Michael R. Fellows; Ariel Kulik; Frances A. Rosamond; Hadas Shachnai (J. Comput. Syst. Sci., 2018)

Generalized Assignment via Submodular Optimization with Reserved Capacity. - Ariel Kulik; Kanthi K. Sarpatwar; Baruch Schieber; Hadas Shachnai (ESA, 2019)

Cooperative Rule Caching for SDN Switches. - Ori Rottenstreich; Ariel Kulik; Ananya Joshi 001; Jennifer Rexford; Gábor Rétvári; Daniel S. Menasché (CloudNet, 2020)

A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. - Yaron Fairstein; Ariel Kulik; Joseph (Seffi) Naor; Danny Raz; Hadas Shachnai (ESA, 2020)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. - Ariel Kulik; Hadas Shachnai (FOCS, 2020)

tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. - Yaron Fairstein; Ariel Kulik; Hadas Shachnai (CoRR, 2020)

General Knapsack Problems in a Dynamic Setting. - Yaron Fairstein; Ariel Kulik; Joseph (Seffi) Naor; Danny Raz (APPROX-RANDOM, 2021)

Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. - Yaron Fairstein; Ariel Kulik; Hadas Shachnai (ESA, 2021)

An APTAS for Bin Packing with Clique-Graph Conflicts. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (WADS, 2021)

A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. - Ariel Kulik; Roy Schwartz 002; Hadas Shachnai (CoRR, 2021)

On Lagrangian relaxation for constrained maximization and reoptimization problems. - Ariel Kulik; Hadas Shachnai; Gal Tamir (Discret. Appl. Math., 2021)

A refined analysis of submodular Greedy. - Ariel Kulik; Roy Schwartz 002; Hadas Shachnai (Oper. Res. Lett., 2021)

Submodular Maximization with Assignment Constraints and Parameterized Approximations. - Ariel Kulik (2021)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (ESA, 2022)

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. - Ariel Kulik; Matthias Mnich; Hadas Shachnai (CoRR, 2022)

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2022)

An almost optimal approximation algorithm for monotone submodular multiple knapsack. - Yaron Fairstein; Ariel Kulik; Joseph (Seffi) Naor; Danny Raz; Hadas Shachnai (J. Comput. Syst. Sci., 2022)

Data Plane Cooperative Caching With Dependencies. - Ori Rottenstreich; Ariel Kulik; Ananya Joshi 001; Jennifer Rexford; Gábor Rétvári; Daniel Sadoc Menasché (IEEE Trans. Netw. Serv. Manag., 2022)

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (APPROX/RANDOM, 2023)

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. - Ariel Kulik; Matthias Mnich; Hadas Shachnai (FOCS, 2023)

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (ICALP, 2023)

Budgeted Matroid Maximization: a Parameterized Viewpoint. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (IPEC, 2023)

Approximate Monotone Local Search for Weighted Problems. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (IPEC, 2023)

An EPTAS for Budgeted Matroid Independent Set. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (SOSA, 2023)

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2023)

Tight Lower Bounds for Weighted Matroid Problems. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2023)

An FPTAS for budgeted laminar matroid independent set. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (Oper. Res. Lett., 2023)

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (APPROX/RANDOM, 2024)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (ICALP, 2024)

Unsplittable Flow on a Short Path. - Ilan Doron-Arad; Fabrizio Grandoni 001; Ariel Kulik (IPEC, 2024)

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (SODA, 2024)

Fine Grained Lower Bounds for Multidimensional Knapsack. - Ilan Doron-Arad; Ariel Kulik; Pasin Manurangsi (CoRR, 2024)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. - Ilan Doron-Arad; Ariel Kulik; Hadas Shachnai (CoRR, 2024)

Computing Generalized Convolutions Faster Than Brute Force. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Philipp Schepper; Karol Wegrzycki (Algorithmica, 2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. - Baris Can Esmer; Ariel Kulik (ICALP, 2025)

Improved approximation for two-dimensional vector multiple knapsack. - Tomer Cohen; Ariel Kulik; Hadas Shachnai (Comput. Geom., 2025)