activity
20052023
most citedOn the stretch factor of the Theta-4 graph

8 citations · 31 across the 23 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

cs.CG2018

Gathering by Repulsion

Prosenjit Bose, Thomas Shermer

We consider a repulsion actuator located in an -sided convex environment full of point particles. When the actuator is activated, all the particles move away from the actuator.…

cs.CG2018

Pole Dancing: 3D Morphs for Tree Drawings

Elena Arseneva, Prosenjit Bose, Pilar Cano +5

We study the question whether a crossing-free 3D morph between two straight-line drawings of an -vertex tree can be constructed consisting of a small number of linear morphing s…

cs.CG2018

Improved Bounds for Guarding Plane Graphs with Edges

Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1

An "edge guard set" of a plane graph is a subset of edges of such that each face of is incident to an endpoint of an edge in . Such a set is said to guard . W…

cs.CG2018

Boundary Labeling for Rectangular Diagrams

Prosenjit Bose, Paz Carmi, J. Mark Keil +2

Given a set of points (sites) inside a rectangle and points (label locations or ports) on its boundary, a boundary labeling problem seeks ways of connecting every site…

cs.CG2018

Geodesic Obstacle Representation of Graphs

Prosenjit Bose, Paz Carmi, Vida Dujmovic +4

An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-li…

cs.CG2018

Routing on the Visibility Graph

Prosenjit Bose, Matias Korman, André van Renssen +1

We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let be a set o…