
Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries?
Beame et al. [ITCS 2018] introduced and used the Bipartite Independent S...
read it

Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube
Using geometric techniques like projection and dimensionality reduction,...
read it

Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming!
We study a graph coloring problem that is otherwise easy but becomes qui...
read it

Query Complexity of Global Minimum Cut
In this work, we resolve the query complexity of global minimum cut prob...
read it

The linear arboricity conjecture for 3degenerate graphs
A klinear coloring of a graph G is an edge coloring of G with k colors ...
read it

Hyperedge Estimation using Polylogarithmic Subset Queries
A hypergraph H is a set system (U( H), F(H)), where U( H) denotes the s...
read it

Inner Product Oracle can Estimate and Sample
Edge estimation problem in unweighted graphs using local and sometimes g...
read it

Structural Parameterization for Graph Deletion Problems over Data Streams
The study of parameterized streaming complexity on graph problems was in...
read it

FixedParameter Tractability of Graph Deletion Problems over Data Streams
In this work, we initiate a systematic study of parameterized streaming ...
read it

Triangle Estimation using Polylogarithmic Queries
Estimating the number of triangles in a graph is one of the most fundame...
read it

Parameterized Query Complexity of Hitting Set using Stability of Sunflowers
In this paper, we study the query complexity of parameterized decision a...
read it

On the streaming complexity of fundamental geometric problems
In this paper, we focus on lower bounds and algorithms for some basic ge...
read it

Grid obstacle representation of graphs
The grid obstacle representation of a graph G=(V,E) is an injective func...
read it
Arijit Bishnu
is this you? claim profile