Ariel Kulik - RankMe

64 papers A* 8A 7B 7Journal 37Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	On the PTAS Complexity of Multidimensional Knapsack. ITCS Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi
2026	J	`jnl`	Techniques in parameterized approximation. Comput. Sci. Rev. Ariel Kulik, Hadas Shachnai
2026	A*	`conf`	You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. SODA Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2025	J	`jnl`	Improved approximation for two-dimensional vector multiple knapsack. Comput. Geom. Tomer Cohen, Ariel Kulik, Hadas Shachnai
2025	A*	`conf`	Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. ICALP Baris Can Esmer, Ariel Kulik
2024	A	`conf`	An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. APPROX/RANDOM Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. Algorithmica Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2024	J	`jnl`	Fine Grained Lower Bounds for Multidimensional Knapsack. CoRR Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi
2024	A*	`conf`	Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2024	A*	`conf`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2024	J	`jnl`	Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. CoRR Baris Can Esmer, Ariel Kulik
2024	B	`conf`	Unsplittable Flow on a Short Path. IPEC Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2024	J	`jnl`	Unsplittable Flow on a Short Path. CoRR Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
2024	J	`jnl`	You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	A	`conf`	An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	A*	`conf`	An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	—	`conf`	An EPTAS for Budgeted Matroid Independent Set. SOSA Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	B	`conf`	Approximate Monotone Local Search for Weighted Problems. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	J	`jnl`	Approximate Monotone Local Search for Weighted Problems. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	B	`conf`	Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2023	B	`conf`	Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC Tomer Cohen, Ariel Kulik, Hadas Shachnai
2023	J	`jnl`	Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR Tomer Cohen, Ariel Kulik, Hadas Shachnai
2023	A*	`conf`	Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS Ariel Kulik, Matthias Mnich, Hadas Shachnai
2023	J	`jnl`	Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023	J	`jnl`	Tight Lower Bounds for Weighted Matroid Problems. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022	J	`jnl`	An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR Ariel Kulik, Matthias Mnich, Hadas Shachnai
2022	J	`jnl`	An EPTAS for Budgeted Matroid Independent Set. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022	J	`jnl`	An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
2022	J	`jnl`	Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2022	B	`conf`	Computing Generalized Convolutions Faster Than Brute Force. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel Sadoc Menasché
2022	A	`conf`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022	J	`jnl`	Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2021	J	`jnl`	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	J	`jnl`	A refined analysis of submodular Greedy. Oper. Res. Lett. Ariel Kulik, Roy Schwartz, Hadas Shachnai
2021	B	`conf`	An APTAS for Bin Packing with Clique-Graph Conflicts. WADS Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2021	—	`conf`	General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz
2021	J	`jnl`	General Knapsack Problems in a Dynamic Setting. CoRR Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz
2021	A	`conf`	Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA Yaron Fairstein, Ariel Kulik, Hadas Shachnai
2021	J	`jnl`	On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. Ariel Kulik, Hadas Shachnai, Gal Tamir
2021	—	`—`	Submodular Maximization with Assignment Constraints and Parameterized Approximations. Ariel Kulik
2020	A	`conf`	A (1-e ESA Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
2020	J	`jnl`	A (1-e CoRR Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
2020	A*	`conf`	Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS Ariel Kulik, Hadas Shachnai
2020	—	`conf`	Cooperative Rule Caching for SDN Switches. CloudNet Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel S. Menasché
2020	J	`jnl`	tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR Yaron Fairstein, Ariel Kulik, Hadas Shachnai
2019	J	`jnl`	Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR Ariel Kulik, Hadas Shachnai
2019	A	`conf`	Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2015	J	`jnl`	On Lagrangian Relaxation and Reoptimization Problems. CoRR Ariel Kulik, Hadas Shachnai, Gal Tamir
2013	J	`jnl`	Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. Ariel Kulik, Hadas Shachnai, Tami Tamir
2012	—	`conf`	Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2011	J	`jnl`	Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh
2011	J	`jnl`	Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints CoRR Ariel Kulik, Hadas Shachnai, Tami Tamir
2010	J	`jnl`	There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. Ariel Kulik, Hadas Shachnai
2009	A*	`conf`	Maximizing submodular set functions subject to multiple linear constraints. SODA Ariel Kulik, Hadas Shachnai, Tami Tamir
2008	B	`conf`	On Lagrangian Relaxation and Subset Selection Problems. WAOA Ariel Kulik, Hadas Shachnai