Sujoy Bhore

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 87

Top Topics

Independent Set

Projective Geometry

Top Venues

Theor. Comput. Sci.

Publications

Sujoy Bhore, Timothy M. Chan
Fully Dynamic Geometric Vertex Cover and Matching. CoRR (2024)
Sujoy Bhore, Timothy M. Chan
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. CoRR (2024)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. SIAM J. Discret. Math. 38 (1) (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR (2024)
Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG (2024)
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA (2024)
Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar
Geometric Bipartite Matching is in NC. CoRR (2024)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013 (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. ICALP (2024)
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR (2024)
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
Dynamic Schnyder woods. CCCG (2023)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85 (1) (2023)
Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR (2023)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean Bottleneck Matching. CoRR (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR (2023)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111 (2023)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. ACM Trans. Spatial Algorithms Syst. 9 (3) (2023)
Sujoy Bhore, Rahul Jain
Space-efficient algorithms for reachability in directed geometric graphs. Theor. Comput. Sci. 961 (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. CoRR (2023)
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. CoRR (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. Algorithmica 85 (12) (2023)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110 (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG (2023)
Sujoy Bhore, Csaba D. Tóth
Euclidean Steiner Spanners: Light and Sparse. SIAM J. Discret. Math. 36 (3) (2022)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26 (3) (2022)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM J. Exp. Algorithmics 27 (2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. CoRR (2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. ISAAC (2022)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929 (2022)
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique. WAOA (2022)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. CoRR (2022)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric systems of unbiased representatives. Inf. Process. Lett. 176 (2022)
Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth
Online Spanners in Metric Spaces. ESA (2022)
Sujoy Bhore, Csaba D. Tóth
Euclidean Steiner Spanners: Light and Sparse. CoRR (2022)
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
On Streaming Algorithms for Geometric Independent Set and Clique. CoRR (2022)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem. Discret. Appl. Math. 319 (2022)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895 (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR (2021)
Sujoy Bhore, Csaba D. Tóth
Online Euclidean Spanners. CoRR (2021)
Sujoy Bhore, Csaba D. Tóth
Light Euclidean Steiner Spanners in the Plane. SoCG (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12 (1) (2021)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Fair Covering and Hitting Problems. WG (2021)
Sujoy Bhore, Rahul Jain
Space-Efficient Algorithms for Reachability in Geometric Graphs. CoRR (2021)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. ISAAC (2021)
Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
Dynamic Schnyder Woods. CoRR (2021)
Sujoy Bhore, Csaba D. Tóth
Online Euclidean Spanners. ESA (2021)
Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. Graph Drawing (2021)
Sujoy Bhore, Csaba D. Tóth
On Euclidean Steiner (1+ε)-Spanners. STACS (2021)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. Graph Drawing (2021)
Sujoy Bhore, Rahul Jain
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. ISAAC (2021)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. CoRR (2021)
Sujoy Bhore, Soeren Nickel, Martin Nöllenburg
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. CoRR (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. CoRR (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. ESA (2020)
Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
Dynamic Geometric Independent Set. CoRR (2020)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
Independent Sets of Dynamic Rectangles: Algorithms and Experiments. CoRR (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. CoRR (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR (2020)
Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
On Erdős-Szekeres-type problems for k-convex point sets. Eur. J. Comb. 89 (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT (2020)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric Systems of Unbiased Representatives. CoRR (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24 (4) (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. Graph Drawing (2020)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA (2020)
Sujoy Bhore, Csaba D. Tóth
On Euclidean Steiner (1+ε)-Spanners. CoRR (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. CoRR (2020)
Sujoy Bhore, Csaba D. Tóth
Light Euclidean Steiner Spanners in the Plane. CoRR (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CALDAM (2020)
Sandip Banerjee, Sujoy Bhore
Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set. CoRR (2019)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CoRR (2019)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142 (2019)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. CoRR (2019)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CALDAM (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA (2019)
Sandip Banerjee, Sujoy Bhore
Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. IWOCA (2019)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric Systems of Unbiased Representatives. CCCG (2019)
Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA (2019)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. Graph Drawing (2019)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CoRR (2018)
Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. LATIN (2018)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck Bichromatic Full Steiner Trees. CCCG (2017)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic Plane Matchings in Bicolored Point Set. CCCG (2017)