Relative Clique Number of Planar Signed Graphs. - Sandip Das 001; Prantar Ghosh; Swathyprabhu Mj; Sagnik Sen 001 (CALDAM, 2016)

Coloring in Graph Streams. - Suman Kalyan Bera; Prantar Ghosh (CoRR, 2018)

Streaming Verification of Graph Computations via Graph Structure. - Amit Chakrabarti; Prantar Ghosh (Electron. Colloquium Comput. Complex., 2019)

New Verification Schemes for Frequency-Based Functions on Data Streams. - Prantar Ghosh (FSTTCS, 2020)

Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. - Suman K. Bera 001; Amit Chakrabarti; Prantar Ghosh (ICALP, 2020)

Vertex Ordering Problems in Directed Graph Streams. - Amit Chakrabarti; Prantar Ghosh; Andrew McGregor 001; Sofya Vorotnikova (SODA, 2020)

Relative clique number of planar signed graphs. - Sandip Das 001; Prantar Ghosh; Swathy Prabhu; Sagnik Sen 001 (Discret. Appl. Math., 2020)

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. - Amit Chakrabarti; Prantar Ghosh; Justin Thaler (Electron. Colloquium Comput. Complex., 2020)

Oriented bipartite graphs and the Goldbach graph. - Sandip Das 001; Prantar Ghosh; Shamik Ghosh; Sagnik Sen 001 (Discret. Math., 2021)

Adversarially Robust Coloring for Graph Streams. - Amit Chakrabarti; Prantar Ghosh; Manuel Stoeckl (ITCS, 2022)

A New Dynamic Algorithm for Densest Subhypergraphs. - Suman K. Bera 001; Sayan Bhattacharya; Jayesh Choudhari; Prantar Ghosh (WWW, 2022)

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. - Sepehr Assadi; Amit Chakrabarti; Prantar Ghosh; Manuel Stoeckl (PODS, 2023)

Low-Memory Algorithms for Online and W-Streaming Edge Coloring. - Prantar Ghosh; Manuel Stoeckl (CoRR, 2023)

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. - Sepehr Assadi; Prantar Ghosh; Bruno Loff; Parth Mittal; Sagnik Mukhopadhyay (CCC, 2024)

New Algorithms and Lower Bounds for Streaming Tournaments. - Prantar Ghosh; Sahil Kuchlous (ESA, 2024)

Low-Memory Algorithms for Online Edge Coloring. - Prantar Ghosh; Manuel Stoeckl (ICALP, 2024)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification. - Prantar Ghosh; Vihan Shah (ITCS, 2024)