( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Covering Points by Disjoint Boxes with Outliers

, , , , , , , и . CoRR, (2009)

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.

Sang-Won Bae

Jun-Sang Bae

Sang-Won Kim

Sang Bin Bae

Sang Won Park

 

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

Maximum-Width Empty Square and Rectangular Annulus., , и . CoRR, (2018)Covering points with convex sets of minimum size., , , , и . Theor. Comput. Sci., (2018)All Farthest Neighbors in the Presence of Highways and Obstacles., , и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 71-82. Springer, (2009)Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions., , , , , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 303-317. Springer, (2024)Revolutionizing Mental Health Support: An Innovative Affective Mobile Framework for Dynamic, Proactive, and Context-Adaptive Conversational Agents., и . CoRR, (2024)Computing a Geodesic Two-Center of Points in a Simple Polygon., , и . LATIN, том 9644 из Lecture Notes in Computer Science, стр. 646-658. Springer, (2016)Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons., , и . LATIN, том 9644 из Lecture Notes in Computer Science, стр. 110-122. Springer, (2016)Theta-3 is connected., , , , , , , и . CCCG, Carleton University, Ottawa, Canada, (2013)Rearranging a Sequence of Points onto a Line., , , , , и . CCCG, стр. 36-46. (2021)Exact Algorithms for the Bottleneck Steiner Tree Problem., , , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 24-33. Springer, (2009)