3 citations · 4 across the 12 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CG2015★ 1 cited
Approximation algorithms for the two-center problem of convex polygon
Sanjib Sadhu, Sasanka Roy, Soumen Nandi +2
Given a convex polygon with vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover . We propose an algo…
math.CO2015
On oriented cliques with respect to push operation
Julien Bensmail, Soumen Nandi, Sagnik Sen
To push a vertex of a directed graph is to change the orientations of all the arcs incident with . An oriented graph is a directed graph without any cyc…
cs.DM2015
On chromatic number of colored mixed graphs
Sandip Das, Soumen Nandi, Sagnik Sen
An -colored mixed graph is a graph with its arcs having one of the different colors and edges having one of the different colors. A homomorphism of an $(m,n)…