Ariel Kulik

Orcid: 0000-0002-0533-3926

According to our database1, Ariel Kulik authored at least 42 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing Generalized Convolutions Faster Than Brute Force.
Algorithmica, January, 2024

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.
CoRR, 2024

Fine Grained Lower Bounds for Multidimensional Knapsack.
CoRR, 2024

Unsplittable Flow on a Short Path.
CoRR, 2024

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Lower Bounds for Matroid Optimization Problems with a Linear Constraint.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding.
Proceedings of the Approximation, 2024

2023
An FPTAS for budgeted laminar matroid independent set.
Oper. Res. Lett., November, 2023

Tight Lower Bounds for Weighted Matroid Problems.
CoRR, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection.
CoRR, 2023

An EPTAS for Budgeted Matroid Independent Set.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Approximate Monotone Local Search for Weighted Problems.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Budgeted Matroid Maximization: a Parameterized Viewpoint.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Improved Approximation for Two-Dimensional Vector Multiple Knapsack.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding.
Proceedings of the Approximation, 2023

2022
Data Plane Cooperative Caching With Dependencies.
IEEE Trans. Netw. Serv. Manag., 2022

An almost optimal approximation algorithm for monotone submodular multiple knapsack.
J. Comput. Syst. Sci., 2022

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

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem.
CoRR, 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Submodular Maximization with Assignment Constraints and Parameterized Approximations.
PhD thesis, 2021

A refined analysis of submodular Greedy.
Oper. Res. Lett., 2021

On Lagrangian relaxation for constrained maximization and reoptimization problems.
Discret. Appl. Math., 2021

A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.
CoRR, 2021

An APTAS for Bin Packing with Clique-Graph Conflicts.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

General Knapsack Problems in a Dynamic Setting.
Proceedings of the Approximation, 2021

2020
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints.
CoRR, 2020

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A (1-e<sup>-1</sup>-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Cooperative Rule Caching for SDN Switches.
Proceedings of the 9th IEEE International Conference on Cloud Networking, 2020

2019
Generalized Assignment via Submodular Optimization with Reserved Capacity.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Parameterized approximation via fidelity preserving transformations.
J. Comput. Syst. Sci., 2018

2015
On Lagrangian Relaxation and Reoptimization Problems.
CoRR, 2015

2013
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.
Math. Oper. Res., 2013

2011
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints.
Theor. Comput. Sci., 2011

Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
CoRR, 2011

2010
There is no EPTAS for two-dimensional knapsack.
Inf. Process. Lett., 2010

2009
Maximizing submodular set functions subject to multiple linear constraints.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
On Lagrangian Relaxation and Subset Selection Problems.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008


  Loading...