Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2024
- 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) - 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 - 2023
- Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51(6): 632-637 (2023) - 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 - Ariel Kulik, Matthias Mnich, Hadas Shachnai:
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS 2023: 1366-1376 - 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 - Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC 2023: 20:1-20:17 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC 2023: 13:1-13:17 - 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 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. SOSA 2023: 69-83 - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR abs/2302.05681 (2023) - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR abs/2304.13984 (2023) - 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) - Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR abs/2307.02137 (2023) - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR abs/2307.04173 (2023) - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
Tight Lower Bounds for Weighted Matroid Problems. CoRR abs/2307.07773 (2023) - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR abs/2308.12622 (2023) - 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
- 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) - 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) - 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 - 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 - Ariel Kulik, Matthias Mnich, Hadas Shachnai:
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR abs/2205.12828 (2022) - 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) - Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. CoRR abs/2209.01623 (2022) - Ilan Doron Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. CoRR abs/2209.04654 (2022) - 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
- Ariel Kulik:
Submodular Maximization with Assignment Constraints and Parameterized Approximations. Technion - Israel Institute of Technology, Israel, 2021 - Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296: 164-178 (2021) - Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A refined analysis of submodular Greedy. Oper. Res. Lett. 49(4): 507-514 (2021)
skipping 22 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-27 22:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint