default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSujoy Bhore
Sujoy Kumar Bhore
Person information
- affiliation: Indian Institute of Technology Bombay, Department of Computer Science & Engineering, Mumbai, India
- affiliation (former): Université libre de Bruxelles (ULB), Brussels, Belgium
- affiliation (former): Technische Universität Wien, Vienna, Austria
- affiliation (former, PhD 2018): Ben-Gurion University of the Negev, Department of Computer Science, Beer-Sheva, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Sujoy Bhore
, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. SIAM J. Discret. Math. 38(1): 1030-1056 (2024)- [j19]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013: 114727 (2024) - [c34]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG 2024: 19:1-19:16 - [c33]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: 8:1-8:20 - [c32]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA 2024: 4564-4579 - [i37]Sujoy Bhore, Timothy M. Chan:
Fully Dynamic Geometric Vertex Cover and Matching. CoRR abs/2402.07441 (2024) - [i36]Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese:
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR abs/2404.03981 (2024) - [i35]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 abs/2404.05045 (2024) - [i34]Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar:
Geometric Bipartite Matching is in NC. CoRR abs/2405.18833 (2024) - [i33]Sujoy Bhore, Timothy M. Chan:
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching. CoRR abs/2407.20659 (2024) - 2023
- [j18]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85(1): 133-152 (2023) - [j17]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. Algorithmica 85(12): 3816-3827 (2023) - [j16]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111: 101975 (2023) - [j15]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110: 103662 (2023) - [j14]Sujoy Bhore, Rahul Jain:
Space-efficient algorithms for reachability in directed geometric graphs. Theor. Comput. Sci. 961: 113938 (2023) - [j13]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): 19:1-19:32 (2023) - [c31]Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - [c30]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023: 18:1-18:16 - [i32]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR abs/2302.10046 (2023) - [i31]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Dynamic Euclidean Bottleneck Matching. CoRR abs/2302.10513 (2023) - [i30]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR abs/2308.00979 (2023) - [i29]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. CoRR abs/2308.15842 (2023) - [i28]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. CoRR abs/2310.14078 (2023) - 2022
- [j12]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j11]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric systems of unbiased representatives. Inf. Process. Lett. 176: 106232 (2022) - [j10]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM J. Exp. Algorithmics 27: 1.8:1-1.8:36 (2022) - [j9]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26(3): 335-352 (2022) - [j8]Sujoy Bhore, Csaba D. Tóth:
Euclidean Steiner Spanners: Light and Sparse. SIAM J. Discret. Math. 36(3): 2411-2444 (2022) - [j7]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929: 69-80 (2022) - [c29]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. ESA 2022: 18:1-18:20 - [c28]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [c27]Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
On Streaming Algorithms for Geometric Independent Set and Clique. WAOA 2022: 211-224 - [i27]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. CoRR abs/2202.09991 (2022) - [i26]Sujoy Bhore, Csaba D. Tóth:
Euclidean Steiner Spanners: Light and Sparse. CoRR abs/2206.09648 (2022) - [i25]Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
On Streaming Algorithms for Geometric Independent Set and Clique. CoRR abs/2207.01108 (2022) - [i24]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - 2021
- [j6]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12(1): 109-127 (2021) - [j5]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895: 124-136 (2021) - [c26]Sujoy Bhore, Csaba D. Tóth:
Light Euclidean Steiner Spanners in the Plane. SoCG 2021: 15:1-15:17 - [c25]Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. ESA 2021: 16:1-16:19 - [c24]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. GD 2021: 242-256 - [c23]Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg:
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. GD 2021: 304-317 - [c22]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS 2021: 256-267 - [c21]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. ISAAC 2021: 19:1-19:17 - [c20]Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. ISAAC 2021: 63:1-63:17 - [c19]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM 2021: 89-103 - [c18]Sujoy Bhore, Csaba D. Tóth:
On Euclidean Steiner (1+ε)-Spanners. STACS 2021: 13:1-13:16 - [c17]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Fair Covering and Hitting Problems. WG 2021: 39-51 - [i23]Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Geometric Graphs. CoRR abs/2101.05235 (2021) - [i22]Sujoy Bhore, Soeren Nickel, Martin Nöllenburg:
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. CoRR abs/2103.08416 (2021) - [i21]Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono:
Dynamic Schnyder Woods. CoRR abs/2106.14451 (2021) - [i20]Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. CoRR abs/2107.00684 (2021) - [i19]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR abs/2108.12327 (2021) - [i18]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. CoRR abs/2109.04368 (2021) - [i17]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. CoRR abs/2111.09766 (2021) - 2020
- [j4]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: 103157 (2020) - [j3]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020) - [j2]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24(4): 603-620 (2020) - [c16]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - [c15]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. ESA 2020: 1:1-1:16 - [c14]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA 2020: 19:1-19:24 - [c13]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. GD 2020: 40-54 - [c12]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT 2020: 13:1-13:18 - [i16]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CoRR abs/2002.05488 (2020) - [i15]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
Independent Sets of Dynamic Rectangles: Algorithms and Experiments. CoRR abs/2002.07611 (2020) - [i14]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR abs/2003.05289 (2020) - [i13]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. CoRR abs/2004.08854 (2020) - [i12]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR abs/2004.09220 (2020) - [i11]Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Dynamic Geometric Independent Set. CoRR abs/2007.08643 (2020) - [i10]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. CoRR abs/2008.08288 (2020) - [i9]Sujoy Bhore, Csaba D. Tóth:
On Euclidean Steiner (1+ε)-Spanners. CoRR abs/2010.02908 (2020) - [i8]Sujoy Bhore, Csaba D. Tóth:
Light Euclidean Steiner Spanners in the Plane. CoRR abs/2012.02216 (2020)
2010 – 2019
- 2019
- [j1]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - [c11]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c10]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CCCG 2019: 38-43 - [c9]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA 2019: 56-68 - [c8]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. GD 2019: 365-378 - [c7]Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr:
On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA 2019: 35-47 - [c6]Sandip Banerjee, Sujoy Bhore:
Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set. IWOCA 2019: 48-60 - [i7]Sandip Banerjee, Sujoy Bhore:
Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set. CoRR abs/1902.11149 (2019) - [i6]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. CoRR abs/1908.08911 (2019) - [i5]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR abs/1909.03872 (2019) - [i4]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CoRR abs/1911.08924 (2019) - 2018
- [c5]Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis:
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. LATIN 2018: 80-93 - [i3]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - 2017
- [c4]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic Plane Matchings in Bicolored Point Set. CCCG 2017: 7-12 - [c3]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck Bichromatic Full Steiner Trees. CCCG 2017: 13-18 - 2016
- [c2]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269 - [i2]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a special class of boxicity 2 graphs. CoRR abs/1603.09561 (2016) - [i1]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On local structures of cubicity 2 graphs. CoRR abs/1603.09570 (2016) - 2015
- [c1]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
