| No. |
Title |
Author |
Year |
| 1 |
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable |
Bhore, Sujoy et al. |
2023 |
| 2 |
Minimum Link Fencing |
Bhore, Sujoy et al. |
2022 |
| 3 |
Online Spanners in Metric Spaces |
Bhore, Sujoy et al. |
2022 |
| 4 |
Light Euclidean Steiner Spanners in the Plane |
Bhore, Sujoy et al. |
2021 |
| 5 |
On Euclidean Steiner (1+ε)-Spanners |
Bhore, Sujoy et al. |
2021 |
| 6 |
Online Euclidean Spanners |
Bhore, Sujoy et al. |
2021 |
| 7 |
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs |
Bhore, Sujoy et al. |
2021 |
| 8 |
Untangling Circular Drawings: Algorithms and Complexity |
Bhore, Sujoy et al. |
2021 |
| 9 |
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling |
Bhore, Sujoy et al. |
2020 |
| 10 |
Parameterized Study of Steiner Tree on Unit Disk Graphs |
Bhore, Sujoy et al. |
2020 |
| 11 |
Planar Bichromatic Bottleneck Spanning Trees |
Abu-Affash, A. Karim et al. |
2020 |
