Rom Pinchasi

发表

On s-intersecting curves and related problems

Sarit Buzaglo, Ron Holzman, Rom Pinchasi, 2008, SCG '08.

There Are Not Too Many Magic Configurations

Günter Rote, Kevin Buchin, Rom Pinchasi, 2008, Discret. Comput. Geom..

On the number of edges in families of pseudo-discs pdf

Rom Pinchasi, Piotr Micek, Piotr Micek, 2013, ArXiv.

Geometric graphs with no two parallel edges

Rom Pinchasi, 2008, Comb..

On the Size of a Radial Set

Rom Pinchasi, 2002, JCDCG.

Note on the number of edges in families with linear union-complexity

Rom Pinchasi, Piotr Micek, Piotr Micek, 2013, 1312.1678.

On the Union Complexity of Diametral Disks

Micha Sharir, Boris Aronov, Rom Pinchasi, 2013, Electron. J. Comb..

The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane

Rom Pinchasi, R. Pinchasi, 2008, SIAM J. Discret. Math..

Lenses in arrangements of pseudo-circles and their applications

Micha Sharir, János Pach, Pankaj K. Agarwal, 2004, JACM.

Points with large alpha-depth

Rom Pinchasi, Ran Ziv, Itay Ben-Dan, 2009, J. Comb. Theory, Ser. A.

Points Covered an Odd Number of Times by Translates

Rom Pinchasi, 2014, Am. Math. Mon..

On Inducing Polygons and Related Problems

Rom Pinchasi, Ludmila Scharf, Eyal Ackerman, 2009, ESA.

Regular Matchstick Graphs

Rom Pinchasi, Sascha Kurz, 2011, Am. Math. Mon..

Projecting Difference Sets on the Positive Orthant

Ron Holzman, Rom Pinchasi, Vsevolod F. Lev, 2008, Comb. Probab. Comput..

Crossing by lines all edges of a line arrangement

Rom Pinchasi, 2013, Discret. Math..

Forbidden k-Sets in the Plane

Micha A. Perles, Rom Pinchasi, 2007, SIAM J. Discret. Math..

Generalized Thrackles and Geometric Graphs in $${\mathbb{R}}^3$$ with No Pair of Strongly Avoiding Edges

Rom Pinchasi, Amitai Perlstein, 2008, Graphs Comb..

A note on light geometric graphs

Rom Pinchasi, Eyal Ackerman, Jacob Fox, 2013, Discret. Math..

The number of distinct distances from a vertex of a convex polygon pdf

Gabriel Nivasch, János Pach, Rom Pinchasi, 2013, J. Comput. Geom..

How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?

János Pach, Rom Pinchasi, 2003, Am. Math. Mon..

On inducing polygons and related problems

Rom Pinchasi, Ludmila Scharf, Eyal Ackerman, 2009, Comput. Geom..

Linear algebra approach to geometric graphs

Rom Pinchasi, 2007, J. Comb. Theory, Ser. A.

A tight bound for the number of different directions in three dimensions

Micha Sharir, János Pach, Rom Pinchasi, 2003, SCG '03.

A Note on Caterpillar-Embeddings with No Two Parallel Edges

Rom Pinchasi, Daniel J. Kleitman, 2005, Discret. Comput. Geom..

Collapsing Walls Theorem

Rom Pinchasi, Igor Pak, 2012, Am. Math. Mon..

On the Odd Area of Planar Sets

Rom Pinchasi, Igor Pak, Assaf Oren, 2016, Discret. Comput. Geom..

Nearly equal distances in metric spaces

Rom Pinchasi, Amit Ophir, 2014, Discret. Appl. Math..

Ice-creams and wedge graphs

Rom Pinchasi, Eyal Ackerman, Tsachik Gelander, 2013, Comput. Geom..

On Graphs That Do Not Contain The Cube And Related Problems

Micha Sharir, Rom Pinchasi, 2005, Comb..

Crossings between Curves with Many Tangencies

János Pach, Rom Pinchasi, Fabrizio Frati, 2010, WALCOM.

Node-Balancing by Edge-Increments

Shay Moran, Martin Skutella, Friedrich Eisenbrand, 2015, ESA.

Geometric graphs with no self-intersecting path of length three

János Pach, Gábor Tardos, Rom Pinchasi, 2004, Eur. J. Comb..

At Least n – 1 Intersection Points in a Connected Family of n Unit Circles in the Plane

Rom Pinchasi, Hagit Last, 2007, Discret. Comput. Geom..

A Theorem on Unit Segments on the Real Line

Rom Pinchasi, 2018, Am. Math. Mon..

Gallai—Sylvester Theorem for Pairwise Intersecting Unit Circles

Rom Pinchasi, R. Pinchasi, 2002, Discret. Comput. Geom..

Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon

Rom Pinchasi, Ludmila Scharf, Eyal Ackerman, 2011, Am. Math. Mon..

Dominating Subsets under Projections

Rom Pinchasi, Allan Pinkus, 2010, SIAM J. Discret. Math..

On a problem about quadrant-depth

Rom Pinchasi, Ran Ziv, Itay Ben-Dan, 2010, Comput. Geom..

Topological graphs with no self-intersecting cycle of length 4

Rom Pinchasi, Rados Radoicic, R. Radoicic, 2003, SCG '03.

On coloring points with respect to rectangles

Rom Pinchasi, Eyal Ackerman, 2013, J. Comb. Theory, Ser. A.

Abstract.

Micha Sharir, János Pach, Rom Pinchasi, 2013, Virologie.

On sets of n points in general position that determine lines that can be pierced by n points pdf

Rom Pinchasi, Chaya Keller, 2020, Discret. Comput. Geom..

On the Union of Arithmetic Progressions

Rom Pinchasi, Shoni Gilboa, Rom Pinchasi, 2013, SIAM J. Discret. Math..

Crossing matchings and circuits have maximal length

Micha A. Perles, Horst Martini, Yaakov S. Kupitz, 2020, J. Graph Theory.

On the light side of geometric graphs

Rom Pinchasi, Eyal Ackerman, 2012, Discret. Math..

Crossings between curves with many tangencies in: Proc. WALCOM: Workshop on Algorithms and Computation, Lecture Notes in Computer Science 5942, Springer-Verlag, 2010, 1--8.

János Pach, Rom Pinchasi, Fabrizio Frati, 2010 .

A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc

Rom Pinchasi, R. Pinchasi, 2014, SIAM J. Discret. Math..

On locally Delaunay geometric graphs

Rom Pinchasi, Shakhar Smorodinsky, 2004, SCG '04.

On empty convex polygons in a planar point set

Micha Sharir, Rom Pinchasi, Rados Radoicic, 2004, SCG '04.

On graphs and algebraic graphs that do not contain cycles of length 4

Noga Alon, Raphael Yuster, Rom Pinchasi, 2011, J. Graph Theory.

Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces pdf

Shay Moran, Rom Pinchasi, S. Moran, 2015, ArXiv.

On the Degenerate Crossing Number

Rom Pinchasi, Eyal Ackerman, 2013, Discret. Comput. Geom..

Crossing patterns of semi-algebraic sets

Noga Alon, Micha Sharir, János Pach, 2005, J. Comb. Theory, Ser. A.

Solution of Scott's problem on the number of directions determined by a point set in 3-space

Micha Sharir, János Pach, Rom Pinchasi, 2004, SCG '04.

Bichromatic Lines with Few Points

Rom Pinchasi, János Pach, 2000, J. Comb. Theory, Ser. A.

There are not too many magic configurations

Günter Rote, Kevin Buchin, Rom Pinchasi, 2007, SCG '07.

Crossing edges and faces of line arrangements in the plane

Rom Pinchasi, 2016, J. Comb. Optim..

On Pseudo-disk Hypergraphs pdf

Boris Aronov, Rom Pinchasi, Esther Ezra, 2021, Comput. Geom..

On the Complexity of Arrangements of Circles in the Plane

Noga Alon, Micha Sharir, Rom Pinchasi, 2001, Discret. Comput. Geom..

Lines With Many Points On Both Sides

Rom Pinchasi, 2003, Discret. Comput. Geom..

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

Rom Pinchasi, Eyal Ackerman, Noa Nitzan, 2014, Graphs Comb..

A One-Page Solution of a Problem of Erdős and Purdy

Rom Pinchasi, Alexandr Polyanskii, 2020, Discret. Comput. Geom..

Covering a chessboard with staircase walks

Rom Pinchasi, Eyal Ackerman, 2013, Discret. Math..

Data recovery after geographic correlated attacks

Rom Pinchasi, Alon Efrat, Esther Ezra, 2015, 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN).

On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane

Rom Pinchasi, 2017, Comb..

Points with Large Quadrant Depth

Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, 2011, J. Comput. Geom..

A Note on Smaller Fractional Helly Numbers

Rom Pinchasi, 2015, Discret. Comput. Geom..

On the Number of Balanced Lines

János Pach, Rom Pinchasi, 2001, Discret. Comput. Geom..

Points with large quadrant-depth

Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, 2010, SoCG '10.

Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space

Micha Sharir, János Pach, Rom Pinchasi, 2007, Discret. Comput. Geom..

Halving lines and measure concentration in the plane

Rom Pinchasi, 2009, SCG '09.

Geometric graphs with no self-intersecting path of length three ∗

János Pach, Gábor Tardos, Rom Pinchasi, 2022 .

A note on the minimum number of edge-directions of a convex polytope

Rom Pinchasi, Shmuel Onn, 2004, J. Comb. Theory, Ser. A.

On empty convex polygons in a planar point set

Micha Sharir, Rom Pinchasi, Rados Radoicic, 2006, J. Comb. Theory, Ser. A.

Topological Graphs with No Large Grids

Micha Sharir, János Pach, Rom Pinchasi, 2005, Graphs Comb..

An isoperimetric inequality in the universal cover of the punctured plane

Noga Alon, Rom Pinchasi, Adi Pinchasi, 2008, Discret. Math..

A Note on Coloring Line Arrangements pdf

Rom Pinchasi, Eyal Ackerman, János Pach, 2014, Electron. J. Comb..

On sets of points in general position that lie on a cubic curve in the plane and determine lines that can be pierced by few points

Rom Pinchasi, Mehdi Makhul, 2021 .

On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs

Rom Pinchasi, Gunter Rote, 2009 .

A Long Noncrossing Path Among Disjoint Segments in the Plane

János Pach, Rom Pinchasi, 2007 .

A finite family of pseudo-discs must include a “ small ” pseudo-disc

Rom Pinchasi, R. Pinchasi, 2014 .

Generalized Thrackles and Geometric Graphs in with No Pair of Strongly Avoiding Edges

Rom Pinchasi, Amitai Perlstein, 2008 .

Solving a ± b = 2c in elements of finite sets

Rom Pinchasi, Vsevolod F. Lev, 2014 .

A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane

Rom Pinchasi, 2013 .