Rom Pinchasi

Eyal Ackerman, Tsachik Gelander, Rom Pinchasi: Ice-creams and wedge graphs. Comput. Geom. 46(3): 213-218 (2013)

Eyal Ackerman, Rom Pinchasi: On the Degenerate Crossing Number. Discrete & Computational Geometry 49(3): 695-702 (2013)

Eyal Ackerman, Jacob Fox, Rom Pinchasi: A note on light geometric graphs. Discrete Mathematics 313(11): 1281-1283 (2013)

Eyal Ackerman, Rom Pinchasi: On coloring points with respect to rectangles. J. Comb. Theory, Ser. A 120(4): 811-815 (2013)

Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib: The number of distinct distances from a vertex of a convex polygon. JoCG 4(1): 1-12 (2013)

Eyal Ackerman, Rom Pinchasi: On the light side of geometric graphs. Discrete Mathematics 312(6): 1213-1217 (2012)

Igor Pak, Rom Pinchasi: Collapsing Walls Theorem. The American Mathematical Monthly 119(2): 156-160 (2012)

Eyal Ackerman, Rom Pinchasi: A note on coloring line arrangements. CoRR abs/1207.0080 (2012)

Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib: The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012)

Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster: On graphs and algebraic graphs that do not contain cycles of length 4. Journal of Graph Theory 68(2): 91-102 (2011)

Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv: Points with Large Quadrant Depth. JoCG 2(1): 128-143 (2011)

Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg: Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. The American Mathematical Monthly 118(2): 164-167 (2011)

Sascha Kurz, Rom Pinchasi: Regular Matchstick Graphs. The American Mathematical Monthly 118(3): 264-267 (2011)

Eyal Ackerman, Tsachik Gelander, Rom Pinchasi: Ice-Creams and Wedge Graphs. CoRR abs/1106.0855 (2011)

Itay Ben-Dan, Rom Pinchasi, Ran Ziv: On a problem about quadrant-depth. Comput. Geom. 43(6-7): 587-592 (2010)

Rom Pinchasi, Allan Pinkus: Dominating Subsets under Projections. SIAM J. Discrete Math. 24(3): 910-920 (2010)

Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow: Points with large quadrant-depth. Symposium on Computational Geometry 2010: 358-364

Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi: Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8

Itay Ben-Dan, Rom Pinchasi, Ran Ziv: Points with large alpha-depth. J. Comb. Theory, Ser. A 116(3): 747-755 (2009)

Rom Pinchasi: Halving lines and measure concentration in the plane. Symposium on Computational Geometry 2009: 141-147

Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg: On Inducing Polygons and Related Problems. ESA 2009: 47-58

Rom Pinchasi: Geometric graphs with no two parallel edges. Combinatorica 28(1): 127-130 (2008)

Ron Holzman, Vsevolod F. Lev, Rom Pinchasi: Projecting Difference Sets on the Positive Orthant. Combinatorics, Probability & Computing 17(5): 681-688 (2008)

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There Are Not Too Many Magic Configurations. Discrete & Computational Geometry 39(1-3): 3-16 (2008)

Noga Alon, Adi Pinchasi, Rom Pinchasi: An isoperimetric inequality in the universal cover of the punctured plane. Discrete Mathematics 308(23): 5691-5701 (2008)

Amitai Perlstein, Rom Pinchasi: Generalized Thrackles and Geometric Graphs in \mathbbR³{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges. Graphs and Combinatorics 24(4): 373-389 (2008)

Rom Pinchasi: The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. SIAM J. Discrete Math. 22(2): 828-831 (2008)

Sarit Buzaglo, Ron Holzman, Rom Pinchasi: On s-intersecting curves and related problems. Symposium on Computational Geometry 2008: 79-84

Hagit Last, Rom Pinchasi: At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. Discrete & Computational Geometry 38(2): 321-354 (2007)

János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discrete & Computational Geometry 38(2): 399-441 (2007)

Rom Pinchasi: Linear algebra approach to geometric graphs. J. Comb. Theory, Ser. A 114(8): 1363-1374 (2007)

Micha A. Perles, Rom Pinchasi: Forbidden k-Sets in the Plane. SIAM J. Discrete Math. 21(2): 385-395 (2007)

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There are not too many magic configurations. Symposium on Computational Geometry 2007: 142-149

Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3): 385-419 (2006)

Rom Pinchasi, Micha Sharir: On Graphs That Do Not Contain The Cube And Related Problems. Combinatorica 25(5): 615-623 (2005)

Daniel J. Kleitman, Rom Pinchasi: A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discrete & Computational Geometry 33(2): 223-229 (2005)

János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth: Topological Graphs with No Large Grids. Graphs and Combinatorics 21(3): 355-364 (2005)

Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir: Crossing patterns of semi-algebraic sets. J. Comb. Theory, Ser. A 111(2): 310-326 (2005)

János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth: Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. 25(6): 793-811 (2004)

Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004)

Shmuel Onn, Rom Pinchasi: A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory, Ser. A 107(1): 147-151 (2004)

János Pach, Rom Pinchasi, Micha Sharir: On the number of directions determined by a three-dimensional points set. J. Comb. Theory, Ser. A 108(1): 1-16 (2004)

János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's problem on the number of directions determined by a point set in 3-space. Symposium on Computational Geometry 2004: 76-85

Rom Pinchasi, Shakhar Smorodinsky: On locally Delaunay geometric graphs. Symposium on Computational Geometry 2004: 378-382

Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. Symposium on Computational Geometry 2004: 391-400

Rom Pinchasi: Lines With Many Points On Both Sides. Discrete & Computational Geometry 30(3): 415-435 (2003)

János Pach, Rom Pinchasi: How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? The American Mathematical Monthly 110(5): 400-406 (2003)

Rom Pinchasi, Rados Radoicic: Topological graphs with no self-intersecting cycle of lenth 4. Symposium on Computational Geometry 2003: 98-103

János Pach, Rom Pinchasi, Micha Sharir: A tight bound for the number of different directions in three dimensions. Symposium on Computational Geometry 2003: 106-113

Rom Pinchasi: Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. Discrete & Computational Geometry 28(4): 607-624 (2002)

Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. Symposium on Computational Geometry 2002: 123-132

János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth: Geometric Graphs with No Self-intersecting Path of Length Three. Graph Drawing 2002: 295-311

Rom Pinchasi: On the Size of a Radial Set. JCDCG 2002: 233-245

János Pach, Rom Pinchasi: On the Number of Balanced Lines. Discrete & Computational Geometry 25(4): 611-628 (2001)

Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir: On the Complexity of Arrangements of Circles in the Plane. Discrete & Computational Geometry 26(4): 465-492 (2001)

János Pach, Rom Pinchasi: Bichromatic Lines with Few Points. J. Comb. Theory, Ser. A 90(2): 326-335 (2000)