Rom Pinchasi

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 17

Top Topics

Top Venues

Discret. Comput. Geom.

SIAM J. Discret. Math.

Publications

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
On the number of digons in arrangements of pairwise intersecting circles. CoRR (2024)
Eyal Ackerman, Rom Pinchasi
On partitions of two-dimensional discrete boxes. Discret. Math. 347 (4) (2024)
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG (2024)
Rom Pinchasi
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane. Electron. J. Comb. 31 (2) (2024)
Amir Carmel, Rom Pinchasi
Some notes about the odd area of unit discs centered at points on a circle. Australas. J Comb. 87 (2023)
Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi
Integer points in the degree-sequence polytope. CoRR (2023)
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
On pseudo-disk hypergraphs. Comput. Geom. 92 (2021)
Rom Pinchasi
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy. Australas. J Comb. 81 (2021)
Yaakov S. Kupitz, Hagit Last, Horst Martini, Micha A. Perles, Rom Pinchasi
Crossing matchings and circuits have maximal length. J. Graph Theory 94 (1) (2020)
Rom Pinchasi, Alexandr Polyanskii
A One-Page Solution of a Problem of Erdős and Purdy. Discret. Comput. Geom. 64 (2) (2020)
Chaya Keller, Rom Pinchasi
On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. Discret. Comput. Geom. 64 (3) (2020)
Chaya Keller, Rom Pinchasi
On sets of n points in general position that determine lines that can be pierced by n points. CoRR (2019)
Rom Pinchasi
A Theorem on Unit Segments on the Real Line. Am. Math. Mon. 125 (2) (2018)
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
On Pseudo-disk Hypergraphs. CoRR (2018)
Rom Pinchasi
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane. Comb. 37 (1) (2017)
Rom Pinchasi
Crossing edges and faces of line arrangements in the plane. J. Comb. Optim. 31 (2) (2016)
Assaf Oren, Igor Pak, Rom Pinchasi
On the Odd Area of Planar Sets. Discret. Comput. Geom. 55 (3) (2016)
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
Node-balancing by edge-increments. CoRR (2015)
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
Node-Balancing by Edge-Increments. ESA (2015)
Shay Moran, Rom Pinchasi
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces. CoRR (2015)
Guy Grebla, Alon Efrat, Esther Ezra, Rom Pinchasi, Swaminathan Sankararaman
Data recovery after geographic correlated attacks. DRCN (2015)
Rom Pinchasi
A Note on Smaller Fractional Helly Numbers. Discret. Comput. Geom. 54 (3) (2015)
Rom Pinchasi
Points Covered an Odd Number of Times by Translates. Am. Math. Mon. 121 (7) (2014)
Shoni Gilboa, Rom Pinchasi
On the Union of Arithmetic Progressions. SIAM J. Discret. Math. 28 (3) (2014)
Eyal Ackerman, Noa Nitzan, Rom Pinchasi
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs Comb. 30 (5) (2014)
Amit Ophir, Rom Pinchasi
Nearly equal distances in metric spaces. Discret. Appl. Math. 174 (2014)
Rom Pinchasi
A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc. SIAM J. Discret. Math. 28 (4) (2014)
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
A Note on Coloring Line Arrangements. Electron. J. Comb. 21 (2) (2014)
Eyal Ackerman, Rom Pinchasi
On coloring points with respect to rectangles. J. Comb. Theory, Ser. A 120 (4) (2013)
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
Ice-creams and wedge graphs. Comput. Geom. 46 (3) (2013)
Eyal Ackerman, Rom Pinchasi
On the Degenerate Crossing Number. Discret. Comput. Geom. 49 (3) (2013)
Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20 (2) (2013)
Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. 4 (1) (2013)
Eyal Ackerman, Jacob Fox, Rom Pinchasi
A note on light geometric graphs. Discret. Math. 313 (11) (2013)
Rom Pinchasi
Crossing by lines all edges of a line arrangement. Discret. Math. 313 (21) (2013)
Piotr Micek, Rom Pinchasi
On the number of edges in families of pseudo-discs. CoRR (2013)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
On inducing polygons and related problems. Comput. Geom. 46 (7) (2013)
Eyal Ackerman, Rom Pinchasi
Covering a chessboard with staircase walks. Discret. Math. 313 (22) (2013)
Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
The number of distinct distances from a vertex of a convex polygon CoRR (2012)
Eyal Ackerman, Rom Pinchasi
A note on coloring line arrangements CoRR (2012)
Eyal Ackerman, Rom Pinchasi
On the light side of geometric graphs. Discret. Math. 312 (6) (2012)
Igor Pak, Rom Pinchasi
Collapsing Walls Theorem. Am. Math. Mon. 119 (2) (2012)
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
Ice-Creams and Wedge Graphs CoRR (2011)
Sascha Kurz, Rom Pinchasi
Regular Matchstick Graphs. Am. Math. Mon. 118 (3) (2011)
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv
Points with Large Quadrant Depth. J. Comput. Geom. 2 (1) (2011)
Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
On graphs and algebraic graphs that do not contain cycles of length 4. J. Graph Theory 68 (2) (2011)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
-gon. Am. Math. Mon. 118 (2) (2011)
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow
Points with large quadrant-depth. SCG (2010)
Rom Pinchasi, Allan Pinkus
Dominating Subsets under Projections. SIAM J. Discret. Math. 24 (3) (2010)
Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi
Crossings between Curves with Many Tangencies. WALCOM (2010)
Itay Ben-Dan, Rom Pinchasi, Ran Ziv
On a problem about quadrant-depth. Comput. Geom. 43 (6-7) (2010)
Itay Ben-Dan, Rom Pinchasi, Ran Ziv
Points with large alpha-depth. J. Comb. Theory, Ser. A 116 (3) (2009)
Rom Pinchasi
Halving lines and measure concentration in the plane. SCG (2009)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
On Inducing Polygons and Related Problems. ESA (2009)
Rom Pinchasi
Geometric graphs with no two parallel edges. Comb. 28 (1) (2008)
Sarit Buzaglo, Ron Holzman, Rom Pinchasi
-intersecting curves and related problems. SCG (2008)
Ron Holzman, Vsevolod F. Lev, Rom Pinchasi
Projecting Difference Sets on the Positive Orthant. Comb. Probab. Comput. 17 (5) (2008)
Amitai Perlstein, Rom Pinchasi
{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges. Graphs Comb. 24 (4) (2008)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 39 (1-3) (2008)
Rom Pinchasi
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. SIAM J. Discret. Math. 22 (2) (2008)
Noga Alon, Adi Pinchasi, Rom Pinchasi
An isoperimetric inequality in the universal cover of the punctured plane. Discret. Math. 308 (23) (2008)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
There are not too many magic configurations. SCG (2007)
Rom Pinchasi
Linear algebra approach to geometric graphs. J. Comb. Theory, Ser. A 114 (8) (2007)
Hagit Last, Rom Pinchasi
At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. Discret. Comput. Geom. 38 (2) (2007)
Micha A. Perles, Rom Pinchasi
Forbidden k-Sets in the Plane. SIAM J. Discret. Math. 21 (2) (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. Discret. Comput. Geom. 38 (2) (2007)
Rom Pinchasi, Rados Radoicic, Micha Sharir
On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113 (3) (2006)
János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
Topological Graphs with No Large Grids. Graphs Comb. 21 (3) (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) (2005)
Rom Pinchasi, Micha Sharir
On Graphs That Do Not Contain The Cube And Related Problems. Comb. 25 (5) (2005)
Daniel J. Kleitman, Rom Pinchasi
A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discret. Comput. Geom. 33 (2) (2005)
Shmuel Onn, Rom Pinchasi
A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory, Ser. A 107 (1) (2004)
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) (2004)
Rom Pinchasi, Shakhar Smorodinsky
On locally Delaunay geometric graphs. SCG (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) (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) (2004)
Rom Pinchasi, Rados Radoicic, Micha Sharir
On empty convex polygons in a planar point set. SCG (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. SCG (2004)
Rom Pinchasi, Rados Radoicic
Topological graphs with no self-intersecting cycle of lenth 4. SCG (2003)
Rom Pinchasi
Lines With Many Points On Both Sides. Discret. Comput. Geom. 30 (3) (2003)
János Pach, Rom Pinchasi
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? Am. Math. Mon. 110 (5) (2003)
János Pach, Rom Pinchasi, Micha Sharir
A tight bound for the number of different directions in three dimensions. SCG (2003)
Rom Pinchasi
Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. Discret. Comput. Geom. 28 (4) (2002)
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)
Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
Lenses in arrangements of pseudo-circles and their applications. SCG (2002)
Rom Pinchasi
On the Size of a Radial Set. JCDCG (2002)
János Pach, Rom Pinchasi
On the Number of Balanced Lines. Discret. Comput. Geom. 25 (4) (2001)
Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir
On the Complexity of Arrangements of Circles in the Plane. Discret. Comput. Geom. 26 (4) (2001)
János Pach, Rom Pinchasi
Bichromatic Lines with Few Points. J. Comb. Theory, Ser. A 90 (2) (2000)