From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Generalized Liar's Dominating Set in Graphs.

S. Jena, R. Jallu, и G. Das. CoRR, (2019)

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.

Total Domination in Unit Disk Graphs.S. Jena, и G. Das. CoRR, (2020)Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs.S. Jena, и K. Subramani. TAMC, том 13571 из Lecture Notes in Computer Science, стр. 103-115. Springer, (2022)Generalized Liar's Dominating Set in Graphs.S. Jena, R. Jallu, и G. Das. CoRR, (2019)Differentiable Discrete Optimization Using Dataless Neural Networks.S. Jena, K. Subramani, и A. Velasquez. COCOA (2), том 14462 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2023)Vertex-Edge Domination in Unit Disk Graphs.S. Jena, и G. Das. CALDAM, том 12016 из Lecture Notes in Computer Science, стр. 67-78. Springer, (2020)Liar's Domination in Unit Disk Graphs.R. Jallu, S. Jena, и G. Das. CoRR, (2020)The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.S. Jena, R. Jallu, G. Das, и S. Nandy. FAW, том 10823 из Lecture Notes in Computer Science, стр. 68-80. Springer, (2018)On d-distance m-tuple (ℓ, r)-domination in graphs.S. Jena, R. Jallu, и G. Das. Inf. Process. Lett., (2022)Capacitated discrete unit disk cover.P. Mishra, S. Jena, G. Das, и S. Rao. Discret. Appl. Math., (2020)Capacitated Discrete Unit Disk Cover.P. Mishra, S. Jena, G. Das, и S. Rao. WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 407-418. Springer, (2019)