Rom Pinchasi

97 papers A* 3A 3B 1Journal 78Unranked 12
YearRankTypeTitle / Venue / Authors
2026 A* conf
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure.
SODA
Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2025 J jnl
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure.
CoRR
Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2025 J jnl
Integer points in the degree-sequence polytope.
Discret. Optim.
Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi
2025 J jnl
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
Comb.
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2025 J jnl
Second Price Matching with Complete Allocation and Degree Constraints.
CoRR
Rom Pinchasi, Neta Singer, Lukas Vogl, Jiaye Wei
2025 A* conf
The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane.
Electron. J. Comb.
Rom Pinchasi
2024 J jnl
Covering the Edges of a Complete Geometric Graph with Convex Polygons.
Discret. Comput. Geom.
Rom Pinchasi, Oren Yerushalmi
2024 J jnl
On partitions of two-dimensional discrete boxes.
Discret. Math.
Eyal Ackerman, Rom Pinchasi
2024 A* conf
On the Number of Digons in Arrangements of Pairwise Intersecting Circles.
SoCG
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
On the number of digons in arrangements of pairwise intersecting circles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2024 J jnl
The maximum number of digons formed by pairwise crossing pseudocircles.
CoRR
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
2023 J jnl
Integer points in the degree-sequence polytope.
CoRR
Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi
2023 J jnl
Some notes about the odd area of unit discs centered at points on a circle.
Australas. J Comb.
Amir Carmel, Rom Pinchasi
2021 J jnl
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy.
Australas. J Comb.
Rom Pinchasi
2021 J jnl
On pseudo-disk hypergraphs.
Comput. Geom.
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
2020 J jnl
A One-Page Solution of a Problem of Erdős and Purdy.
Discret. Comput. Geom.
Rom Pinchasi, Alexandr Polyanskii
2020 J jnl
Crossing matchings and circuits have maximal length.
J. Graph Theory
Yaakov S. Kupitz, Hagit Last, Horst Martini, Micha A. Perles, Rom Pinchasi
2020 J jnl
On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points.
Discret. Comput. Geom.
Chaya Keller, Rom Pinchasi
2019 J jnl
On sets of n points in general position that determine lines that can be pierced by n points.
CoRR
Chaya Keller, Rom Pinchasi
2018 J jnl
A Theorem on Unit Segments on the Real Line.
Am. Math. Mon.
Rom Pinchasi
2018 J jnl
On Pseudo-disk Hypergraphs.
CoRR
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
2017 J jnl
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane.
Comb.
Rom Pinchasi
2016 J jnl
Crossing edges and faces of line arrangements in the plane.
J. Comb. Optim.
Rom Pinchasi
2016 J jnl
On the Odd Area of Planar Sets.
Discret. Comput. Geom.
Assaf Oren, Igor Pak, Rom Pinchasi
2015 J jnl
A Note on Smaller Fractional Helly Numbers.
Discret. Comput. Geom.
Rom Pinchasi
2015 — conf
Data recovery after geographic correlated attacks.
DRCN
Guy Grebla, Alon Efrat, Esther Ezra, Rom Pinchasi, Swaminathan Sankararaman
2015 J jnl
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces.
CoRR
Shay Moran, Rom Pinchasi
2015 A conf
Node-Balancing by Edge-Increments.
ESA
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
2015 J jnl
Node-balancing by edge-increments.
CoRR
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
2014 J jnl
A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc.
SIAM J. Discret. Math.
Rom Pinchasi
2014 J jnl
A Note on Coloring Line Arrangements.
Electron. J. Comb.
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
2014 J jnl
Nearly equal distances in metric spaces.
Discret. Appl. Math.
Amit Ophir, Rom Pinchasi
2014 J jnl
On the Union of Arithmetic Progressions.
SIAM J. Discret. Math.
Shoni Gilboa, Rom Pinchasi
2014 J jnl
Points Covered an Odd Number of Times by Translates.
Am. Math. Mon.
Rom Pinchasi
2014 J jnl
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges.
Graphs Comb.
Eyal Ackerman, Noa Nitzan, Rom Pinchasi
2013 J jnl
A note on light geometric graphs.
Discret. Math.
Eyal Ackerman, Jacob Fox, Rom Pinchasi
2013 J jnl
Covering a chessboard with staircase walks.
Discret. Math.
Eyal Ackerman, Rom Pinchasi
2013 J jnl
Crossing by lines all edges of a line arrangement.
Discret. Math.
Rom Pinchasi
2013 J jnl
Ice-creams and wedge graphs.
Comput. Geom.
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
2013 J jnl
On coloring points with respect to rectangles.
J. Comb. Theory A
Eyal Ackerman, Rom Pinchasi
2013 J jnl
On inducing polygons and related problems.
Comput. Geom.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
2013 J jnl
On the Degenerate Crossing Number.
Discret. Comput. Geom.
Eyal Ackerman, Rom Pinchasi
2013 J jnl
On the Union Complexity of Diametral Disks.
Electron. J. Comb.
Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir
2013 J jnl
On the number of edges in families of pseudo-discs.
CoRR
Piotr Micek, Rom Pinchasi
2013 J jnl
The number of distinct distances from a vertex of a convex polygon.
J. Comput. Geom.
Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
2012 J jnl
A note on coloring line arrangements
CoRR
Eyal Ackerman, Rom Pinchasi
2012 J jnl
Collapsing Walls Theorem.
Am. Math. Mon.
Igor Pak, Rom Pinchasi
2012 J jnl
On the light side of geometric graphs.
Discret. Math.
Eyal Ackerman, Rom Pinchasi
2012 J jnl
The number of distinct distances from a vertex of a convex polygon
CoRR
Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib
2011 J jnl
Every Simple Arrangement of
Am. Math. Mon.
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
2011 J jnl
Ice-Creams and Wedge Graphs
CoRR
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
2011 J jnl
On graphs and algebraic graphs that do not contain cycles of length 4.
J. Graph Theory
Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
2011 J jnl
Points with Large Quadrant Depth.
J. Comput. Geom.
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv
2011 J jnl
Regular Matchstick Graphs.
Am. Math. Mon.
Sascha Kurz, Rom Pinchasi
2010 B conf
Crossings between Curves with Many Tangencies.
WALCOM
Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi
2010 J jnl
Dominating Subsets under Projections.
SIAM J. Discret. Math.
Rom Pinchasi, Allan Pinkus
2010 J jnl
On a problem about quadrant-depth.
Comput. Geom.
Itay Ben-Dan, Rom Pinchasi, Ran Ziv
2010 — conf
Points with large quadrant-depth.
SCG
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow
2009 — conf
Halving lines and measure concentration in the plane.
SCG
Rom Pinchasi
2009 A conf
On Inducing Polygons and Related Problems.
ESA
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
2009 J jnl
Points with large alpha-depth.
J. Comb. Theory A
Itay Ben-Dan, Rom Pinchasi, Ran Ziv
2008 J jnl
An isoperimetric inequality in the universal cover of the punctured plane.
Discret. Math.
Noga Alon, Adi Pinchasi, Rom Pinchasi
2008 J jnl
Generalized Thrackles and Geometric Graphs in \mathbb
Graphs Comb.
Amitai Perlstein, Rom Pinchasi
2008 J jnl
Geometric graphs with no two parallel edges.
Comb.
Rom Pinchasi
2008 — conf
On
SCG
Sarit Buzaglo, Ron Holzman, Rom Pinchasi
2008 J jnl
Projecting Difference Sets on the Positive Orthant.
Comb. Probab. Comput.
Ron Holzman, Vsevolod F. Lev, Rom Pinchasi
2008 J jnl
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane.
SIAM J. Discret. Math.
Rom Pinchasi
2008 J jnl
There Are Not Too Many Magic Configurations.
Discret. Comput. Geom.
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
2007 J jnl
At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane.
Discret. Comput. Geom.
Hagit Last, Rom Pinchasi
2007 J jnl
Forbidden k-Sets in the Plane.
SIAM J. Discret. Math.
Micha A. Perles, Rom Pinchasi
2007 J jnl
Linear algebra approach to geometric graphs.
J. Comb. Theory A
Rom Pinchasi
2007 J jnl
Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space.
Discret. Comput. Geom.
János Pach, Rom Pinchasi, Micha Sharir
2007 — conf
There are not too many magic configurations.
SCG
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
2006 J jnl
On empty convex polygons in a planar point set.
J. Comb. Theory A
Rom Pinchasi, Rados Radoicic, Micha Sharir
2005 J jnl
A Note on Caterpillar-Embeddings with No Two Parallel Edges.
Discret. Comput. Geom.
Daniel J. Kleitman, Rom Pinchasi
2005 J jnl
Crossing patterns of semi-algebraic sets.
J. Comb. Theory A
Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
2005 J jnl
On Graphs That Do Not Contain The Cube And Related Problems.
Comb.
Rom Pinchasi, Micha Sharir
2005 J jnl
Topological Graphs with No Large Grids.
Graphs Comb.
János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
2004 J jnl
A note on the minimum number of edge-directions of a convex polytope.
J. Comb. Theory A
Shmuel Onn, Rom Pinchasi
2004 J jnl
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb.
János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2004 J jnl
Lenses in arrangements of pseudo-circles and their applications.
J. ACM
Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2004 — conf
On empty convex polygons in a planar point set.
SCG
Rom Pinchasi, Rados Radoicic, Micha Sharir
2004 — conf
On locally Delaunay geometric graphs.
SCG
Rom Pinchasi, Shakhar Smorodinsky
2004 J jnl
On the number of directions determined by a three-dimensional points set.
J. Comb. Theory A
János Pach, Rom Pinchasi, Micha Sharir
2004 — conf
Solution of Scott's problem on the number of directions determined by a point set in 3-space.
SCG
János Pach, Rom Pinchasi, Micha Sharir
2003 — conf
A tight bound for the number of different directions in three dimensions.
SCG
János Pach, Rom Pinchasi, Micha Sharir
2003 J jnl
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
Am. Math. Mon.
János Pach, Rom Pinchasi
2003 J jnl
Lines With Many Points On Both Sides.
Discret. Comput. Geom.
Rom Pinchasi
2003 — conf
Topological graphs with no self-intersecting cycle of lenth 4.
SCG
Rom Pinchasi, Rados Radoicic
2002 J jnl
Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles.
Discret. Comput. Geom.
Rom Pinchasi
2002 A conf
Geometric Graphs with No Self-intersecting Path of Length Three.
GD
János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2002 — conf
Lenses in arrangements of pseudo-circles and their applications.
SCG
Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2002 — conf
On the Size of a Radial Set.
JCDCG
Rom Pinchasi
2001 J jnl
On the Complexity of Arrangements of Circles in the Plane.
Discret. Comput. Geom.
Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir
2001 J jnl
On the Number of Balanced Lines.
Discret. Comput. Geom.
János Pach, Rom Pinchasi
2000 J jnl
Bichromatic Lines with Few Points.
J. Comb. Theory A
János Pach, Rom Pinchasi