Sujoy Bhore | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/sujoy-bhore/Sujoy BhoreHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngSujoy Bhorehttps://ac.tuwien.ac.at/team/sujoy-bhore/Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Timehttps://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time-2/Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Timehttps://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/fully-dynamic-maximum-independent-sets-of-disks-in-polylogarithmic-update-time/Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractablehttps://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/On the Upward Book Thickness Problem: Combinatorial and Complexity Resultshttps://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/Untangling Circular Drawings: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity-2/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-2/An Algorithmic Study of Fully Dynamic Independent Sets for Map Labelinghttps://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling-2/Minimum Link Fencinghttps://ac.tuwien.ac.at/publication/minimum-link-fencing/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimum-link-fencing/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2/Disjoint Box Covering in a Rectilinear Polygonhttps://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/disjoint-box-covering-in-a-rectilinear-polygon/Geometric Planar Networks on Bichromatic Collinear Pointshttps://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/On the Upward Book Thickness Problem: Combinatorial and Complexity Resultshttps://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphshttps://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/unit-disk-representations-of-embedded-trees-outerplanar-and-multi-legged-graphs/Untangling Circular Drawings: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/untangling-circular-drawings-algorithms-and-complexity/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds-3/Worbel: Aggregating Point Labels into Word Cloudshttps://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/worbel-aggregating-point-labels-into-word-clouds/An Algorithmic Study of Fully Dynamic Independent Sets for Map Labelinghttps://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-algorithmic-study-of-fully-dynamic-independent-sets-for-map-labeling/Balanced Independent and Dominating Sets on Colored Interval Graphshttps://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/balanced-independent-and-dominating-sets-on-colored-interval-graphs/Geometric Planar Networks on Bichromatic Pointshttps://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/Parameterized Algorithms for Queue Layoutshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/Parameterized Algorithms for Book Embedding Problemshttps://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/