In this work, we consider d-Hyperedge Estimation and d-Hyperedge Sample ...
Beame et al. [ITCS 2018] introduced and used the Bipartite Independent
S...
Using geometric techniques like projection and dimensionality reduction,...
We study a graph coloring problem that is otherwise easy but becomes qui...
In this work, we resolve the query complexity of global minimum cut prob...
A k-linear coloring of a graph G is an edge coloring of G with k
colors ...
A hypergraph H is a set system (U( H), F(H)),
where U( H) denotes the s...
Edge estimation problem in unweighted graphs using local and sometimes g...
The study of parameterized streaming complexity on graph problems was
in...
In this work, we initiate a systematic study of parameterized streaming
...
Estimating the number of triangles in a graph is one of the most fundame...
In this paper, we study the query complexity of parameterized decision a...
In this paper, we focus on lower bounds and algorithms for some basic
ge...
The grid obstacle representation of a graph G=(V,E) is an injective
func...