Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- HUN-REN Alfréd Rényi Institute of MathematicsHU3 papers
- Karlsruhe Institute of TechnologyDE3 papers
- Indraprastha Institute of Information Technology DelhiIN2 papers
- University of BucharestRO2 papers
- University of California San DiegoUS2 papers
- California State University, NorthridgeUS1 paper
- Charles UniversityCZ1 paper
- Tufts UniversityUS1 paper
4 papers
Ordered Yao graphs: maximum degree, edge density, and clique numbers
Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev +2
For a positive integer and an ordered set of points in the plane, define its \textit{k-sector ordered Yao graphs} as follows. Divide the plane around each point into eq…
A Stopping Game on Zero-Sum Sequences
Adrian Dumitrescu, Arsenii Sagdeev
We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation of a multiset of reals…
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…
Observation Routes and External Watchman Routes
Adrian Dumitrescu, Csaba D. Tóth
We introduce the Observation Route Problem () defined as follows: Given a set of pairwise disjoint compact regions in the plane, find a shortest tour (route) such…