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
    Conference contribution

    Search results

    • 2025

      Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines

      Epstein, L. & Levin, A., 24 Feb 2025, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. K. (eds.). 31. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 327).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2024

      Tight Lower Bounds for Block-Structured Integer Programs

      Hunkenschröder, C., Klein, K. M., Koutecký, M., Lassota, A. & Levin, A., 2024, Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Vygen, J. & Byrka, J. (eds.). p. 224-237 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14679 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2020

      A New Lower Bound for Classic Online Bin Packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 2020, Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Revised Selected Papers. Bampis, E. & Megow, N. (eds.). p. 18-28 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11926 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2019

      Online bin covering with limited migration

      Berndt, S., Epstein, L., Jansen, K., Levin, A., Maack, M. & Rohwedder, L., Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2018

      A new and improved algorithm for online bin packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • A parameterized strongly polynomial algorithm for block structured integer programs

      Koutecký, M., Levin, A. & Onn, S., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). 85. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • A unified framework for designing EPTAS’s for load balancing on parallel machines

      Kones, I. & Levin, A., 2018, Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings. Miller, R. G., Manea, F. & Nowotka, D. (eds.). p. 224-233 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10936 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Deadline TSP

      Farbstein, B. & Levin, A., 2018, Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Solis-Oba, R. & Fleischer, R. (eds.). p. 52-65 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10787 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Lower bounds for several online variants of bin packing

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 2018, Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Solis-Oba, R. & Fleischer, R. (eds.). p. 102-117 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10787 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2017

      Batch coloring of graphs

      Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 2017, Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Mastrolilli, M. & Jansen, K. (eds.). p. 52-64 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10138 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Online bin packing with cardinality constraints resolved

      Balogh, J., Békési, J., Dósa, G., Epstein, L. & Levin, A., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2016

      Online bounded analysis

      Boyar, J., Epstein, L., Favrholdt, L. M., Larsen, K. S. & Levin, A., 2016, Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings. Woeginger, G. J. & Kulikov, A. S. (eds.). p. 131-145 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9691).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2013

      A unified approach to truthful scheduling on related machines

      Epstein, L., Levin, A. & Van Stee, R., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. p. 1243-1252 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Improved bounds for online preemptive matching

      Epstein, L., Levin, A., Segev, D. & Weimann, O., 2013, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013. p. 389-399 11 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 20).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2012

      The (Weighted) metric dimension of graphs: Hard and easy cases

      Epstein, L., Levin, A. & Woeginger, G. J., 2012, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Revised Selcted Papers. p. 114-125 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7551 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2011

      On variants of file caching

      Epstein, L., Imreh, C., Levin, A. & Nagy-György, J., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 195-206 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Robust algorithms for preemptive scheduling

      Epstein, L. & Levin, A., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 567-578 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2010

      Finding mobile data under delay constraints with searching costs

      Bar-Noy, A., Cheilaris, P., Feng, Y. & Levin, A., 2010, PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. p. 297-304 8 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Improved approximation guarantees for weighted matching in the semi-streaming model

      Epstein, L., Levin, A., Mestre, J. & Segev, D., 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 347-358 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Max-min online allocations with a reordering buffer

      Epstein, L., Levin, A. & Van Stee, R., 2010, Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 ed. p. 336-347 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6198 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Online clustering with variable sized clusters

      Csirik, J., Epstein, L., Imreh, C. & Levin, A., 2010, Mathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Proceedings. p. 282-293 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6281 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Universal sequencing on a single machine

      Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M. & Stougie, L., 2010, Integer Programming and Combinatorial Optimization - 14th International Conference, IPCO 2010, Proceedings. p. 230-243 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6080 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2009

      On equilibria for ADM minimization games

      Epstein, L. & Levin, A., 2009, Algorithmic Game Theory - Second International Symposium, SAGT 2009, Proceedings. p. 347-358 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5814 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2008

      Covering the edges of bipartite graphs using K2,2 graphs

      Hochbaum, D. S. & Levin, A., 2008, Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. p. 116-127 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4927 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Improved randomized results for that interval selection problem

      Epstein, L. & Levin, A., 2008, Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. p. 381-392 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5193 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Minimum weighted sum bin packing

      Epstein, L. & Levin, A., 2008, Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. p. 218-231 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4927 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On the max coloring problem

      Epstein, L. & Levin, A., 2008, Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. p. 142-155 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4927 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2007

      Approximating the unweighted k-set cover problem: Greedy meets local search

      Levin, A., 2007, Approximation and Online Algorithms - 4th International Workshop, WAOA 2006, Revised Papers. p. 290-301 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4368 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Multi-dimensional packing with conflicts

      Epstein, L., Levin, A. & Van Stee, R., 2007, Fundamentals of Computation Theory - 16th International Symposium, FCT 2007, Proceedings. p. 288-299 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4639 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On bin packing with conflicts

      Epstein, L. & Levin, A., 2007, Approximation and Online Algorithms - 4th International Workshop, WAOA 2006, Revised Papers. p. 160-173 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4368 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Online capacitated interval coloring

      Epstein, L., Erlebach, T. & Levin, A., 2007, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies - First International Symposium, ESCAPE 2007, Revised Selected Papers. p. 243-254 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4614 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • The k-allocation problem and its variants

      Hochbaum, D. S. & Levin, A., 2007, Approximation and Online Algorithms - 4th International Workshop, WAOA 2006, Revised Papers. p. 253-264 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4368 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2006

      A robust APTAS for the classical bin packing problem

      Epstein, L. & Levin, A., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. p. 214-225 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Graph coloring with rejection

      Epstein, L., Levin, A. & Woeginger, G. J., 2006, Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. p. 364-375 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4168 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Partial multicuts in trees

      Levin, A. & Segev, D., 2006, Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers. p. 320-333 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3879 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • SONET ADMs minimization with divisible paths

      Epstein, L. & Levin, A., 2006, Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers. p. 119-132 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3879 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • The conference call search problem in wireless networks

      Epstein, L. & Levin, A., 2006, Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers. p. 133-146 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3879 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Variable sized online interval coloring with bandwidth

      Epstein, L., Erlebach, T. & Levin, A., 2006, Biomedical Simulation - Third International Symposium, ISBMS 2006, Proceedings. p. 29-40 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4059 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Weighted sum coloring in batch scheduling of conflicting jobs

      Epstein, L., Halldórsson, M. M., Levin, A. & Shachnai, H., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. p. 116-127 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2002

      Minimum restricted diameter spanning trees

      Hassin, R. & Levin, A., 2002, Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Proceedings. Jansen, K., Leonardi, S. & Vazirani, V. (eds.). p. 175-184 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2462).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2001

      Synthesis of 2-commodity flow networks

      Hassin, R. & Levin, A., 2001, Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. Aardal, K. & Gerards, B. (eds.). p. 226-235 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2081).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review