A. Dumitrescu

activity

20002026

most citedApproximation algorithms for TSP with neighborhoods in the plane

193 citations · 363 across the 59 of their papers we have counts for

collaborators

68 papers

math.MG2026

Exponential improvements in Rado's covering problem

Gian Maria Dall'Ara, Adrian Dumitrescu

Let $B^{d}$ denote the $d$ -dimensional Euclidean ball of unit radius. What is the largest constant $f (B^{d}) \in [0, 1]$ with the property that every finite collection $C$ of…

math.MG2026

Rado's covering problem for cubes and balls: a semi-survey

Gian Maria Dall'Ara, Adrian Dumitrescu

What is the largest constant $c \in [0, 1]$ with the property that every finite collection $C$ of axis-parallel squares in the plane admits a disjoint sub-collection $\math…

math.CO2025

Ordered Yao graphs: maximum degree, edge density, and clique numbers

Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2

For a positive integer $k$ and an ordered set of $n$ points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into $k$ eq…

math.CO2023

On a Traveling Salesman Problem for Points in the Unit Cube

József Balogh, Felix Christian Clemen, Adrian Dumitrescu

Let $X$ be an $n$ -element point set in the $k$ -dimensional unit cube $[0, 1]^{k}$ where $k \geq 2$ . According to an old result of Bollobás and Meir (1992), there exists a cycle (tour)…

cs.DS2023

Finding Small Complete Subgraphs Efficiently

Ke Chen, Adrian Dumitrescu, Andrzej Lingas

(I) We revisit the algorithmic problem of finding all triangles in a graph $G = (V, E)$ with $n$ vertices and $m$ edges. According to a result of Chiba and Nishizeki (1985), this task…

cs.CG2023

Observation Routes and External Watchman Routes

Adrian Dumitrescu, Csaba D. Tóth

We introduce the Observation Route Problem ( $ORP$ ) defined as follows: Given a set of $n$ pairwise disjoint compact regions in the plane, find a shortest tour (route) such…