Indian Statistical Institute

works on

dnf model counting 1 klee's measure problem 1 set coverage 1 streaming algorithms 1 union size estimation 1

From the 1 of 14 papers with an AI index.

most citedEstimating Size of the Union of Sets in Streaming Model

6 citations

researchers with a paper here

Dibyayan Chakraborty2 · h 7
Harmender Gahlawat2 · h 7
Sourav Pal2 profiles2 · h 2
A. Aviles1 · h 20
A. Berera1 · h 41
Antara Dey1 · h 3
Arijit Ghosh1 · h 14
B. Chakrabarti1 · h 42
B. Das1 · h 1
Biswarup Saha1 · h 1
Bodhayan Roy1 · h 3
Chandrima Kayal1 · h 2

collaborating institutions

Ben-Gurion University of the NegevIL2 papers
Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
University of LeedsGB2 papers
Centre for Research in Astrophysics of QuébecCA1 paper
Centre National de la Recherche ScientifiqueFR1 paper
Durban University of TechnologyZA1 paper
Indian Institute of Technology KharagpurIN1 paper
Institut Polytechnique de BordeauxFR1 paper
Jamia Millia IslamiaIN1 paper
Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR1 paper
Massachusetts Institute of TechnologyUS1 paper
McGill UniversityCA1 paper

Showing cs.DMShow all

1 paper · 1 filter

cs.DM2026★ 3 cited

Algorithms and complexity for geodetic sets on planar and chordal graphs

Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy

A set $S$ of vertices of a graph $G$ is a \emph{geodetic set} if every vertex of $G$ lies in a shortest path between some pair of vertices of $S$ . The \textsc{Minimum Geodetic Set…