( en | de | ru )

 

Disambiguation of "Bhore, Sujoy"

Author of the publication

copydeleteadd this publication to your clipboard
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time.

, , , and . CoRR, (2023)

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. You can also use the button next to the name to display some publications already assigned to the person.

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

Other publications of authors with the same name

Balanced Connected Subgraph Problem in Geometric Intersection Graphs., , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 56-68. Springer, (2019)Parameterized Study of Steiner Tree on Unit Disk Graphs., , , and . SWAT, volume 162 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Balanced Connected Subgraph Problem., , , , , and . CoRR, (2018)Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set., and . CoRR, (2019)Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 80-93. Springer, (2018)Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time., , , and . CoRR, (2023)The balanced connected subgraph problem., , , , , and . Discret. Appl. Math., (2022)Planar bichromatic bottleneck spanning trees., , , and . J. Comput. Geom., 12 (1): 109-127 (2021)On Euclidean Steiner (1+ε)-Spanners., and . STACS, volume 187 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers., , , , , , and . CoRR, (2024)