3 citations · 8 across the 15 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2018★ 3 cited
On the streaming complexity of fundamental geometric problems
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra +1
In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into…
cs.CG2018
FPT algorithms for embedding into low complexity graphic metrics
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
The Metric Embedding problem takes as input two metric spaces and , and a positive integer . The objective is to determine whether there is an embedding $F:X…
cs.CG2017
Grid Obstacle Representation of Graphs
Arijit Bishnu, Arijit Ghosh, Rogers Mathew +2
The grid obstacle representation, or alternately, -obstacle representation of a graph is an injective function and a set of point o…