8 citations · 38 across the 13 of their papers we have counts for
5 papers · 1 filter
A new hierarchical clustering algorithm to identify non-overlapping like-minded communities
Talasila Sai Deepak, Hindol Adhya, Shyamal Kejriwal +2
A network has a non-overlapping community structure if the nodes of the network can be partitioned into disjoint sets such that each node in a set is densely connected to other nod…
A Lower Bound on the Crossing Number of Uniform Hypergraphs
Anurag Anshu, Saswata Shannigrahi
In this paper, we consider the embedding of a complete -uniform geometric hypergraph with vertices in general position in , where each hyperedge is represented…
On the construction of non-2-colorable uniform hypergraphs
Jithin Mathews, Manas Kumar Panda, Saswata Shannigrahi
The problem of 2-coloring uniform hypergraphs has been extensively studied over the last few decades. An n-uniform hypergraph is not 2-colorable if its vertices can't be colored wi…
NP-Hardness of Speed Scaling with a Sleep State
Gunjan Kumar, Saswata Shannigrahi
A modern processor can dynamically set it's speed while it's active, and can make a transition to sleep state when required. When the processor is operating at a speed , the ene…
New Online Algorithm for Dynamic Speed Scaling with Sleep State
Gunjan Kumar, Saswata Shannigrahi
In this paper, we consider an energy-efficient scheduling problem where jobs need to be executed such that the total energy usage of these jobs is minimize…