Adrian Dumitrescu

activity

20232025

most citedFailures of public key infrastructure: 53 year survey

1 citations · 1 across the 16 of their papers we have counts for

collaborators

Showing cs.CGShow all

5 papers · 1 filter

cs.CG2025

A Couple of Simple Algorithms for $k$ -Dispersion

Ke Chen, Adrian Dumitrescu

Given a set $P$ of $n$ points in $R^{d}$ , and a positive integer $k \leq n$ , the $k$ -dispersion problem is that of selecting $k$ of the given points so that the minimum inte…

cs.CG2025

Arcs with increasing chords in $R^{d}$

Adrian Dumitrescu, Zsolt Lángi

A curve $γ$ that connects $s$ and $t$ has the increasing chord property if $∣ b c ∣ \leq ∣ a d ∣$ whenever $a, b, c, d$ lie in that order on $γ$ . For planar curves, the length of such a cur…

cs.CG2025

General Position Subset Selection in Line Arrangements

Adrian Dumitrescu

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no thr…

cs.CG2025

A Purely Geometric Variant of the Gale-Berlekamp Switching Game

Adrian Dumitrescu, Jeck Lim, János Pach +1

We introduce the following variant of the Gale-Berlekamp switching game. Let $P$ be a set of n noncollinear points in the plane, each of them having weight $+ 1$ or $- 1$ . At each st…

cs.CG2023

Two trees are better than one

Adrian Dumitrescu, János Pach, Géza Tóth

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w (P)$ denotes the length of a mini…

A Couple of Simple Algorithms for k-Dispersion

Arcs with increasing chords in Rd

General Position Subset Selection in Line Arrangements

A Purely Geometric Variant of the Gale-Berlekamp Switching Game

Two trees are better than one

A Couple of Simple Algorithms for $k$ -Dispersion

Arcs with increasing chords in $R^{d}$