( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Geometric Path Query Problems.

, , и . Int. J. Comput. Geom. Appl., 11 (6): 617-645 (2001)

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.

Ovidiu Avramescu

Ovidiu Pascui

Ovidiu Baicu

Ovidiu Moldovan

Ovidiu Ioan

 

Другие публикации лиц с тем же именем

Task planning with transportation constraints: approximation bounds, implementation and experiments., , и . ICRA, стр. 3542-3547. IEEE, (2003)New Results on Path Approximation.. Algorithmica, 38 (1): 131-143 (2004)Computing Optimal Trajectories for Medical Treatment Planning and Optimization., и . International Conference on Computational Science (3), том 2331 из Lecture Notes in Computer Science, стр. 227-233. Springer, (2002)Altitude terrain guarding and guarding uni-monotone polygons., , , , и . Comput. Geom., (2019)Two-dimensional closest pair problem: A closer look., и . Discret. Appl. Math., (2020)Trajectory planning for an articulated probe., , и . Comput. Geom., (2020)k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler., и . SEA², том 11544 из Lecture Notes in Computer Science, стр. 454-472. Springer, (2019)k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler., и . CoRR, (2018)On Geometric Path Query Problems., , и . WADS, том 1272 из Lecture Notes in Computer Science, стр. 248-257. Springer, (1997)Dynamic minimum bichromatic separating circle., и . Theor. Comput. Sci., (2019)