Rom Pinchasi

Photo by Andrey Kupavskii

Rom
Pinchasi

PhD
Research interests:

Combinatorics, Discrete Geometry, Computational Geometry, Topological Graphs

www2.math.technion.ac.il/~room/

Publications

Selected Papers:

  1. R. Pinchasi,
    Gallai-Sylvester Theorem for Pairwise Intersecting Unit Circles, Discrete and Computational Geometry, 28 (2002), 607--624.
  2. P. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky,
    Lenses in Arrangements of Pseudocircles and their Applications, J. ACM, {\bf 51}, (2004), 139--186. Also in ACM Symposium on Computational Geometry, June 2002, Universitat Politècnica de Catalunya, Barcelona, Spain. 123--132.
  3. J. Pach, R. Pinchasi, G. Tardos, G. Tóth,
    Geometric Graphs with no Self-Intersecting Path of Length Three, Graph Drawing 2002, Lecture Notes in Computer Science 2528, Springer-Verlag, Berlin, 2002, 295--311. Also in European J. Combinatorics , {\bf 25} (2004), no. 6, 793--811.
  4. N. Alon, H. Last, R. Pinchasi, and M. Sharir,
    On the Complexity of Arrangements of Circles in the Plane, Discrete and Computational Geometry, {\bf 26} (2001), 465-492.
  5. J. Pach and R. Pinchasi,
    On the Number of Balanced Lines, Discrete and Computational Geometry, {\bf 25} (2001), 611--628.
  6. J. Pach and R. Pinchasi,
    Bichromatic Lines With Few Points, J. Combinatorial Theory Ser. A, {\bf 90} (2000), 326--335.
  7. J. Pach and R. Pinchasi,
    Unit Equilateral Triangles Induced by Point Sets in Convex Position, American Mathematical Monthly, {\bf 110} (2003), 400--406.
  8. J. Pach, R. Pinchasi, and M. Sharir,
    A Tight Bound for the Number of Different Directions in Three Dimensions, in 19th ACM Symposium on Computational Geometry, San Diego, USA, 2003, pp 106--113. Also in J. Combinatorial Theory, ser. A. {\bf 108} (2004), 1--16.
  9. R. Pinchasi and R. Radovčić,
    On the Number of Edges in a Topological Graph with no Self-intersecting Cycle of Length $4$, appeared in 19th ACM Symposium on Computational Geometry, San Diego, USA, 2003, pp 98--103. Also to appear in Towards a Theory of Geometric Graphs , 233--243, Contemp. Math., 342, Amer. Math. Soc. Providence, RI, 2004.(J. Pach Ed.).
  10. R. Pinchasi,
    Lines With Many Points On Both Sides, Discrete and Computational Geometry, {\bf 30} (2003), 415--435.
  11. R. Pinchasi,
    On the Size of a Radial Set, Proc. Japan Conference on Discrete and Computational Geometry, Lecture Notes in Computer Science (LNCS, Springer-Verlag), 2003, 233--245.
  12. M.A. Perles and R. Pinchasi,
    Large Sets Must Have Either a $k$-Edge or a $(k+2)$-Edge, Towards a Theory of Geometric Graphs, 225--232, Contemp. Math., 342, Amer. Math. Soc. Providence, RI, 2004. (J. Pach Ed.).
  13. R. Pinchasi and M. Sharir,
    On Graphs that Do not Contains the Cube and Related Problems, Combinatorica, {\bf 25} (2005), no. 5, 615--623.
  14. J. Pach, R. Pinchasi, M. Sharir, and G. Tóth,
    Topological Graphs with no Large Grids, Graphs and Combinatorics, {\bf 21} (2005), no. 3, 355--364.
  15. D.J. Kleitman and R. Pinchasi,
    A Note on the Existence of a Directions Path, Disc. and Comp. Geom. , {\bf 33} (2005), no. 2, 223--229.
  16. S. Onn and R. Pinchasi,
    The Minimum Number of Edge-Directions of a Convex Polytope, J. Combinatorial Theory, ser. A. {\bf 107}, (2004), no. 1, 147--151.
  17. N. Alon, J. Pach, R. Pinchasi, R. Radovčić, M. Sharir
    Crossing Patterns of Semi-Algebraic Sets, J. Combinatorial Theory, ser. A. {\bf 111} (2005), no. 2, 310--326.
  18. R. Pinchasi and S. Smorodinsky,
    On The Delaunay Graph of a Geometric Graph, proc. 20th ACM Symp. on Computational Geometry, (2004). 378--382.
  19. R. Pinchasi, R. Radovčić, and M. Sharir,
    On Empty Convex Polygons in a Planar Point Set, J. Combinatorial Theory, ser. A., {\bf 113} (2006), no. 3, 385--419. Also in proc. 20th ACM Symp. on Computational Geometry, (2004). 391--400.
  20. M.A. Perles and R. Pinchasi,
  21. J. Pach and R. Pinchasi,
    A Long Non-Intersecting Path Among Disjoint Segments in the Plane, Combinatorial and computational geometry, 495--500, Math. Sci. Res. Inst. Publ., {\bf 52}, Cambridge Univ. Press, Cambridge, 2005.
  22. H. Last and R. Pinchasi,
  23. R. Pinchasi,
  24. J. Pach, R. Pinchasi, and M. Sharir,
  25. R. Pinchasi and G. Rote,
  26. N. Alon, A. Pinchasi, and R. Pinchasi,
  27. A. Perlstein and R. Pinchasi,
  28. N. Alon, T.H. Hall, C. Knauer, R. Pinchasi, R. Yuster
  29. R. Pinchasi,
  30. E. Ackerman, K. Buchin, C. Knauer, R. Pinchasi, and G. Rote,
  31. R. Holzman, S. Lev, and R. Pinchasi,
  32. R. Pinchasi,
  33. I. Ben-Dan, R. Pinchasi, and R. Ziv,
  34. R. Pinchasi,
  35. S. Buzaglo, R. Pinchasi, and G. Rote,
  36. S. Buzaglo, R. Holzman, and R. Pinchasi,
  37. I. Ben-Dan, R. Pinchasi, R. Ziv
  38. R. Apfelbaum, I. Ben-Dan, S. Felsner, T. Miltzow, R. Pinchasi, T. Ueckerdt, R. Ziv,
  39. S. Lev, M. Muzychuk, R. Pinchasi,
  40. I. Pak, R. Pinchasi,
    How to cut out a convex polyhedron, submitted. And a shorter version just of the main Lemma:
    I. Pak, R. Pinchasi
    Collapsing walls theorem, American Mathematical Monthly.
  41. R. Pinchasi,
  42. E. Ackerman, R. Pinchasi, L. Scharf, M. Scherfenberg,
    On inducing polygons and related problems, submitted. And a shorter paper with the shorter proof only:
    E. Ackerman, R. Pinchasi, L. Scharf, M. Scherfenberg,
  43. S. Kurz and R. Pinchasi,
    Regular Matchstick Graphs, American Mathematical Monthly.
  44. R. Pinchasi and A. Pinkus,
    Dominating Subsets under Projections, SIAM J. Discrete Math. 24 (2010), no. 3, 910--920.
  45. E. Ackerman, T. Gelander, R. Pinchasi,
  46. E. Ackerman, N. Nitzan, R. Pinchasi,
  47. E. Ackerman and R. Pinchasi,
  48. R. Pinchasi,
  49. E. Ackerman, J. Fox, R. Pinchasi,
  50. E. Ackerman, R. Pinchasi,
  51. R. Pinchasi,
  52. E. Ackerman, R. Pinchasi,
  53. E. Ackerman, J. Pach, R. Pinchasi, R. Radovčić, G. Tóth,
  54. E. Ackerman, R. Pinchasi,
  55. A. Ophir, R. Pinchasi,
  56. R. Pinchasi,
  57. R. Pinchasi,
  58. R. Pinchasi,
  59. G. Nivasch, J. Pach, R. Pinchasi, Sh. Zerbib,
  60. B. Aronov, M. Dulieu, R. Pinchasi, M. Sharir,
  61. A. Efrat, E. Ezra, R. Pinchasi, S. Sankararaman,
  62. E. Ackerman, N. Nitzan, R. Pinchasi,
  63. V. F. Lev, R. Pinchasi,
  64. S. Gilboa, R. Pinchasi,
  65. R. Pinchasi,
  66. R. Pinchasi,
  67. R. Pinchasi,
  68. R. Pinchasi, G. Wolansky,
  69. R. Pinchasi,
  70. A. Oren, I. Pak, R. Pinchasi,
  71. S. Moran, R. Pinchasi,
  72. R. Pinchasi, Y. Rabinovich,
  73. R. Pinchasi,
  74. R. Pinchasi and A. Polyanskii,
  75. R. Pinchasi,
  76. Ch. Keller and R. Pinchasi,

Unpublished manuscripts:

  1. D. J. Kleitman, R. Pinchasi,