Yuri Rabinovich

    1992 …2022

    Research activity per year

    If you made any changes in Pure these will be visible here soon.
    Filter
    Conference contribution

    Search results

    • 2020

      Online embedding of metrics

      Newman, I. & Rabinovich, Y., 1 Jun 2020, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020. Albers, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 32. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 162).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2017

      Testing for forbidden order patterns in an array

      Newman, I., Rabinovich, Y., Rajendraprasad, D. & Sohler, C., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1582-1597 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • 2013

      Upper bounds on boolean-width with applications to exact algorithms

      Rabinovich, Y., Telle, J. A. & Vatshelle, M., 2013, Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Revised Selected Papers. p. 308-320 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8246 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2012

      On multiplicative λ-approximations and some geometric applications

      Newman, I. & Rabinovich, Y., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 51-67 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

      Open Access
    • 2010

      Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs

      Chepoi, V., Dragan, F. F., Newman, I., Rabinovich, Y. & Vaxès, Y., 2010, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. p. 95-109 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6302 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • On the boolean-width of a graph: Structure and applications

      Adler, I., Bui-Xuan, B. M., Rabinovich, Y., Renault, G., Telle, J. A. & Vatshelle, M., 2010, Graph-Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Revised Papers. p. 159-170 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6410 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2007

      Hard metrics from Cayley graphs of abelian groups

      Newman, I. & Rabinovich, Y., 2007, STACS 2007 - 24th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag, p. 157-162 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4393 LNCS).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 2000

      On the complexity of the sub-permutation problem

      Ahal, S. & Rabinovich, Y., 2000, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Halldórsson, M. M. (ed.). Springer Verlag, p. 490-503 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1851).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 1998

      Optimal bounds on tail proabilities – A simplified approach

      Cohen, A., Rabinovich, Y., Schuster, A. & Shachnai, H., 1998, Parallel and Distributed Processing - 10 IPPS/SPDP 1998 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Proceedings. Rolim, J. (ed.). Springer Verlag, p. 341-350 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1388).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    • 1992

      Quadratic dynamical systems

      Rabinovich, Y., Sinclair, A. & Wigderson, A., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 304-313 10 p. 267761. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

      Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review