8 citations · 38 across the 13 of their papers we have counts for
13 papers
On the Simple Quasi Crossing Number of
Arjun Pitchanathan, Saswata Shannigrahi
We show that the simple quasi crossing number of is .
-Sets and Rectilinear Crossings in Complete Uniform Hypergraphs
Rahul Gangopadhyay, Saswata Shannigrahi
In this paper, we study the -dimensional rectilinear drawings of the complete -uniform hypergraph . Anshu et al. [Computational Geometry: Theory and Applications, 2…
Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs
Rahul Gangopadhyay, Saswata Shannigrahi
In this paper, we study the embedding of a complete balanced -partite -uniform hypergraph with all its vertices represented as points in general position in $\mathbb{R}^…
Improved Encoding and Counting of Uniform Hypertrees
Arjun Pitchanathan, Saswata Shannigrahi
We consider labeled -uniform hypertrees having vertices. The number of hyperedges in such a hypertree is . We show that there are exactly $f…
Improved Bounds for Uniform Hypergraphs without Property B
Sachin Aglave, V. A. Amarnath, Saswata Shannigrahi +1
A hypergraph is said to be properly 2-colorable if there exists a 2-coloring of its vertices such that no hyperedge is monochromatic. On the other hand, a hypergraph is called non-…
Hypergraph Two-Coloring in the Streaming Model
Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat
We consider space-efficient algorithms for two-coloring -uniform hypergraphs in the streaming model, when the hyperedges arrive one at a time. It is known that any suc…
On the Rectilinear Crossing Number of Complete Uniform Hypergraphs
Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi +1
In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedge…
On the Rise and Fall of Online Social Networks
Arnab Basu, Saswata Shannigrahi, Simrat Singh Chhabra +1
The rise and fall of online social networks recently generated an enormous amount of interest among people, both inside and outside of academia. Gillette [Businessweek magazine, 20…
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…