Sayan Bandyapadhyay

activity

20142026

most citedApproximating Dominating Set on Intersection Graphs of Rectangles and L-frames

10 citations · 33 across the 24 of their papers we have counts for

collaborators

Showing 2019 · cs.CGShow all

2 papers · 2 filters

cs.CG2019★ 4 cited

Geometric Planar Networks on Bichromatic Points

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore +1

We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. Th…

cs.CG2019★ 1 cited

Constrained Orthogonal Segment Stabbing

Sayan Bandyapadhyay, Saeed Mehrabi

Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s \in S$ \emph{stabs} a line segment $s^{'} \in D$ if $s \cap s^{'} \neq = \emptyset$ . It is known that t…