( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Base station placement on boundary of a convex polygon.

, , и . J. Parallel Distributed Comput., 68 (2): 265-273 (2008)

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.

Roy Hornig

Beschreibung mikro-rheologischer Vorgänge und resultierender Verbundstrukturen beim Elastomermischprozeß im Innenmischer durch rheologische Untersuchungen. NA Halle-Wittenberg, (2009)

Trina Roy

Roy Kühne

Alexander Roy

Smritindu Roy

 

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

Largest Empty Circle Centered on a Query Line, , и . CoRR, (2008)Rectilinear Path Problems in Restricted Memory Setup., , , , и . CALDAM, том 8959 из Lecture Notes in Computer Science, стр. 69-80. Springer, (2015)Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon., , , , и . ICCSA (2), том 10405 из Lecture Notes in Computer Science, стр. 509-524. Springer, (2017)Near optimal algorithm for the shortest descending path on the surface of a convex terrain.. J. Discrete Algorithms, (2012)Optimal Algorithm for a Special Point-Labeling Problem., , , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 110-120. Springer, (2002)In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs., , и . FAW-AAIM, том 7285 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2012)Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares., , , и . Theor. Comput. Sci., (2019)Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment., , и . CCCG, стр. 273-276. Carleton University, Ottawa, Canada, (2007)Smallest enclosing circle centered on a query line segment., , и . CCCG, (2008)Covering Points with Pairs of Concentric Disks., , , и . CCCG, стр. 33-38. (2020)