activity
20072025
most citedOn Pseudo-disk Hypergraphs

7 citations · 19 across the 21 of their papers we have counts for

collaborators

24 papers

cs.DM2025

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure

Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi +2

For a real matrix with non-collinear columns, we show that where is the \emph{circuit imbalance measure} of . The circu…

math.CO2025

Distinct Directions and Distinct Distances in

Noga Alon, Rom Pinchasi

We show that there exists an absolute positive constant so that any set of points in that is -dimensional determines at least li…

cs.DS2025

Second Price Matching with Complete Allocation and Degree Constraints

Rom Pinchasi, Neta Singer, Lukas Vogl +1

We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profi…

math.CO2024

The maximum number of digons formed by pairwise crossing pseudocircles

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2

In 1972, Branko Grünbaum conjectured that any arrangement of pairwise crossing pseudocircles in the plane can have at most digons (regions enclosed by exactly two pseu…

math.CO2024

On the number of digons in arrangements of pairwise intersecting circles

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2

A long-standing open conjecture of Branko Grünbaum from 1972 states that any simple arrangement of pairwise intersecting pseudocircles in the plane can have at most digo…

math.CO2024

A note on lenses in arrangements of pairwise intersecting circles in the plane

Rom Pinchasi

Let $\F$ be a family of pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by $\F$ is at most $2n-…