יורי רבינוביץ - הפקולטה למדעי המחשב והמידע

פרסומים▼

Online embedding of metrics, Newman, I. & Rabinovich, Y., Jun 2025, In: Israel Journal of Mathematics. 267, 2, p. 967-993 27 p.
Large simple d-cycles in simplicial complexes, Meshulam, R., Newman, I. & Rabinovich, Y., Sep 2023, In: Israel Journal of Mathematics. 256, 2, p. 581-597 17 p.
A generalization of the Blind Rotating Table game, Rabinovich, Y., Jun 2022, In: Information Processing Letters. 176, 106233.
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes, Mathew, R., Newman, I., Rabinovich, Y. & Rajendraprasad, D., Sep 2021, In: Journal of Combinatorial Theory. Series B. 150, p. 119-143 25 p.
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).
Large Simple d-Cycles in Simplicial Complexes, Meshulam, R., Newman, I. & Rabinovich, Y., 10 Oct 2019.
On connectivity of the facet graphs of simplicial complexes, Newman, I. I. & Rabinovich, Y., 1 Oct 2019, In: Israel Journal of Mathematics. 234, 2, p. 521-545 25 p.
Testing for forbidden order patterns in an array, Newman, I., Rabinovich, Y., Rajendraprasad, D. & Sohler, C., Sep 2019, In: Random Structures and Algorithms. 55, 2, p. 402-426 25 p.
Extremal hypercuts and shadows of simplicial complexes, Linial, N., Newman, I., Peled, Y. & Rabinovich, Y., 1 Jan 2019, In: Israel Journal of Mathematics. 229, 1, p. 133-163 31 p.
Approximation algorithms for low-distortion embeddings into low-dimensional spaces, Sidiropoulos, A., Badoiu, M., Dhamdhere, K., Gupta, A., Indyk, P., Rabinovich, Y., Racke, H. & Ravi, R., 2019, In: SIAM Journal on Discrete Mathematics. 33, 1, p. 454-473 20 p.
Rational polygons: Odd compression ratio and odd plane coverings, Pinchasi, R. & Rabinovich, Y., 1 Jan 2017, A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. Springer International Publishing, p. 693-710 18 p.
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).
On multiplicative λ-approximations and some geometric applications, Newman, I. & Rabinovich, Y., 2013, In: SIAM Journal on Computing. 42, 3, p. 855-883 29 p.
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).
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs, Chepoi, V., Dragan, F. F., Newman, I., Rabinovich, Y. & Vaxès, Y., Jan 2012, In: Discrete and Computational Geometry. 47, 1, p. 187-214 28 p.
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).
Local versus global properties of metric spaces, Arora, S., Lovász, L., Newman, I., Rabani, Y., Rabinovich, Y. & Vempala, S., 2012, In: SIAM Journal on Computing. 41, 1, p. 250-271 22 p.
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).
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).
Hard Metrics from Cayley Graphs of Abelian Groups, Newman, I. & Rabinovich, Y., 3 Jul 2009, In: Theory of Computing. 5, p. 125-134 10 p., 6.
On average distortion of embedding metrics into the line, Rabinovich, Y., Jun 2008, In: Discrete and Computational Geometry. 39, 4, p. 720-733 14 p.
On complexity of the subpattern problem, Ahal, S. & Rabinovich, Y., Mar 2008, In: SIAM Journal on Discrete Mathematics. 22, 2, p. 629-649 21 p.
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).
Embedding k-outerplanar graphs into l1, Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y. & Sinclair, A., 2006, In: SIAM Journal on Discrete Mathematics. 20, 1, p. 119-136 18 p.
Local versus Global Properties of Metric Spaces Extended abstract, Arora, S., Lovászt, L., Newman, I., Rabani, Y., Rabinovich, Y. & Vempala, S., 2006, p. 41-50. 10 p.
Approximation algorithms for low-distortion embeddings into low-dimensional spaces, Bǎdoiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., Räcke, H., Ravi, R. & Sidiropoulos, A., 2005, p. 119-128. 10 p.
Cuts, trees and l1-embeddings of graphs, Gupta, A., Newman, I., Rabinovich, Y. & Sinclair, A., 2004, In: Combinatorica. 24, 2, p. 233-269 37 p.
Deterministic Approximation of the Cover Time, Feige, U. & Rabinovich, Y., Aug 2003, In: Random Structures and Algorithms. 23, 1, p. 1-22 22 p.
On average distortion of embedding metrics into the line and into L1, Rabinovich, Y., 2003, In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 456-462 7 p.
Embedding k-outerplanar graphs into ℓ1, Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y. & Sinclair, A., 2003, p. 527-536. 10 p.
A lower bound on the distortion of embedding planar metrics into euclidean space, Newman, I. & Rabinovich, Y., Jan 2003, In: Discrete and Computational Geometry. 29, 1, p. 77-81 5 p.
A lower bound on the distortion of embedding planar metrics into Euclidean space, Newman, I. & Rabinovich, Y., 2002, p. 94-96. 3 p.
On dominated l1 metrics, Matoušek, J. & Rabinovich, Y., 2001, In: Israel Journal of Mathematics. 123, p. 285-301 17 p.
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).
Techniques for bounding the convergence rate of genetic algorithms, Rabinovich, Y. & Wigderson, A., Mar 1999, In: Random Structures and Algorithms. 14, 2, p. 111-138 28 p.
Intersection properties of families of convex (n, d)-bodies, Kaiser, T. & Rabinovich, Y., Mar 1999, In: Discrete and Computational Geometry. 21, 2, p. 275-287 13 p.
A note on the influence of an ∈-biased random source, Ben-Dor, A., Karlin, A., Linial, N. & Rabinovich, Y., Feb 1999, In: Journal of Computer and System Sciences. 58, 1, p. 174-176 3 p.
Cuts, trees and ℓ-embeddings of graphs (preliminary version), Gupta, A., Newman, I., Rabinovich, Y. & Sinclair, A., 1999, In: Annual Symposium on Foundations of Computer Science - Proceedings. p. 399-408 10 p.
Optimal Bounds on Tail Probabilities: A Study of an Approach, Cohen, A., Rabinovich, Y., Schuster, A. & Shachnai, H., 1999, Advances in Randomized Parallel Computing. Pardalos, P. M. & Rajasekaran, S. (eds.). 1 ed. Boston, MA: Springer US, p. 1-24 24 p. (Combinatorial Optimization; vol. 5).
A computational view of population genetics, Rabani, Y., Rabinovich, Y. & Sinclair, A., Jul 1998, In: Random Structures and Algorithms. 12, 4, p. 313-334 22 p.
Optimal bounds on tail probabilities: A simplified approach, Cohen, A., Rabinovich, Y., Schuster, A., Shachnai, H. & Rolim, J. (Editor), 1998, Workshop on Randomized Parallel Computing Panos Pardalos, University of Florisa, Gainesvill Sanguthevar Rajasekaran, University of Florida, Gainesville. Rolim, J. (ed.). Florida: Springer Berlin Heidelberg, p. 341-350 10 p. (0302-9743).
Lower bounds on the distortion of embedding finite metric spaces in graphs, Rabinovich, Y. & Raz, R., Jan 1998, In: Discrete and Computational Geometry. 19, 1, p. 79-94 16 p.
Deterministic Approximation of the Cover Time, Feige, U. & Rabinovich, Y., 12 Jun 1996, Fourth Israel Symposium on Theory of Computing and Systems, ISTCS 1996. Jerusalem, Israel, p. 208-218 11 p.
Witness sets for families of binary vectors, Kushilevitz, E., Linial, N., Rabinovich, Y. & Saks, M., 1996, In: Journal of Combinatorial Theory. Series A. 73, 2, p. 376-380 5 p.
The geometry of graphs and some of its algorithmic applications, Linial, N., London, E. & Rabinovich, Y., Jun 1995, In: Combinatorica. 15, 2, p. 215-245 31 p.
A computational view of population genetics, Rabani, Y., Rabinovich, Y. & Sinclair, A., 29 May 1995, Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC '95. New York, NY, USA: Association for Computing Machinery, p. 83–92 10 p.
Local and global clique numbers, Linial, N. & Rabinovich, Y., May 1994, In: Journal of Combinatorial Theory. Series B. 61, 1, p. 5-15 11 p.
The geometry of graphs and some of its algorithmic applications, Linial, N., London, E. & Rabinovich, Y., 1994, In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 577-591 15 p.
Sphere Packing and Local Majorities in Graphs, Linial, N., Peleg, D., Rabinovich, Y. & Saks, M. E., 9 Jun 1993, Second Israel Symposium on Theory of Computing Systems, ISTCS 1993. Natanya, Israel, p. 141-149 9 p.
An Analysis of a Simple Genetic Algorithm, Rabinovich, Y. & Wigderson, A., Jul 1991, Proceedings of the 4th International Conference on Genetic Algorithms (ICGA 1991). San Diego, CA, USA, p. 215-221 7 p.

תחומי מחקר▼

אלגוריתמים
מתמטיקה דיסקרטית
סיבוכיות חישובים

הפקולטה למדעי המחשב והמידע

אוניברסיטת חיפה

פרופ' יורי רבינוביץ

פרסומים▼

תחומי מחקר▼