- Distinct triangle areas in a planar point set Adrian Dumitrescu # Csaba D. Toth +
- On the largest empty axis-parallel box amidst n points Adrian Dumitrescu
- Motion planning and reconfiguration for systems of multiple objects
- Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
- Reconfigurations in graphs and grids Gruia Calinescu
- Minimum weight convex Steiner partitions Adrian Dumitrescu
- Monochromatic simplices of any volume Adrian Dumitrescu
- Sweeping points Adrian Dumitrescu
- The forest hiding problem Adrian Dumitrescu
- Approximate Euclidean Ramsey theorems Adrian Dumitrescu
- Drawing Hamiltonian cycles with no large angles Adrian Dumitrescu
- Minimum clique partition in unit disk graphs Adrian Dumitrescu
- A note on blocking visibility between points Adrian Dumitrescu
- On convexification of polygons by pops Adrian Dumitrescu
- Opaque sets Adrian Dumitrescu
- Coloring translates and homothets of a convex body Adrian Dumitrescu
- Sweeping an oval to a vanishing point Adrian Dumitrescu
- Mover problems Adrian Dumitrescu
- Enumerating Triangulation Paths ? Adrian Dumitrescu a , Bernd Gartner b , Samuele Pedroni b , and
- On the Fr echet distance of a set of curves Adrian Dumitrescu y Gunter Rote z
- multiplicity configurations
- Planar sets with few empty convex polygons Adrian Dumitrescu
- Bounds on the maximum multiplicity of some common geometric graphs
- Extreme distances in multicolored point sets Adrian Dumitrescu yz Sumanta Guha x
- Approximation algorithms for TSP with neighborhoods in the plane
- Constrained k-center and movement to independence Adrian Dumitrescu
- On the Geometric Dilation of Closed Curves, Graphs, and Point Sets #
- On distinct distances from a vertex of a convex polygon
- On stars and Steiner stars Adrian Dumitrescu
- Vision-based pursuit-evasion in a grid Adrian Dumitrescu
- On a query algorithm for a divisibility problem Adrian Dumitrescu # Guangwu Xu +
- On distinct distances and #free point sets Adrian Dumitrescu #
- Analysis of two sweepline algorithms for constructing spanning trees and Steiner trees 1
- Monotone paths in line arrangements with a small number of directions
- On a covering problem for equilateral triangles Adrian Dumitrescu # Minghui Jiang +
- Motion Planning for Metamorphic Systems: Feasibility, Decidability and Distributed
- Formations for Fast Locomotion of Metamorphic Robotic Systems
- On distinct distances among points in general position and other related problems
- On some monotone path problems in line arrangements Adrian Dumitrescu
- Pushing squares around Adrian Dumitrescu Janos Pach y
- On the chromatic number of some geometric type Kneser graphs
- Piercing translates and homothets of a convex body Adrian Dumitrescu
- On two representation problems with infinite multiplicity Adrian Dumitrescu # Guangwu Xu +
- International Journal of Computational Geometry & Applications World Scienti c Publishing Company
- On reconfiguration of disks in the plane and related problems Adrian Dumitrescu
- Minimum-perimeter intersecting polygons Adrian Dumitrescu
- Light Orthogonal Networks with Constant Geometric Dilation # Adrian Dumitrescu +# Csaba D. Toth
- Space-time trade-o s for some ranking and searching queries Adrian Dumitrescu
- On the number of tetrahedra with minimum, unit, and distinct volumes in threespace #
- Watchman tours for polygons with holes Adrian Dumitrescu
- Extremal problems on triangle areas in two and three dimensions Adrian Dumitrescu
- The cost of cutting out convex n-gons Adrian Dumitrescu
- Long non-crossing configurations in the plane Adrian Dumitrescu
- On stars and Steiner stars. II Adrian Dumitrescu
- New bounds on the average distance from the Fermat-Weber center of a planar convex body
- Traversing a set of points with a minimum number of turns Sergey Bereg
- On covering problems of Rado Sergey Bereg
- Compatible Geometric Matchings$ Oswin Aichholzera,1
- Dispersion in disks Adrian Dumitrescu
- Metric inequalities for polygons Adrian Dumitrescu
- On stars and Steiner stars Adrian Dumitrescu # Csaba D. Toth +
- Binary Space Partitions for AxisParallel Segments, Rectangles, and Hyperrectangles
- Covering a disk by disks Adrian Dumitrescu
- An approximation algorithm for cutting out convex polygons Adrian Dumitrescu y
- October 9, 2006 18:14 WSPC/Guidelines c International Journal of Computational Geometry & Applications
- The carpenter's ruler folding problem Gruia Calinescu Adrian Dumitrescu y
- On two lower bound constructions Adrian Dumitrescu
- Ramsey-type results for unions of comparability graphs Adrian Dumitrescu
- Ecient Algorithms for Generation of Combinatorial Covering Suites
- The lifting model for reconfiguration Sergey Bereg Adrian Dumitrescu y
- On a coloring problem for the integer grid Adrian Dumitrescu Rado s Radoi ci c y
- Matching colored points in the plane : some new results Adrian Dumitrescu
- On a matching problem in the plane Adrian Dumitrescu
- THE MAXIMUM NUMBER OF EMPTY CONGRUENT TRIANGLES
- March 5, 2008 6:16 WSPC/Guidelines a International Journal of Computational Geometry & Applications
- Animal Testing Adrian Dumitrescu1
- Packing anchored rectangles Adrian Dumitrescu Csaba D. Toth
- Minimum Convex Partitions and Maximum Empty Polytopes Adrian Dumitrescu
- Disjoint empty disks supported by a point set Adrian Dumitrescu
- Going Around in Circles Adrian Dumitrescu
