From post

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.

 

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

On d-distance m-tuple (ℓ, r)-domination in graphs., , и . Inf. Process. Lett., (2022)The Euclidean k-supplier problem in IR2., , , и . Oper. Res. Lett., 49 (1): 48-54 (2021)Minimum Spanning Tree of Line Segments., , и . COCOON, том 10976 из Lecture Notes in Computer Science, стр. 529-541. Springer, (2018)Terrain prickliness: theoretical grounds for low complexity viewsheds., , , , , , , и . CoRR, (2021)Liar's Domination in Unit Disk Graphs., , и . CoRR, (2020)Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds., , , , , , и . GIScience (II), том 208 из LIPIcs, стр. 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Euclidean k-Supplier Problem in., , , и . ALGOSENSORS, том 10050 из Lecture Notes in Computer Science, стр. 129-140. Springer, (2016)Liar's Domination in 2D., и . CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 219-229. Springer, (2017)The Maximum Distance-d Independent Set Problem on Unit Disk Graphs., , , и . FAW, том 10823 из Lecture Notes in Computer Science, стр. 68-80. Springer, (2018)Generalized Liar's Dominating Set in Graphs., , и . CoRR, (2019)