( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Half-Guarding Weakly-Visible Polygons and Terrains.

, , , , , , и . FSTTCS, том 250 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Nilgün Erikli

Anders Erikson

Magdalena Karin Matilda Eriksson

Max-Peter Eriksen

Elina Eriksson

 

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

Terrain Guarding is NP-Hard., и . SIAM J. Comput., 40 (5): 1316-1339 (2011)Opposing Half Guards., , и . CCCG, стр. 219-226. (2022)Improved Approximations for Guarding 1.5-Dimensional Terrains., , , , и . STACS, том 3 из LIPIcs, стр. 361-371. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Improved Approximations for Guarding 1.5-Dimensional Terrains., , , , и . Algorithmica, 60 (2): 451-463 (2011)Minimum k-Hop Dominating Sets in Grid Graphs., , , , и . CoRR, (2023)On Metric Clustering to Minimize the Sum of Radii., , , , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 282-293. Springer, (2008)Approximate Guarding of Monotone and Rectilinear Polygons., и . Algorithmica, 66 (3): 564-594 (2013)Guarding Polyominoes Under k-Hop Visibility., , , , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 288-302. Springer, (2024)On clustering to minimize the sum of radii., , , , и . SODA, стр. 819-825. SIAM, (2008)The VC-dimension of visibility on the boundary of monotone polygons., , и . Comput. Geom., (2019)