The following pages link to Saswata Shannigrahi (Q298945):
Displayed 15 items.
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- On the NP-hardness of speed scaling with sleep state (Q495994) (← links)
- New online algorithm for dynamic speed scaling with sleep state (Q500998) (← links)
- Efficient Prüfer-like coding and counting labelled hypertrees (Q1022347) (← links)
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- Data Structures for Storing Small Sets in the Bitprobe Model (Q3586392) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
- Streaming Algorithms for 2-Coloring Uniform Hypergraphs (Q5199282) (← links)
- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees (Q5459153) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
- Polychromatic colorings of plane graphs (Q5901416) (← links)
- Improved Encoding and Counting of Uniform Hypertrees (Q6293712) (← links)