Calculated based on number of publications stored in Pure and citations from Scopus
20032023

Research activity per year

Filter
Chapter

Search results

  • 2003

    On the complexity of approximating k-dimensional matching

    Hazan, E., Safra, S. & Schwartz, O., 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.). Springer Verlag, p. 83-97 15 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 proceedingChapterpeer-review

    40 Scopus citations
  • On the Complexity of Approximating TSP with Neighborhoods and Related Problems

    Safra, S. & Schwartz, O., 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). di Battista, G. & Zwick, U. (eds.). Springer Verlag, p. 446-458 13 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 proceedingChapterpeer-review

    15 Scopus citations
Your message has successfully been sent.
Your message was not sent due to an error.