Bichromatic Lines with Few Points. - János Pach; Rom Pinchasi (J. Comb. Theory A, 2000)

On the Complexity of Arrangements of Circles in the Plane. - Noga Alon; Hagit Last; Rom Pinchasi; Micha Sharir (Discret. Comput. Geom., 2001)

On the Number of Balanced Lines. - János Pach; Rom Pinchasi (Discret. Comput. Geom., 2001)

Lenses in arrangements of pseudo-circles and their applications. - Eran Nevo; János Pach; Rom Pinchasi; Micha Sharir; Shakhar Smorodinsky (SCG, 2002)

On the Size of a Radial Set. - Rom Pinchasi (JCDCG, 2002)

Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. - Rom Pinchasi (Discret. Comput. Geom., 2002)

A tight bound for the number of different directions in three dimensions. - János Pach; Rom Pinchasi; Micha Sharir (SCG, 2003)

Topological graphs with no self-intersecting cycle of lenth 4. - Rom Pinchasi; Rados Radoicic (SCG, 2003)

Lines With Many Points On Both Sides. - Rom Pinchasi (Discret. Comput. Geom., 2003)

How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? - János Pach; Rom Pinchasi (Am. Math. Mon., 2003)

On locally Delaunay geometric graphs. - Rom Pinchasi; Shakhar Smorodinsky (SCG, 2004)

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

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

A note on the minimum number of edge-directions of a convex polytope. - Shmuel Onn; Rom Pinchasi (J. Comb. Theory A, 2004)

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

On Graphs That Do Not Contain The Cube And Related Problems. - Rom Pinchasi; Micha Sharir (Comb., 2005)

A Note on Caterpillar-Embeddings with No Two Parallel Edges. - Daniel J. Kleitman; Rom Pinchasi (Discret. Comput. Geom., 2005)

Topological Graphs with No Large Grids. - János Pach; Rom Pinchasi; Micha Sharir; Géza Tóth 001 (Graphs Comb., 2005)

Crossing patterns of semi-algebraic sets. - Noga Alon; János Pach; Rom Pinchasi; Rados Radoicic; Micha Sharir (J. Comb. Theory A, 2005)

On empty convex polygons in a planar point set. - Rom Pinchasi; Rados Radoicic; Micha Sharir (J. Comb. Theory A, 2006)

At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. - Hagit Last; Rom Pinchasi (Discret. Comput. Geom., 2007)

Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. - János Pach; Rom Pinchasi; Micha Sharir (Discret. Comput. Geom., 2007)

Linear algebra approach to geometric graphs. - Rom Pinchasi (J. Comb. Theory A, 2007)

Forbidden k-Sets in the Plane. - Micha A. Perles; Rom Pinchasi (SIAM J. Discret. Math., 2007)

On s-intersecting curves and related problems. - Sarit Buzaglo; Ron Holzman; Rom Pinchasi (SCG, 2008)

Geometric graphs with no two parallel edges. - Rom Pinchasi (Comb., 2008)

Projecting Difference Sets on the Positive Orthant. - Ron Holzman; Vsevolod F. Lev; Rom Pinchasi (Comb. Probab. Comput., 2008)

There Are Not Too Many Magic Configurations. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Rom Pinchasi; Günter Rote (Discret. Comput. Geom., 2008)

An isoperimetric inequality in the universal cover of the punctured plane. - Noga Alon; Adi Pinchasi; Rom Pinchasi (Discret. Math., 2008)

Generalized Thrackles and Geometric Graphs in mathbbR3{ mathbb{R}}^3 with No Pair of Strongly Avoiding Edges. - Amitai Perlstein; Rom Pinchasi (Graphs Comb., 2008)

The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. - Rom Pinchasi (SIAM J. Discret. Math., 2008)

Halving lines and measure concentration in the plane. - Rom Pinchasi (SCG, 2009)

Points with large alpha-depth. - Itay Ben-Dan; Rom Pinchasi; Ran Ziv (J. Comb. Theory A, 2009)

Points with large quadrant-depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Rom Pinchasi; Tillmann Miltzow (SCG, 2010)

Crossings between Curves with Many Tangencies. - Jacob Fox; Fabrizio Frati; János Pach; Rom Pinchasi (WALCOM, 2010)

On a problem about quadrant-depth. - Itay Ben-Dan; Rom Pinchasi; Ran Ziv (Comput. Geom., 2010)

Dominating Subsets under Projections. - Rom Pinchasi; Allan Pinkus (SIAM J. Discret. Math., 2010)

On graphs and algebraic graphs that do not contain cycles of length 4. - Noga Alon; H. Tracy Hall; Christian Knauer; Rom Pinchasi; Raphael Yuster (J. Graph Theory, 2011)

Points with Large Quadrant Depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Tillmann Miltzow; Rom Pinchasi; Torsten Ueckerdt; Ran Ziv (J. Comput. Geom., 2011)

Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. - Eyal Ackerman; Rom Pinchasi; Ludmila Scharf; Marc Scherfenberg (Am. Math. Mon., 2011)

Regular Matchstick Graphs. - Sascha Kurz; Rom Pinchasi (Am. Math. Mon., 2011)

A note on coloring line arrangements - Eyal Ackerman; Rom Pinchasi (CoRR, 2012)

On the light side of geometric graphs. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2012)

Collapsing Walls Theorem. - Igor Pak; Rom Pinchasi (Am. Math. Mon., 2012)

On the Union Complexity of Diametral Disks. - Boris Aronov; Muriel Dulieu; Rom Pinchasi; Micha Sharir (Electron. J. Comb., 2013)

Ice-creams and wedge graphs. - Eyal Ackerman; Tsachik Gelander; Rom Pinchasi (Comput. Geom., 2013)

On inducing polygons and related problems. - Eyal Ackerman; Rom Pinchasi; Ludmila Scharf; Marc Scherfenberg (Comput. Geom., 2013)

On the number of edges in families of pseudo-discs. - Piotr Micek; Rom Pinchasi (CoRR, 2013)

On the Degenerate Crossing Number. - Eyal Ackerman; Rom Pinchasi (Discret. Comput. Geom., 2013)

A note on light geometric graphs. - Eyal Ackerman; Jacob Fox; Rom Pinchasi (Discret. Math., 2013)

Covering a chessboard with staircase walks. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2013)

Crossing by lines all edges of a line arrangement. - Rom Pinchasi (Discret. Math., 2013)

On coloring points with respect to rectangles. - Eyal Ackerman; Rom Pinchasi (J. Comb. Theory A, 2013)

The number of distinct distances from a vertex of a convex polygon. - Gabriel Nivasch; János Pach; Rom Pinchasi; Shira Zerbib (J. Comput. Geom., 2013)

A Note on Coloring Line Arrangements. - Eyal Ackerman; János Pach; Rom Pinchasi; Rados Radoicic; Géza Tóth 001 (Electron. J. Comb., 2014)

Nearly equal distances in metric spaces. - Amit Ophir; Rom Pinchasi (Discret. Appl. Math., 2014)

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. - Eyal Ackerman; Noa Nitzan; Rom Pinchasi (Graphs Comb., 2014)

On the Union of Arithmetic Progressions. - Shoni Gilboa; Rom Pinchasi (SIAM J. Discret. Math., 2014)

A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc. - Rom Pinchasi (SIAM J. Discret. Math., 2014)

Points Covered an Odd Number of Times by Translates. - Rom Pinchasi (Am. Math. Mon., 2014)

Data recovery after geographic correlated attacks. - Guy Grebla; Alon Efrat; Esther Ezra; Rom Pinchasi; Swaminathan Sankararaman (DRCN, 2015)

Node-Balancing by Edge-Increments. - Friedrich Eisenbrand; Shay Moran; Rom Pinchasi; Martin Skutella (ESA, 2015)

Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces. - Shay Moran; Rom Pinchasi (CoRR, 2015)

A Note on Smaller Fractional Helly Numbers. - Rom Pinchasi (Discret. Comput. Geom., 2015)

On the Odd Area of Planar Sets. - Assaf Oren; Igor Pak; Rom Pinchasi (Discret. Comput. Geom., 2016)

Crossing edges and faces of line arrangements in the plane. - Rom Pinchasi (J. Comb. Optim., 2016)

On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane. - Rom Pinchasi (Comb., 2017)

A Theorem on Unit Segments on the Real Line. - Rom Pinchasi (Am. Math. Mon., 2018)

On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. - Chaya Keller; Rom Pinchasi (Discret. Comput. Geom., 2020)

A One-Page Solution of a Problem of Erdős and Purdy. - Rom Pinchasi; Alexandr Polyanskii (Discret. Comput. Geom., 2020)

Crossing matchings and circuits have maximal length. - Yaakov S. Kupitz; Hagit Last; Horst Martini; Micha A. Perles; Rom Pinchasi (J. Graph Theory, 2020)

A theorem about vectors in $ mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy. - Rom Pinchasi (Australas. J Comb., 2021)

On pseudo-disk hypergraphs. - Boris Aronov; Anirudh Donakonda; Esther Ezra; Rom Pinchasi (Comput. Geom., 2021)

Some notes about the odd area of unit discs centered at points on a circle. - Amir Carmel; Rom Pinchasi (Australas. J Comb., 2023)

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane. - Rom Pinchasi (Electron. J. Comb., 2024)

The maximum number of digons formed by pairwise crossing pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (CoRR, 2024)

On partitions of two-dimensional discrete boxes. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2024)

Covering the Edges of a Complete Geometric Graph with Convex Polygons. - Rom Pinchasi; Oren Yerushalmi (Discret. Comput. Geom., 2024)

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (SoCG, 2025)

Integer points in the degree-sequence polytope. - Eleonore Bach; Friedrich Eisenbrand; Rom Pinchasi (Discret. Optim., 2025)

Second Price Matching with Complete Allocation and Degree Constraints. - Rom Pinchasi; Neta Singer; Lukas Vogl; Jiaye Wei (CoRR, 2025)

On the Number of Digons in Arrangements of Pairwise Intersecting Circles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (Comb., 2025)