


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
Exact matches
- Asaf Levin
Technion, Faculty of Industrial Engineering and Management, Haifa, Israel
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 226 matches
- 2024
- Asaf Levin
:
The Near Exact Bin Covering Problem. Algorithmica 86(6): 2041-2066 (2024) - G. Jaykrishnan
, Asaf Levin
:
Scheduling with cardinality dependent unavailability periods. Eur. J. Oper. Res. 316(2): 443-458 (2024) - G. Jaykrishnan, Asaf Levin
:
EPTAS for parallel identical machine scheduling with time restrictions. J. Comb. Optim. 47(2): 10 (2024) - Asaf Levin
:
Selecting intervals to optimize the design of observational studies subject to fine balance constraints. J. Comb. Optim. 47(3): 33 (2024) - Christoph Hunkenschröder
, Kim-Manuel Klein
, Martin Koutecký
, Alexandra Lassota
, Asaf Levin
:
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - G. Jaykrishnan, Asaf Levin:
APTAS for bin packing with general cost structures. CoRR abs/2407.07677 (2024) - Leah Epstein, Asaf Levin:
Efficient approximation schemes for scheduling on a stochastic number of machines. CoRR abs/2409.10155 (2024) - 2023
- Asaf Levin
, Tal Shusterman:
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times. Acta Informatica 60(2): 101-122 (2023) - Asaf Levin
:
Online Minimization of the Maximum Starting Time: Migration Helps. Algorithmica 85(8): 2238-2259 (2023) - G. Jaykrishnan
, Asaf Levin
:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48(Part 1): 100775 (2023) - Dorit S. Hochbaum, Asaf Levin, Xu Rao:
Algorithms and Complexities of Matching Variants in Covariate Balancing. Oper. Res. 71(5): 1800-1814 (2023) - Sebastian Berndt, Leah Epstein
, Klaus Jansen, Asaf Levin
, Marten Maack, Lars Rohwedder
:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - Dusan Knop, Martin Koutecký
, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - Friedrich Eisenbrand
, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin
, Shmuel Onn
:
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - Leah Epstein
, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - G. Jaykrishnan, Asaf Levin
:
EPTAS for the dual of splittable bin packing with cardinality constraint. Theor. Comput. Sci. 979: 114202 (2023) - G. Jaykrishnan, Asaf Levin:
Scheduling with cardinality dependent unavailability periods. CoRR abs/2306.10904 (2023) - 2022
- Asaf Levin
:
Approximation Schemes for the Generalized Extensible Bin Packing Problem. Algorithmica 84(2): 325-343 (2022) - Leah Epstein
, Asaf Levin
:
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307: 79-87 (2022) - Martin Koutecký
, Asaf Levin
, Syed Mohammad Meesum, Shmuel Onn
:
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44(Part): 100629 (2022) - Asaf Levin
:
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf. Process. Lett. 174: 106211 (2022) - János Balogh, József Békési
, György Dósa, Leah Epstein
, Asaf Levin
:
Lower bounds for batched bin packing. J. Comb. Optim. 43(3): 613-629 (2022) - Asaf Levin
:
Comparing the costs of Any Fit algorithms for bin packing. Oper. Res. Lett. 50(6): 646-649 (2022) - Leah Epstein, Alexandra Lassota
, Asaf Levin
, Marten Maack, Lars Rohwedder
:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - Asaf Levin:
The near exact bin covering problem. CoRR abs/2202.10904 (2022) - G. Jaykrishnan, Asaf Levin:
EPTAS for the dual of splittable bin packing with cardinality constraint. CoRR abs/2204.04685 (2022) - 2021
- János Balogh, József Békési
, György Dósa, Leah Epstein
, Asaf Levin
:
A New Lower Bound for Classic Online Bin Packing. Algorithmica 83(7): 2047-2062 (2021) - Dorit S. Hochbaum
, Asaf Levin
, Xu Rao
:
Complexity, algorithms and applications of the integer network flow with fractional supplies problem. Oper. Res. Lett. 49(4): 559-564 (2021)
skipping 196 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 2025-02-14 22:23 CET 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