( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The balanced connected subgraph problem for geometric intersection graphs.

, , , и . Theor. Comput. Sci., (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.

No persons found for author name Bhore, Sujoy
add a person with the name Bhore, Sujoy
 

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

Parameterized Study of Steiner Tree on Unit Disk Graphs., , , и . SWAT, том 162 из LIPIcs, стр. 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Euclidean Steiner (1+ε)-Spanners., и . STACS, том 187 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The balanced connected subgraph problem., , , , , и . Discret. Appl. Math., (2022)Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets., , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 80-93. Springer, (2018)Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers., , , , , , и . CoRR, (2024)Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time., , , и . SoCG, том 293 из LIPIcs, стр. 19:1-19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Balanced Connected Subgraph Problem in Geometric Intersection Graphs., , , и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 56-68. Springer, (2019)Worbel: Aggregating Point Labels into Word Clouds., , , , и . ACM Trans. Spatial Algorithms Syst., 9 (3): 19:1-19:32 (сентября 2023)Monochromatic plane matchings in bicolored point set., , и . Inf. Process. Lett., (2020)Minimum Link Fencing., , , , , и . ISAAC, том 248 из LIPIcs, стр. 34:1-34:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)