default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAriel Kulik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Baris Can Esmer
, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86(1): 334-366 (2024)- [c22]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. APPROX/RANDOM 2024: 27:1-27:17 - [c21]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP 2024: 56:1-56:20 - [c20]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA 2024: 314-345 - [i24]Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. CoRR abs/2407.10138 (2024) - [i23]Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi:
Fine Grained Lower Bounds for Multidimensional Knapsack. CoRR abs/2407.10146 (2024) - [i22]Baris Can Esmer, Ariel Kulik:
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. CoRR abs/2407.12654 (2024) - 2023
- [j9]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51(6): 632-637 (2023) - [c19]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM 2023: 22:1-22:16 - [c18]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS 2023: 1366-1376 - [c17]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP 2023: 49:1-49:16 - [c16]Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC 2023: 20:1-20:17 - [c15]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC 2023: 13:1-13:17 - [c14]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. IPEC 2023: 17:1-17:23 - [c13]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. SOSA 2023: 69-83 - [i21]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR abs/2302.05681 (2023) - [i20]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR abs/2304.13984 (2023) - [i19]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR abs/2306.15331 (2023) - [i18]Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR abs/2307.02137 (2023) - [i17]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR abs/2307.04173 (2023) - [i16]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Tight Lower Bounds for Weighted Matroid Problems. CoRR abs/2307.07773 (2023) - [i15]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR abs/2308.12622 (2023) - [i14]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. CoRR abs/2308.15306 (2023) - 2022
- [j8]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125: 149-165 (2022) - [j7]Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel Sadoc Menasché:
Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. 19(3): 2092-2106 (2022) - [c12]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19 - [c11]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. IPEC 2022: 12:1-12:22 - [i13]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR abs/2205.12828 (2022) - [i12]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR abs/2206.13481 (2022) - [i11]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. CoRR abs/2209.01623 (2022) - [i10]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. CoRR abs/2209.04654 (2022) - [i9]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR abs/2212.01025 (2022) - 2021
- [b1]Ariel Kulik:
Submodular Maximization with Assignment Constraints and Parameterized Approximations. Technion - Israel Institute of Technology, Israel, 2021 - [j6]Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296: 164-178 (2021) - [j5]Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A refined analysis of submodular Greedy. Oper. Res. Lett. 49(4): 507-514 (2021) - [c10]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM 2021: 15:1-15:18 - [c9]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA 2021: 41:1-41:16 - [c8]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS 2021: 286-299 - [i8]Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2102.12879 (2021) - [i7]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. CoRR abs/2105.00882 (2021) - 2020
- [c7]Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel S. Menasché:
Cooperative Rule Caching for SDN Switches. CloudNet 2020: 1-7 - [c6]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [c5]Ariel Kulik, Hadas Shachnai:
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS 2020: 762-773 - [i6]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i5]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR abs/2007.10470 (2020)
2010 – 2019
- 2019
- [c4]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - [i4]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - [i3]Ariel Kulik, Hadas Shachnai:
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR abs/1911.02653 (2019) - 2018
- [j4]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - 2015
- [i2]Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian Relaxation and Reoptimization Problems. CoRR abs/1512.06736 (2015) - 2013
- [j3]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38(4): 729-739 (2013) - 2012
- [c3]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362 - 2011
- [j2]Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh:
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. 412(52): 7087-7098 (2011) - [i1]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. CoRR abs/1101.2940 (2011) - 2010
- [j1]Ariel Kulik, Hadas Shachnai:
There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110(16): 707-710 (2010)
2000 – 2009
- 2009
- [c2]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Maximizing submodular set functions subject to multiple linear constraints. SODA 2009: 545-554 - 2008
- [c1]Ariel Kulik, Hadas Shachnai:
On Lagrangian Relaxation and Subset Selection Problems. WAOA 2008: 160-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
