On a Special Class of Boxicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (CALDAM, 2015)

On Local Structures of Cubicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (COCOA, 2016)

Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. - Sandip Banerjee; Sujoy Bhore; Rajesh Chitnis (LATIN, 2018)

Algorithm and Hardness Results on Liar's Dominating Set and varveck -tuple Dominating Set. - Sandip Banerjee; Sujoy Bhore (IWOCA, 2019)

Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set. - Sandip Banerjee; Sujoy Bhore (CoRR, 2019)

Bottleneck bichromatic full Steiner trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Dibyayan Chakraborty (Inf. Process. Lett., 2019)

Geometric Planar Networks on Bichromatic Points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (CALDAM, 2020)

Independent Sets of Dynamic Rectangles: Algorithms and Experiments. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg (CoRR, 2020)

Dynamic Geometric Independent Set. - Sujoy Bhore; Jean Cardinal; John Iacono; Grigorios Koumoutsos (CoRR, 2020)

On Erdős-Szekeres-type problems for k-convex point sets. - Martin Balko; Sujoy Bhore; Leonardo Martínez-Sandoval; Pavel Valtr 001 (Eur. J. Comb., 2020)

Monochromatic plane matchings in bicolored point set. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Inf. Process. Lett., 2020)

Parameterized Algorithms for Book Embedding Problems. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2020)

Light Euclidean Steiner Spanners in the Plane. - Sujoy Bhore; Csaba D. Tóth (SoCG, 2021)

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. - Sujoy Bhore; Maarten Löffler; Soeren Nickel; Martin Nöllenburg (GD, 2021)

Balanced Independent and Dominating Sets on Colored Interval Graphs. - Sujoy Bhore; Jan-Henrik Haunert; Fabian Klute; Guangping Li 001; Martin Nöllenburg (SOFSEM, 2021)

On Euclidean Steiner (1+ε)-Spanners. - Sujoy Bhore; Csaba D. Tóth (STACS, 2021)

On Fair Covering and Hitting Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (WG, 2021)

Space-Efficient Algorithms for Reachability in Geometric Graphs. - Sujoy Bhore; Rahul Jain 015 (CoRR, 2021)

Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. - Sujoy Bhore; Soeren Nickel; Martin Nöllenburg (CoRR, 2021)

Planar bichromatic bottleneck spanning trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Joseph S. B. Mitchell (J. Comput. Geom., 2021)

Geometric planar networks on bichromatic collinear points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (Theor. Comput. Sci., 2021)

Minimum Link Fencing. - Sujoy Bhore; Fabian Klute; Maarten Löffler; Martin Nöllenburg; Soeren Terziadis; Anaïs Villedieu (ISAAC, 2022)

On Streaming Algorithms for Geometric Independent Set and Clique. - Sujoy Bhore; Fabian Klute; Jelle J. Oostveen (WAOA, 2022)

The balanced connected subgraph problem. - Sujoy Bhore; Sourav Chakraborty 001; Satyabrata Jana; Joseph S. B. Mitchell; Supantha Pandit; Sasanka Roy (Discret. Appl. Math., 2022)

Geometric systems of unbiased representatives. - Aritra Banik; Bhaswar B. Bhattacharya; Sujoy Bhore; Leonardo Martínez-Sandoval (Inf. Process. Lett., 2022)

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg (ACM J. Exp. Algorithmics, 2022)

Parameterized Algorithms for Queue Layouts. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2022)

The balanced connected subgraph problem for geometric intersection graphs. - Sujoy Bhore; Satyabrata Jana; Supantha Pandit; Sasanka Roy (Theor. Comput. Sci., 2022)

Euclidean Steiner Spanners: Light and Sparse. - Sujoy Bhore; Csaba D. Tóth (SIAM J. Discret. Math., 2022)

Dynamic Schnyder woods. - Pilar Cano; Sujoy Bhore; Prosenjit Bose; Jean Cardinal; John Iacono (CCCG, 2023)

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. - Sujoy Bhore; Robert Ganian; Liana Khazaliya; Fabrizio Montecchiani; Martin Nöllenburg (SoCG, 2023)

Parameterized Study of Steiner Tree on Unit Disk Graphs. - Sujoy Bhore; Paz Carmi; Sudeshna Kolay; Meirav Zehavi (Algorithmica, 2023)

Untangling circular drawings: Algorithms and complexity. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg; Ignaz Rutter; Hsiang-Yun Wu (Comput. Geom., 2023)

On the upward book thickness problem: Combinatorial and complexity results. - Sujoy Bhore; Giordano Da Lozzo; Fabrizio Montecchiani; Martin Nöllenburg (Eur. J. Comb., 2023)

Space-efficient algorithms for reachability in directed geometric graphs. - Sujoy Bhore; Rahul Jain 015 (Theor. Comput. Sci., 2023)

Worbel: Aggregating Point Labels into Word Clouds. - Sujoy Bhore; Robert Ganian; Guangping Li 001; Martin Nöllenburg; Jules Wulms (ACM Trans. Spatial Algorithms Syst., 2023)

On Colorful Vertex and Edge Cover Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (Algorithmica, 2023)

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. - Sujoy Bhore; Martin Nöllenburg; Csaba D. Tóth; Jules Wulms (SoCG, 2024)

Parallel Complexity of Geometric Bipartite Matching. - Sujoy Bhore; Sarfaraz Equbal; Rohit Gurjar (FSTTCS, 2024)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. - Pritam Acharya; Sujoy Bhore; Aaryan Gupta; Arindam Khan 001; Bratin Mondal; Andreas Wiese (ICALP, 2024)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. - Sujoy Bhore; Arnold Filtser; Csaba D. Tóth (SODA, 2024)

Fully Dynamic Geometric Vertex Cover and Matching. - Sujoy Bhore; Timothy M. Chan (CoRR, 2024)

Geometric Bipartite Matching is in NC. - Sujoy Bhore; Sarfaraz Equbal; Rohit Gurjar (CoRR, 2024)

Online Epsilon Net and Piercing Set for Geometric Concepts. - Sujoy Bhore; Devdan Dey; Satyam Singh 001 (CoRR, 2024)

Dynamic Euclidean bottleneck matching. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Theor. Comput. Sci., 2024)

Online Spanners in Metric Spaces. - Sujoy Bhore; Arnold Filtser; Hadi Khodabandeh; Csaba D. Tóth (SIAM J. Discret. Math., 2024)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. - Sujoy Bhore; Timothy M. Chan; Zhengcheng Huang; Shakhar Smorodinsky; Csaba D. Tóth (SoCG, 2025)

Light Spanners with Small Hop-Diameter. - Sujoy Bhore; Lazar Milenkovic (ICALP, 2025)

Online epsilon Net & Piercing Set for Geometric Concepts. - Sujoy Bhore; Devdan Dey; Satyam Singh 001 (ICLR, 2025)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. - Sujoy Bhore; Timothy M. Chan (SODA, 2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. - Sujoy Bhore; Balázs Keszegh; Andrey Kupavskii; Hung Le 001; Alexandre Louvet; Dömötör Pálvölgyi; Csaba D. Tóth (SODA, 2025)

Dynamic Independent Set of Disks (and Hypercubes) Made Easier. - Sujoy Bhore; Timothy M. Chan (SOSA, 2025)

Online Euclidean Spanners. - Sujoy Bhore; Csaba D. Tóth (ACM Trans. Algorithms, 2025)

Limiting Disease Spreading in Human Networks. - Gargi Bakshi; Sujoy Bhore; Suraj Shetiya (CoRR, 2025)

Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means. - Sujoy Bhore; Ameet Gadekar; Tanmay Inamdar 002 (CoRR, 2025)