Sujoy Bhore

According to our database, Sujoy Bhore authored at least 43 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Online Spanners in Metric Spaces.

Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth

SIAM J. Discret. Math., March, 2024

Fully Dynamic Geometric Vertex Cover and Matching.

Sujoy Bhore, Timothy M. Chan

CoRR, 2024

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings.

Sujoy Bhore, Arnold Filtser, Csaba D. Tóth

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

On Colorful Vertex and Edge Cover Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Algorithmica, December, 2023

Worbel: Aggregating Point Labels into Word Clouds.

Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms

ACM Trans. Spatial Algorithms Syst., September, 2023

Space-efficient algorithms for reachability in directed geometric graphs.

Sujoy Bhore, Rahul Jain

Theor. Comput. Sci., June, 2023

On the upward book thickness problem: Combinatorial and complexity results.

Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg

Eur. J. Comb., May, 2023

Untangling circular drawings: Algorithms and complexity.

Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu

Comput. Geom., April, 2023

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time.

Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms

CoRR, 2023

Dynamic Euclidean Bottleneck Matching.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

CoRR, 2023

Parameterized Study of Steiner Tree on Unit Disk Graphs.

Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi

Algorithmica, 2023

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.

Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Euclidean Steiner Spanners: Light and Sparse.

Sujoy Bhore, Csaba D. Tóth

SIAM J. Discret. Math., September, 2022

The balanced connected subgraph problem for geometric intersection graphs.

Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy

Theor. Comput. Sci., 2022

Parameterized Algorithms for Queue Layouts.

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg

J. Graph Algorithms Appl., 2022

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling.

Sujoy Bhore, Guangping Li, Martin Nöllenburg

ACM J. Exp. Algorithmics, 2022

Geometric systems of unbiased representatives.

Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval

Inf. Process. Lett., 2022

The balanced connected subgraph problem.

Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy

Discret. Appl. Math., 2022

On Streaming Algorithms for Geometric Independent Set and Clique.

Sujoy Bhore, Fabian Klute, Jelle J. Oostveen

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Minimum Link Fencing.

Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Geometric planar networks on bichromatic collinear points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Theor. Comput. Sci., 2021

Planar bichromatic bottleneck spanning trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell

J. Comput. Geom., 2021

Dynamic Schnyder Woods.

Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono

CoRR, 2021

Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs.

Sujoy Bhore, Soeren Nickel, Martin Nöllenburg

CoRR, 2021

Space-Efficient Algorithms for Reachability in Geometric Graphs.

Sujoy Bhore, Rahul Jain

CoRR, 2021

On Fair Covering and Hitting Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

On Euclidean Steiner (1+ε)-Spanners.

Sujoy Bhore, Csaba D. Tóth

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Balanced Independent and Dominating Sets on Colored Interval Graphs.

Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs.

Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Online Euclidean Spanners.

Sujoy Bhore, Csaba D. Tóth

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Light Euclidean Steiner Spanners in the Plane.

Sujoy Bhore, Csaba D. Tóth

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Parameterized Algorithms for Book Embedding Problems.

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg

J. Graph Algorithms Appl., 2020

Monochromatic plane matchings in bicolored point set.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Inf. Process. Lett., 2020

On Erdős-Szekeres-type problems for k-convex point sets.

Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr

Eur. J. Comb., 2020

Dynamic Geometric Independent Set.

Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos

CoRR, 2020

Independent Sets of Dynamic Rectangles: Algorithms and Experiments.

Sujoy Bhore, Guangping Li, Martin Nöllenburg

CoRR, 2020

Geometric Planar Networks on Bichromatic Points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Bottleneck bichromatic full Steiner trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty

Inf. Process. Lett., 2019

Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set.

Sandip Banerjee, Sujoy Bhore

CoRR, 2019

Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set.

Sandip Banerjee, Sujoy Bhore

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.

Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2016

On Local Structures of Cubicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

On a Special Class of Boxicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015