20 citations · 31 across the 15 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DM2013
An Existential Proof of the Conjecture on Packing Anchored Rectangles
Sandip Banerjee, Aritra Banik, Bhargab B. Bhattacharya +2
Let be a set of points, including the origin, in the unit square . We consider the problem of constructing axis-parallel and mutually disjoint rectangl…
cs.CC2013★ 1 cited
Linear kernels for k-tuple and liar's domination in bounded genus graphs
Arijit Bishnu, Arijit Ghosh, Subhabrata Paul
A set is called a -tuple dominating set of a graph if for all , where denotes the closed neighbo…
cs.CG2013★ 3 cited
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Arijit Bishnu, Subir Kumar Ghosh, Partha Pratim Goswami +2
Let be a source point and be a destination point inside an -vertex simple polygon . Euclidean shortest paths and minimum-link paths between and inside hav…