Bhore, Sujoy

Recent Publications

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Bhore, Sujoy, Martin Nöllenburg, Tóth, Csaba D., Wulms, Jules
Discrete and Computational Geometry, volume 75, pages 391-430, 2026.
Cite DOI
Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
Bhore, Sujoy, Robert Ganian, Liana Khazaliya, Montecchiani, Fabrizio, Martin Nöllenburg
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
Cite Project DOI
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Bhore, Sujoy, Martin Nöllenburg, Tóth, Csaba D., Wulms, Jules
Computational Geometry (SoCG'24) (Mulzer, Wolfgang and Phillips, Jeff M.), volume 293 of LIPIcs, pages 19:1-19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite DOI
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Bhore, Sujoy, Robert Ganian, Liana Khazaliya, Montecchiani, Fabrizio, Martin Nöllenburg
Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Martin Nöllenburg
European J. Combinatorics, volume 110, pages 103662, 2023.
Cite DOI
Untangling Circular Drawings: Algorithms and Complexity
Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Rutter, Ignaz, Wu, Hsiang-Yun
Comput. Geom. Theory Appl., volume 111, 2023.
Cite Project DOI
Worbel: Aggregating Point Labels into Word Clouds
Bhore, Sujoy, Robert Ganian, Li, Guangping, Martin Nöllenburg, Wulms, Jules
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1-19:32, 2023.
Cite Project DOI
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Bhore, Sujoy, Li, Guangping, Martin Nöllenburg
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1-1.8:36, 2022.
Cite Project DOI
Minimum Link Fencing
Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Martin Nöllenburg, Terziadis, Soeren, Villedieu, Anaïs
Algorithms and Computation (ISAAC'22) (Bae, Sang Won and Park, Heejin), volume 248 of LIPIcs, pages 34:1-34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI
Parameterized Algorithms for Queue Layouts
Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
Cite Project DOI
Balanced Independent and Dominating Sets on Colored Interval Graphs
Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Martin Nöllenburg
Theory and Practice of Computer Science (SOFSEM'21) (Bureš, Tomáš and Dondi, Riccardo and Gamper, Johann and Guerrini, Giovanna and Jurdziński, Tomasz and Pahl, Claus and Sikora, Florian and Wong, Prudence), volume 12607 of LNCS, pages 89-103, 2021, Springer.
Cite Project DOI
Disjoint Box Covering in a Rectilinear Polygon
Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Wulms, Jules
European Workshop on Computational Geometry (EuroCG'21), pages 71:1-71:7, 2021.
PDF Cite Project
Geometric Planar Networks on Bichromatic Collinear Points
Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg
Theoretical Computer Science, volume 895, pages 124-136, 2021.
Cite Project DOI
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 242-256, 2021, Springer.
PDF Cite DOI
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Bhore, Sujoy, Löffler, Maarten, Nickel, Soeren, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 304-317, 2021, Springer.
PDF Cite DOI
Untangling Circular Drawings: Algorithms and Complexity
Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Rutter, Ignaz, Wu, Hsiang-Yun
Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), volume 212 of LIPIcs, pages 19:1-19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI
Worbel: Aggregating Point Labels into Word Clouds
Bhore, Sujoy, Robert Ganian, Li, Guangping, Martin Nöllenburg, Wulms, Jules
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256-267, 2021, ACM.
PDF Cite Project DOI
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Bhore, Sujoy, Li, Guangping, Martin Nöllenburg
Algorithms (ESA'20) (Grandoni, Fabrizio and Sanders, Peter and Herman, Grzegorz), volume 173 of LIPIcs, pages 19:1-19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
PDF Cite Project DOI
Balanced Independent and Dominating Sets on Colored Interval Graphs
Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'20), pages 66:1-66:6, 2020.
PDF Cite
Geometric Planar Networks on Bichromatic Points
Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Changat, Manoj and Das, Sandip), volume 12016 of LNCS, pages 79-91, 2020, Springer.
PDF Cite Project DOI
Parameterized Algorithms for Book Embedding Problems
Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg
J. Graph Algorithms Appl., volume 24, number 4, pages 603-620, 2020.
Cite Project Project DOI
Parameterized Algorithms for Queue Layouts
Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 40-54, 2020, Springer.
PDF Cite Project DOI
Parameterized Algorithms for Book Embedding Problems
Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 365-378, 2019, Springer.
PDF Cite Project DOI