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
    Chapter

    Search results

    • 2004

      Approximation algorithms for quickest spanning tree problems

      Hassin, R. & Levin, A., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Albers, S. & Radzik, T. (eds.). p. 395-402 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3221).

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

    • The constrained minimum weighted sum of job completion times problem

      Levin, A. & Woeginger, G. J., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Bienstock, D. & Nemhauser, G. (eds.). p. 298-307 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3064).

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

      Open Access
    • 2003

      Approximating the degree-bounded minimum diameter spanning tree problem

      Könemann, J., Levin, A. & Sinha, A., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Asora, S., Sahai, A., Jansen, K. & Rolim, J. D. P. (eds.). p. 109-121 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2764).

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

      Open Access

    • The complexity of graph contractions

      Levin, A., Paulusma, D. & Woeginger, G. J., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Bodlaender, H. L. (ed.). p. 322-333 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2880).

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

      Open Access

    • The minimum generalized vertex cover problem

      Hassin, R. & Levin, A., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). di Battista, G. & Zwick, U. (eds.). p. 289-300 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2832).

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