| Parameterized algorithms for book embedding problems S Bhore, R Ganian, F Montecchiani, M Nöllenburg Journal of Graph Algorithms and Applications 24 (4), 603-620, 2020 | 30 | 2020 |
| Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets S Banerjee, S Bhore, R Chitnis Latin American Symposium on Theoretical Informatics, 80-93, 2018 | 15 | 2018 |
| On the upward book thickness problem: combinatorial and complexity results S Bhore, G Da Lozzo, F Montecchiani, M Nöllenburg European Journal of Combinatorics 110, 103662, 2023 | 14 | 2023 |
| Dynamic Geometric Independent Set S Bhore, J Cardinal, J Iacono, G Koumoutsos arXiv preprint arXiv:2007.08643, 2020 | 14 | 2020 |
| An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling S Bhore, G Li, M Nöllenburg ACM Journal of Experimental Algorithmics (JEA) 27, 1 - 36, 2022 | 12 | 2022 |
| The balanced connected subgraph problem for geometric intersection graphs S Bhore, S Jana, S Pandit, S Roy Theoretical Computer Science 929, 69-80, 2022 | 11 | 2022 |
| Light Euclidean Steiner Spanners in the Plane S Bhore, CD Tóth arXiv preprint arXiv:2012.02216, 2020 | 11 | 2020 |
| Parameterized Algorithms for Book Embedding Problems S Bhore, R Ganian, F Montecchiani, M Nöllenburg International Symposium on Graph Drawing and Network Visualization, 365-378, 2019 | 11 | 2019 |
| The balanced connected subgraph problem S Bhore, S Chakraborty, S Jana, JSB Mitchell, S Pandit, S Roy Discrete Applied Mathematics, 2021 | 10 | 2021 |
| On Euclidean Steiner -Spanners S Bhore, CD Tóth arXiv preprint arXiv:2010.02908, 2020 | 10 | 2020 |
| Parameterized Algorithms for Queue Layouts. S Bhore, R Ganian, F Montecchiani, M Nöllenburg Graph Drawing, 40-54, 2020 | 10 | 2020 |
| Euclidean Steiner spanners: Light and sparse S Bhore, CD Tóth SIAM Journal on Discrete Mathematics 36 (3), 2411-2444, 2022 | 9 | 2022 |
| Online spanners in metric spaces S Bhore, A Filtser, H Khodabandeh, CD Tóth SIAM Journal on Discrete Mathematics 38 (1), 1030-1056, 2024 | 8 | 2024 |
| Parameterized algorithms for queue layouts S Bhore, R Ganian, F Montecchiani, M Nöllenburg Journal of Graph Algorithms and Applications 26 (3), 335-352, 2022 | 8 | 2022 |
| Algorithm and Hardness Results on Liar¢s Dominating Set and $$\varvec {k} $$-tuple Dominating Set S Banerjee, S Bhore International Workshop on Combinatorial Algorithms, 48-60, 2019 | 8 | 2019 |
| On Fair Covering and Hitting Problems S Bandyapadhyay, A Banik, S Bhore International Workshop on Graph-Theoretic Concepts in Computer Science, 39-51, 2021 | 7 | 2021 |
| On Streaming Algorithms for Geometric Independent Set and Clique S Bhore, F Klute, JJ Oostveen Approximation and Online Algorithms: 20th International Workshop, WAOA 2022 …, 2022 | 6 | 2022 |
| Parameterized study of Steiner tree on unit disk graphs S Bhore, P Carmi, S Kolay, M Zehavi Algorithmica, 1-20, 2022 | 6 | 2022 |
| Worbel: Aggregating point labels into word clouds S Bhore, R Ganian, G Li, M Nöllenburg, J Wulms ACM Transactions on Spatial Algorithms and Systems 9 (3), 1-32, 2023 | 5 | 2023 |
| Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs S Bhore, M Löffler, S Nickel, M Nöllenburg International Symposium on Graph Drawing and Network Visualization, 304-317, 2021 | 5 | 2021 |
