Saswata Shannigrahi

activity

20152019

collaborators

7 papers

math.CO2019

On the Simple Quasi Crossing Number of $K_{11}$

Arjun Pitchanathan, Saswata Shannigrahi

We show that the simple quasi crossing number of $K_{11}$ is $4$ .

math.CO2018

$k$ -Sets and Rectilinear Crossings in Complete Uniform Hypergraphs

Rahul Gangopadhyay, Saswata Shannigrahi

In this paper, we study the $d$ -dimensional rectilinear drawings of the complete $d$ -uniform hypergraph $K_{2 d}^{d}$ . Anshu et al. [Computational Geometry: Theory and Applications, 2…

math.CO2017

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 $d$ -partite $d$ -uniform hypergraph with all its $n d$ vertices represented as points in general position in $\mathbb{R}^…

math.CO2017

Improved Encoding and Counting of Uniform Hypertrees

Arjun Pitchanathan, Saswata Shannigrahi

We consider labeled $r$ -uniform hypertrees having $n \geq r \geq 2$ vertices. The number of hyperedges in such a hypertree is $m = (n - 1) / (r - 1)$ . We show that there are exactly $f…

math.CO2016

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-…

cs.DS2015

Hypergraph Two-Coloring in the Streaming Model

Jaikumar Radhakrishnan, Saswata Shannigrahi, Rakesh Venkat

We consider space-efficient algorithms for two-coloring $n$ -uniform hypergraphs $H = (V, E)$ in the streaming model, when the hyperedges arrive one at a time. It is known that any suc…