5 citations · 7 across the 33 of their papers we have counts for
6 papers · 1 filter
Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li +2
Point feature labeling is a classical problem in cartography and GIS that has been extensively studied for geospatial point data. At the same time, word clouds are a popular visual…
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani +1
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the…
Online Euclidean Spanners
Sujoy Bhore, Csaba D. Tóth
In this paper, we study the online Euclidean spanners problem for points in . Suppose we are given a sequence of points in ,…
Dynamic Schnyder Woods
Sujoy Bhore, Prosenjit Bose, Pilar Cano +2
A realizer, commonly known as Schnyder woods, of a triangulation is a partition of its interior edges into three oriented rooted trees. A flip in a realizer is a local operation th…
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Sujoy Bhore, Maarten Löffler, Soeren Nickel +1
A unit disk intersection representation (UDR) of a graph represents each vertex of as a unit disk in the plane, such that two disks intersect if and only if their vertices…
Space-Efficient Algorithms for Reachability in Geometric Graphs
Sujoy Bhore, Rahul Jain
The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distin…