collaborators

8 papers

cs.CG2025

A Couple of Simple Algorithms for -Dispersion

Ke Chen, Adrian Dumitrescu

Given a set of points in , and a positive integer , the -dispersion problem is that of selecting of the given points so that the minimum inte…

cs.CG2025

Arcs with increasing chords in

Adrian Dumitrescu, Zsolt Lángi

A curve that connects and has the increasing chord property if whenever lie in that order on . For planar curves, the length of such a cur…

math.MG2025

Closed curve covering and multiagent TSP ratios

Travis Dillon, Adrian Dumitrescu

How efficiently can a closed curve of unit length in be covered by closed curves so as to minimize the maximum length of the curves? We show that the maximum…

math.CO2025

On multiplicities of interpoint distances

Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

Given a set of points and a distance , the multiplicity of is the number of times the distance appears between points in . Let $a_1(X)…

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.CR2025

TrustZero -- open, verifiable and scalable zero-trust

Adrian-Tudor Dumitrescu, Johan Pouwelse

We present a passport-level trust token for Europe. In an era of escalating cyber threats fueled by global competition in economic, military, and technological domains, traditional…