( en | de | ru )

 

Disambiguation of "Daescu, Ovidiu"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for fair partitioning of convex polygons.

, and . Theor. Comput. Sci., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ovidiu Avramescu

Ovidiu Pascui

Ovidiu Baicu

Ovidiu Moldovan

Ovidiu Ioan

 

Other publications of authors with the same name

Computing Optimal Trajectories for Medical Treatment Planning and Optimization., and . International Conference on Computational Science (3), volume 2331 of Lecture Notes in Computer Science, page 227-233. Springer, (2002)New Results on Path Approximation.. Algorithmica, 38 (1): 131-143 (2004)Task planning with transportation constraints: approximation bounds, implementation and experiments., , and . ICRA, page 3542-3547. IEEE, (2003)On Geometric Path Query Problems., , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 248-257. Springer, (1997)Dynamic minimum bichromatic separating circle., and . Theor. Comput. Sci., (2019)The Voronoi diagram for graphs and its application in the Sickle Cell Disease research., , , and . J. Comput. Sci., 3 (5): 335-343 (2012)k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler., and . SEA², volume 11544 of Lecture Notes in Computer Science, page 454-472. Springer, (2019)Trajectory planning for an articulated probe., , and . Comput. Geom., (2020)Two-dimensional closest pair problem: A closer look., and . Discret. Appl. Math., (2020)Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions., , , , and . SCG, page 483-484. ACM, (2006)