No photo of Asaf Levin

View Scopus Profile

Asaf Levin

Prof.

Former affiliation
 https://orcid.org/0000-0001-7935-6218
    20012025

    Research activity per year

    Filter
    Article

    Search results

    • 2024

      EPTAS for parallel identical machine scheduling with time restrictions

      Jaykrishnan, G. & Levin, A., Mar 2024, In: Journal of Combinatorial Optimization. 47, 2, 10.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Scheduling with cardinality dependent unavailability periods

      Jaykrishnan, G. & Levin, A., 16 Jul 2024, In: European Journal of Operational Research. 316, 2, p. 443-458 16 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Selecting intervals to optimize the design of observational studies subject to fine balance constraints

      Levin, A., Apr 2024, In: Journal of Combinatorial Optimization. 47, 3, 33.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • The Near Exact Bin Covering Problem

      Levin, A., Jun 2024, In: Algorithmica. 86, 6, p. 2041-2066 26 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2023

      Algorithms and Complexities of Matching Variants in Covariate Balancing

      Hochbaum, D. S., Levin, A. & Rao, X., 1 Sep 2023, In: Operations Research. 71, 5, p. 1800-1814 15 p.

      Research output: Contribution to journal › Article › peer-review

    • EPTAS for load balancing problem on parallel machines with a non-renewable resource

      Jaykrishnan, G. & Levin, A., May 2023, In: Discrete Optimization. 48, 100775.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • EPTAS for the dual of splittable bin packing with cardinality constraint

      Jaykrishnan, G. & Levin, A., 10 Nov 2023, In: Theoretical Computer Science. 979, 114202.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • High-multiplicity N-fold IP via configuration LP

      Knop, D., Koutecký, M., Levin, A., Mnich, M. & Onn, S., Jun 2023, In: Mathematical Programming. 200, 1, p. 199-227 29 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Online bin covering with limited migration

      Berndt, S., Epstein, L., Jansen, K., Levin, A., Maack, M. & Rohwedder, L., Jun 2023, In: Journal of Computer and System Sciences. 134, p. 42-72 31 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Online cardinality constrained scheduling

      Epstein, L., Lassota, A., Levin, A., Maack, M. & Rohwedder, L., Sep 2023, In: Operations Research Letters. 51, 5, p. 533-539 7 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Online Minimization of the Maximum Starting Time: Migration Helps

      Levin, A., Aug 2023, In: Algorithmica. 85, 8, p. 2238-2259 22 p.

      Research output: Contribution to journal › Article › peer-review

    • Reducibility bounds of objective functions over the integers

      Eisenbrand, F., Hunkenschröder, C., Klein, K. M., Koutecký, M., Levin, A. & Onn, S., Nov 2023, In: Operations Research Letters. 51, 6, p. 595-598 4 p.

      Research output: Contribution to journal › Article › peer-review

    • Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times

      Levin, A. & Shusterman, T., Jun 2023, In: Acta Informatica. 60, 2, p. 101-122 22 p.

      Research output: Contribution to journal › Article › peer-review

    • 2022

      Approximate separable multichoice optimization over monotone systems

      Koutecký, M., Levin, A., Meesum, S. M. & Onn, S., May 2022, In: Discrete Optimization. 44, 100629.

      Research output: Contribution to journal › Article › peer-review

    • Comparing the costs of Any Fit algorithms for bin packing

      Levin, A., Nov 2022, In: Operations Research Letters. 50, 6, p. 646-649 4 p.

      Research output: Contribution to journal › Article › peer-review

    • 2021

      A New Lower Bound for Classic Online Bin Packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., Jul 2021, In: Algorithmica. 83, 7, p. 2047-2062 16 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Complexity, algorithms and applications of the integer network flow with fractional supplies problem

      Hochbaum, D. S., Levin, A. & Rao, X., Jul 2021, In: Operations Research Letters. 49, 4, p. 559-564 6 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Parameterized complexity of configuration integer programs

      Knop, D., Koutecký, M., Levin, A., Mnich, M. & Onn, S., Nov 2021, In: Operations Research Letters. 49, 6, p. 908-913 6 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2020

      A note on a variant of the online open end bin packing problem

      Epstein, L. & Levin, A., Nov 2020, In: Operations Research Letters. 48, 6, p. 844-849 6 p.

      Research output: Contribution to journal › Article › peer-review

    • Online bin packing with cardinality constraints resolved

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., Sep 2020, In: Journal of Computer and System Sciences. 112, p. 34-49 16 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2019

      An Algorithmic Theory of Integer Programming

      Eisenbrand, F., Hunkenschröder, C., Klein, K.-M., Koutecký, M., Levin, A. & Onn, S., 2019, In: CoRR. abs/1904.01361

      Research output: Contribution to journal › Article › peer-review

    • A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines

      Kones, I. & Levin, A., 2019, In: Algorithmica. 81, 7, p. 3025-3046 22 p.

      Research output: Contribution to journal › Article › peer-review

    • Deadline TSP

      Farbstein, B. & Levin, A., 1 Jun 2019, In: Theoretical Computer Science. 771, p. 83-92 10 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Hypergraphic Degree Sequences are Hard

      Deza, A., Levin, A., Meesum, S. M. & Onn, S., 2019, In: Bull. EATCS. 127

      Research output: Contribution to journal › Article › peer-review

    • Lower bounds for online bin covering-type problems

      Balogh, J., Epstein, L. & Levin, A., 15 Aug 2019, In: Journal of Scheduling. 22, 4, p. 487-497 11 p.

      Research output: Contribution to journal › Article › peer-review

    • Lower Bounds for Several Online Variants of Bin Packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 1 Nov 2019, In: Theory of Computing Systems. 63, 8, p. 1757-1780 24 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Multitype Integer Monoid Optimization and Applications

      Knop, D., Koutecký, M., Levin, A., Mnich, M. & Onn, S., 2019, In: CoRR. abs/1909.07326

      Research output: Contribution to journal › Article › peer-review

    • On the performance guarantee of First Fit for sum coloring

      Epstein, L. & Levin, A., Feb 2019, In: Journal of Computer and System Sciences. 99, p. 91-105 15 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Robust algorithms for total completion time

      Epstein, L. & Levin, A., Aug 2019, In: Discrete Optimization. 33, p. 70-86 17 p.

      Research output: Contribution to journal › Article › peer-review

    • 2018

      Batch Coloring of Graphs

      Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 1 Nov 2018, In: Algorithmica. 80, 11, p. 3293-3315 23 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Discounted Reward TSP

      Farbstein, B. & Levin, A., 1 Feb 2018, In: Algorithmica. 80, 2, p. 472-495 24 p.

      Research output: Contribution to journal › Article › peer-review

    • Improved bounds for randomized preemptive online matching

      Epstein, L., Levin, A., Segev, D. & Weimann, O., Apr 2018, In: Information and Computation. 259, p. 31-40 10 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem

      Levin, A. & Vainer, A., 1 Apr 2018, In: Journal of Combinatorial Optimization. 35, 3, p. 794-813 20 p.

      Research output: Contribution to journal › Article › peer-review

    • Min-Sum Bin Packing

      Epstein, L., Johnson, D. S. & Levin, A., 1 Aug 2018, In: Journal of Combinatorial Optimization. 36, 2, p. 508-531 24 p.

      Research output: Contribution to journal › Article › peer-review

    • Online-bounded analysis

      Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 1 Aug 2018, In: Journal of Scheduling. 21, 4, p. 429-441 13 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Optimization over degree sequences

      Deza, A., Levin, A., Meesum, S. M. & Onn, S., 2018, In: SIAM Journal on Discrete Mathematics. 32, 3, p. 2067-2079 13 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • The benefit of preemption with respect to the ℓp norm

      Epstein, L. & Levin, A., Jul 2018, In: Operations Research Letters. 46, 4, p. 462-468 7 p.

      Research output: Contribution to journal › Article › peer-review

    • Weighted matching with pair restrictions

      Hochbaum, D. S. & Levin, A., 1 May 2018, In: Optimization Letters. 12, 3, p. 649-659 11 p.

      Research output: Contribution to journal › Article › peer-review

    • 2017

      An AFPTAS for variable sized bin packing with general activation costs

      Epstein, L. & Levin, A., 1 Mar 2017, In: Journal of Computer and System Sciences. 84, p. 79-96 18 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Approximate Shifted Combinatorial Optimization

      Koutecký, M., Levin, A., Meesum, S. M. & Onn, S., 2017, In: CoRR. abs/1706.02075

      Research output: Contribution to journal › Article › peer-review

    • Maximum coverage problem with group budget constraints

      Farbstein, B. & Levin, A., 1 Oct 2017, In: Journal of Combinatorial Optimization. 34, 3, p. 725-735 11 p.

      Research output: Contribution to journal › Article › peer-review

    • On nonlinear multi-covering problems

      Cohen, R., Gonen, M., Levin, A. & Onn, S., 1 Feb 2017, In: Journal of Combinatorial Optimization. 33, 2, p. 645-659 15 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Power of preemption for minimizing total completion time on uniform parallel machines

      Epstein, L., Levin, A., Soper, A. J. & Strusevich, V. A., 2017, In: SIAM Journal on Discrete Mathematics. 31, 1, p. 101-123 23 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2016

      A Unified Approach to Truthful Scheduling on Related Machines

      Epstein, L., Levin, A. & Van Stee, R., Feb 2016, In: Mathematics of Operations Research. 41, 1, p. 332-351 20 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Shifted matroid optimization

      Levin, A. & Onn, S., 1 Jul 2016, In: Operations Research Letters. 44, 4, p. 535-539 5 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

      Epstein, L. & Levin, A., 1 Nov 2016, In: Operations Research Letters. 44, 6, p. 772-774 3 p.

      Research output: Contribution to journal › Article › peer-review

    • Vertex Cover Meets Scheduling

      Epstein, L., Levin, A. & Woeginger, G. J., 1 Mar 2016, In: Algorithmica. 74, 3, p. 1148-1173 26 p.

      Research output: Contribution to journal › Article › peer-review

    • 2015

      Lexicographic Matroid Optimization

      Levin, A. & Onn, S., 2015, In: CoRR. abs/1507.00447

      Research output: Contribution to journal › Article › peer-review

    • Min-max cover of a graph with a small number of parts

      Farbstein, B. & Levin, A., May 2015, In: Discrete Optimization. 16, p. 51-61 11 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Offline black and white bin packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L., Kellerer, H., Levin, A. & Tuza, Z., 6 Sep 2015, In: Theoretical Computer Science. 596, p. 92-101 10 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access