The following pages link to Adrian Dumitrescu (Q202655):
Displaying 50 items.
- Packing anchored rectangles (Q276437) (← links)
- Counting carambolas (Q293619) (← links)
- Disjoint empty disks supported by a point set (Q375386) (← links)
- On fence patrolling by mobile agents (Q405281) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Going around in circles (Q419506) (← links)
- Drawing Hamiltonian cycles with no large angles (Q426910) (← links)
- Opaque sets (Q517796) (← links)
- Constrained \(k\)-center and movement to independence (Q534356) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Sweeping points (Q548657) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- The forest hiding problem (Q633206) (← links)
- Piercing translates and homothets of a convex body (Q634671) (← links)
- Sweeping an oval to a vanishing point (Q642967) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- New bounds on the average distance from the Fermat-Weber center of a planar convex body (Q665992) (← links)
- Dispersion in disks (Q693055) (← links)
- Coloring translates and homothets of a convex body (Q695002) (← links)
- On convexification of polygons by pops (Q708422) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- On the total perimeter of homothetic convex bodies in a convex container (Q747571) (← links)
- Distinct distances in planar point sets with forbidden 4-point patterns (Q776292) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On stars and Steiner stars (Q834191) (← links)
- Covering a disk by disks (Q846757) (← links)
- On distinct distances from a vertex of a convex polygon (Q854704) (← links)
- On the geometric dilation of closed curves, graphs, and point sets (Q870424) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- Monochromatic simplices of any volume (Q965980) (← links)
- On covering problems of Rado (Q970613) (← links)
- On distinct distances and \(\lambda \)-free point sets (Q998391) (← links)
- On a covering problem for equilateral triangles (Q1010747) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- On distinct distances among points in general position and other related problems (Q1046803) (← links)
- (Q1603489) (redirect page) (← links)
- Space-time trade-offs for some ranking and searching queries (Q1603491) (← links)
- Ramsey-type results for unions of comparability graphs (Q1606025) (← links)
- Online unit clustering in higher dimensions (Q1644944) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Distinct distances and arithmetic progressions (Q1728092) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles (Q1880211) (← links)
- An approximation algorithm for cutting out convex polygons (Q1886238) (← links)
- The cost of cutting out convex \(n\)-gons (Q1887073) (← links)
