Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ariel Kulik
Observed names:
Ariel Kulik (17432625),
Kulik, Ariel
Institution:
Ben-Gurion University of the Negev
Observed institutions:
Ben-Gurion University of the Negev,
Technion – Israel Institute of Technology,
Helmholtz Center for Information Security
ORCID:
0000-0002-0533-3926
Observed ORCID:
0000-0002-0533-3926
OpenAlex ID:
A5001714646
Maximizing Submodular Set Functions Subject to Multiple Linear Constraints
2009
·
Ariel Kulik
, Hadas Shachnai
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
149
Maximizing submodular set functions subject to multiple linear constraints
2009
·
Ariel Kulik
, Hadas Shachnai
, et al.
·
Symposium on Discrete Algorithms
·
142
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
2013
·
Ariel Kulik
, Hadas Shachnai
, et al.
·
Mathematics of Operations Research
·
122
PDF
There is no EPTAS for two-dimensional knapsack
2010
·
Ariel Kulik
, Hadas Shachnai
·
Information Processing Letters
·
89
Parameterized approximation via fidelity preserving transformations
2017
·
Michael R. Fellows
, Ariel Kulik
, et al.
·
Journal of Computer and System Sciences
·
63
PDF
Parameterized Approximation via Fidelity Preserving Transformations
2012
·
Michael R. Fellows
, Ariel Kulik
, et al.
·
Lecture notes in computer science
·
24
A refined analysis of submodular Greedy
2021
·
Ariel Kulik
, Roy Schwartz
, et al.
·
Operations Research Letters
·
22
PDF
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
2023
·
Ariel Kulik
, Matthias Mnich
, et al.
·
Annual Symposium on Foundations of Computer Science
·
16
PDF
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
2020
·
Ariel Kulik
, Hadas Shachnai
·
Annual Symposium on Foundations of Computer Science
·
15
PDF
An EPTAS for Budgeted Matroid Independent Set
2023
·
Ilan Doron-Arad
, Ariel Kulik
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
14
An FPTAS for budgeted laminar matroid independent set
2023
·
Ilan Doron-Arad
, Ariel Kulik
, et al.
·
Operations Research Letters
·
13
PDF
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations
2024
·
Barış Can Esmer
, Ariel Kulik
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
12
PDF
Fine Grained Lower Bounds for Multidimensional Knapsack
2024
·
Doron-Arad, Ilan
, Kulik, Ariel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
11
Cooperative Rule Caching for SDN Switches
2020
·
Ori Rottenstreich
, Ariel Kulik
, et al.
·
IEEE International Conference on Cloud Networking
·
10
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
2020
·
Fairstein, Yaron
, Kulik, Ariel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
A Poisson Process for Submodular Maximization
2026
·
Amit Ganz Rozenman
, Ariel Kulik
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
7
Lower Bounds for Weighted Matroid Problems
2025
·
Ilan Doron-Arad
, Ariel Kulik
, et al.
·
ACM Transactions on Algorithms
·
7
PDF
A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
2020
·
Fairstein, Yaron
, Kulik, Ariel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
On Lagrangian Relaxation and Subset Selection Problems
2009
·
Ariel Kulik
, Hadas Shachnai
·
Lecture notes in computer science
·
7
Data Plane Cooperative Caching With Dependencies
2021
·
Ori Rottenstreich
, Ariel Kulik
, et al.
·
IEEE Transactions on Network and Service Management
·
6
Generalized Assignment via Submodular Optimization with Reserved Capacity
2019
·
Kulik, Ariel
, Sarpatwar, Kanthi
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
2024
·
Can Esmer, Barış
, Kulik, Ariel
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets
2022
·
Doron-Arad, Ilan
, Kulik, Ariel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
An APTAS for Bin Packing with Clique-Graph Conflicts
2021
·
Ilan Doron-Arad
, Ariel Kulik
, et al.
·
Lecture notes in computer science
·
5
PDF
Approximate Monotone Local Search for Weighted Problems
2023
·
Esmer, Barış Can
, Kulik, Ariel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Show more works
View as search
Works count:
58
Citation count:
828
H-index:
12
I10-index:
14
Year
Topic
Type