1 citations · 1 across the 16 of their papers we have counts for
4 papers · 2 filters
Geometric Variants of the Gale--Berlekamp Switching Game
Adrian Dumitrescu
The Gale-Berlekamp switching game is played on the following device: is an array of lights is controlled by switche…
Subset selection problems in planar point sets
József Balogh, Felix Christian Clemen, Adrian Dumitrescu +1
Given a finite point set satisfying condition , the subset selection problem asks, how large of a subset satisfying condition can be extracted? In this p…
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to it…
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
Adrian Dumitrescu, János Pach
A \emph{complete geometric graph} consists of a set of points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bo…