According to our database
1,
Rom Pinchasi
authored at least 79 papers
between 2000 and 2024.
Collaborative distances:
2024
Covering the Edges of a Complete Geometric Graph with Convex Polygons.
Discret. Comput. Geom., September, 2024
On partitions of two-dimensional discrete boxes.
Discret. Math., April, 2024
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane.
Electron. J. Comb., 2024
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Some notes about the odd area of unit discs centered at points on a circle.
Australas. J Comb., October, 2023
Integer points in the degree-sequence polytope.
CoRR, 2023
2021
On pseudo-disk hypergraphs.
Comput. Geom., 2021
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy.
Australas. J Comb., 2021
2020
Crossing matchings and circuits have maximal length.
J. Graph Theory, 2020
A One-Page Solution of a Problem of Erdős and Purdy.
Discret. Comput. Geom., 2020
On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points.
Discret. Comput. Geom., 2020
2018
A Theorem on Unit Segments on the Real Line.
Am. Math. Mon., 2018
2017
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane.
Comb., 2017
2016
Crossing edges and faces of line arrangements in the plane.
J. Comb. Optim., 2016
On the Odd Area of Planar Sets.
Discret. Comput. Geom., 2016
2015
A Note on Smaller Fractional Helly Numbers.
Discret. Comput. Geom., 2015
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces.
CoRR, 2015
Node-Balancing by Edge-Increments.
Proceedings of the Algorithms - ESA 2015, 2015
Data recovery after geographic correlated attacks.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015
2014
Points Covered an Odd Number of Times by Translates.
Am. Math. Mon., 2014
A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc.
SIAM J. Discret. Math., 2014
On the Union of Arithmetic Progressions.
SIAM J. Discret. Math., 2014
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges.
Graphs Comb., 2014
Nearly equal distances in metric spaces.
Discret. Appl. Math., 2014
A Note on Coloring Line Arrangements.
Electron. J. Comb., 2014
2013
The number of distinct distances from a vertex of a convex polygon.
J. Comput. Geom., 2013
On coloring points with respect to rectangles.
J. Comb. Theory A, 2013
Crossing by lines all edges of a line arrangement.
Discret. Math., 2013
Covering a chessboard with staircase walks.
Discret. Math., 2013
A note on light geometric graphs.
Discret. Math., 2013
On the Degenerate Crossing Number.
Discret. Comput. Geom., 2013
On the number of edges in families of pseudo-discs.
CoRR, 2013
On inducing polygons and related problems.
Comput. Geom., 2013
Ice-creams and wedge graphs.
Comput. Geom., 2013
On the Union Complexity of Diametral Disks.
Electron. J. Comb., 2013
2012
Collapsing Walls Theorem.
Am. Math. Mon., 2012
On the light side of geometric graphs.
Discret. Math., 2012
A note on coloring line arrangements
CoRR, 2012
2011
Regular Matchstick Graphs.
Am. Math. Mon., 2011
Every Simple Arrangement of <i>n</i> Lines Contains an Inducing Simple <i>n</i>-gon.
Am. Math. Mon., 2011
Points with Large Quadrant Depth.
J. Comput. Geom., 2011
On graphs and algebraic graphs that do not contain cycles of length 4.
J. Graph Theory, 2011
2010
Dominating Subsets under Projections.
SIAM J. Discret. Math., 2010
On a problem about quadrant-depth.
Comput. Geom., 2010
Crossings between Curves with Many Tangencies.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
Points with large quadrant-depth.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
Points with large alpha-depth.
J. Comb. Theory A, 2009
Halving lines and measure concentration in the plane.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
2008
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane.
SIAM J. Discret. Math., 2008
Generalized Thrackles and Geometric Graphs in \mathbb<i>R</i><sup>3</sup>{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges.
Graphs Comb., 2008
An isoperimetric inequality in the universal cover of the punctured plane.
Discret. Math., 2008
There Are Not Too Many Magic Configurations.
Discret. Comput. Geom., 2008
Projecting Difference Sets on the Positive Orthant.
Comb. Probab. Comput., 2008
Geometric graphs with no two parallel edges.
Comb., 2008
On <i>s</i>-intersecting curves and related problems.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Forbidden k-Sets in the Plane.
SIAM J. Discret. Math., 2007
Linear algebra approach to geometric graphs.
J. Comb. Theory A, 2007
Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space.
Discret. Comput. Geom., 2007
At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane.
Discret. Comput. Geom., 2007
2006
On empty convex polygons in a planar point set.
J. Comb. Theory A, 2006
2005
Crossing patterns of semi-algebraic sets.
J. Comb. Theory A, 2005
Topological Graphs with No Large Grids.
Graphs Comb., 2005
A Note on Caterpillar-Embeddings with No Two Parallel Edges.
Discret. Comput. Geom., 2005
On Graphs That Do Not Contain The Cube And Related Problems.
Comb., 2005
2004
On the number of directions determined by a three-dimensional points set.
J. Comb. Theory A, 2004
A note on the minimum number of edge-directions of a convex polytope.
J. Comb. Theory A, 2004
Lenses in arrangements of pseudo-circles and their applications.
J. ACM, 2004
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb., 2004
On locally Delaunay geometric graphs.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
2003
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
Am. Math. Mon., 2003
Lines With Many Points On Both Sides.
Discret. Comput. Geom., 2003
Topological graphs with no self-intersecting cycle of lenth 4.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
A tight bound for the number of different directions in three dimensions.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
2002
Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles.
Discret. Comput. Geom., 2002
On the Size of a Radial Set.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Lenses in arrangements of pseudo-circles and their applications.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
2001
On the Number of Balanced Lines.
Discret. Comput. Geom., 2001
On the Complexity of Arrangements of Circles in the Plane.
Discret. Comput. Geom., 2001
2000
Bichromatic Lines with Few Points.
J. Comb. Theory A, 2000
