Arijit Ghosh

most cited

(1, j)

-set problem in graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

cs.CG2023

Sparse Geometric Set Systems and the Beck-Fiala Conjecture

Kunal Dutta, Arijit Ghosh

We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $…

cs.DS2022★ 2 cited

Testing of Index-Invariant Properties in the Huge Object Model

Sourav Chakraborty, Eldar Fischer, Arijit Ghosh +2

The study of distribution testing has become ubiquitous in the area of property testing, both for its theoretical appeal, as well as for its applications in other fields of Compute…

cs.DM2014★ 1 cited

$(1, j)$ -set problem in graphs

Arijit Bishnu, Kunal Dutta, Arijit Ghosh +1

A subset $D \subseteq V$ of a graph $G = (V, E)$ is a $(1, j)$ -set if every vertex $v \in V ∖ D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardin…

Sparse Geometric Set Systems and the Beck-Fiala Conjecture

Testing of Index-Invariant Properties in the Huge Object Model

(1,j)-set problem in graphs

$(1, j)$ -set problem in graphs