default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlan Doron-Arad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]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- [c10]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP 2024: 56:1-56:20 - [c9]Ilan Doron-Arad, Joseph (Seffi) Naor:
Non-Linear Paging. ICALP 2024: 57:1-57:19 - [c8]Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. IPEC 2024: 5:1-5:22 - [c7]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Covering and Packing Partially Ordered Items. WG 2024: 166-180 - [i16]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - [i15]Ilan Doron-Arad, Joseph Naor:
Non-Linear Paging. CoRR abs/2404.13334 (2024) - [i14]Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik:
Unsplittable Flow on a Short Path. CoRR abs/2407.10138 (2024) - [i13]Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi:
Fine Grained Lower Bounds for Multidimensional Knapsack. CoRR abs/2407.10146 (2024) - [i12]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
You (Almost) Can't Beat Brute Force for 3-Matroid Intersection. CoRR abs/2412.02217 (2024) - [i11]Ilan Doron-Arad:
On the Hardness of Training Deep Neural Networks Discretely. CoRR abs/2412.13057 (2024) - 2023
- [j1]Ilan Doron-Arad, Ariel Kulik
, Hadas Shachnai:
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51(6): 632-637 (2023) - [c6]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 - [c5]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 - [c4]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC 2023: 13:1-13:17 - [c3]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. SOSA 2023: 69-83 - [c2]Ilan Doron-Arad, Hadas Shachnai:
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. WG 2023: 261-275 - [i10]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR abs/2302.05681 (2023) - [i9]Ilan Doron-Arad, Hadas Shachnai:
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. CoRR abs/2302.10613 (2023) - [i8]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR abs/2304.13984 (2023) - [i7]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR abs/2307.04173 (2023) - [i6]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Tight Lower Bounds for Weighted Matroid Problems. CoRR abs/2307.07773 (2023) - [i5]Ilan Doron-Arad, Hadas Shachnai:
Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs. CoRR abs/2307.08592 (2023) - [i4]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR abs/2308.12622 (2023) - 2022
- [i3]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. CoRR abs/2209.04654 (2022) - [i2]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
- [c1]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS 2021: 286-299 - 2020
- [i1]Ilan Doron-Arad, Hadas Shachnai:
An APTAS for Bin Packing with Clique-graph Conflicts. CoRR abs/2011.04273 (2020)
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 2025-01-30 21:35 CET 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:
