## About Me

I am a Postdoctoral Fellow in the Department of Computer Science at Georgetown University, hosted by Justin Thaler. Currently, I am visiting DIMACS, Rutgers University.

Last (academic) year, I was a Simons Postdoctoral Leader at DIMACS, where I primarily worked with Sepehr Assadi. Prior to that, in May 2022, I completed my PhD in Computer Science at Dartmouth College, where I was fortunate to be advised by Amit Chakrabarti. Then I spent the summer of 2022 as a Lecturer in the Department of Computer Science at Dartmouth.

Before joining Dartmouth, I spent five wonderful years at Chennai Mathematical Institute (CMI), India, where I completed my M.Sc. in Computer Science in 2017 and B.Sc. in Mathematics and Computer Science in 2015. My Master's thesis was supervised by G. Philip.

## Research Interests

My research interests lie broadly in Theoretical Computer Science, especially in graph algorithms. My dissertation work was on designing efficient graph algorithms in memory-restricted settings such as data streaming and stream verification. My thesis is titled Space-Efficient Algorithms and Verification Schemes for Graph Streams.

I have also worked on a variety of other areas over the years, and my research interests include dynamic graph algorithms, communication complexity, FPT algorithms, graph-query/sublinear-time algorithms, and combinatorial graph theory.

Here's a copy of my CV (as of September 2023).

## Research

Profiles: Google Scholar dblp

### Preprints

Low-Memory Algorithms for Online and W-Streaming Edge Coloring

Prantar Ghosh, Manuel Stoeckl

[arXiv]

### Publications

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms PODS 2023

Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl

[arXiv]A New Dynamic Algorithm for Densest Subhypergraphs TheWebConf (fka WWW) 2022

Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh

Nominated for Best Paper Award

[full version (arXiv)] [conference version] [talk] [slides]Adversarially Robust Coloring for Graph Streams ITCS 2022

Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl

[full version (arXiv)] [conference version] [talk] [slides]Oriented Bipartite Graphs and the Goldbach Graph Discrete Math., Vol. 344 (9), 2021

Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen

[full version (arXiv)] [journal version]New Verification Schemes for Frequency-Based Functions on Data Streams FSTTCS 2020

Prantar Ghosh

[full version (arXiv)] [conference version] [talk] [slides]Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches RANDOM 2020

Amit Chakrabarti, Prantar Ghosh, Justin Thaler

[full version (arXiv)] [ECCC] [conference version] [talk] [slides]

Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models ICALP 2020

Suman K. Bera, Amit Chakrabarti, Prantar Ghosh

[full version (arXiv)] [conference version] [talk] [slides]

Vertex Ordering Problems in Directed Graph Streams SODA 2020

Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, Sofya Vorotnikova

[full version (arXiv)] [conference version] [talk slides]

Streaming Verification of Graph Computations via Graph Structure RANDOM 2019

Amit Chakrabarti, Prantar Ghosh

[full version (ECCC)] [conference version] [conference slides] [talk (workshop at Simons Institute)] [workshop slides]

Relative Clique Number of Planar Signed Graphs CALDAM 2016

Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen

[conference version] [journal version in Discrete Appl. Math., Vol. 280, 2020]

### Theses and Technical Reports

Space-Efficient Algorithms and Verification Schemes for Graph Streams

Ph.D. Thesis, Dartmouth College, 2022Coloring in Graph Streams

Suman K. Bera, Prantar Ghosh

[arXiv, 2018]

FPT Algorithms Using Algebraic Techniques

Master's Thesis, Chennai Mathematical Institute, 2017

## Teaching

In Summer 2022, I was the Instructor of CS30: Discrete Mathematics in Computer Science at Dartmouth College.

I taught a class of 30 undergraduate students and gave 27 lectures (3 per week, 65 mins each) in the course.

I have served as a Teaching Assistant for the following courses at Dartmouth College.

CS31 Algorithms Spring 2021

CS30 Discrete Mathematics in Computer Science Summer 2020

CS35/135 Data Streaming Algorithms Spring 2020

CS30 Discrete Mathematics in Computer Science Winter 2020

CS31 Algorithms Spring 2019 Best TA Award

CS30 Discrete Mathematics in Computer Science Winter 2019 (Academic Year 2018-19)

Math76 Topics in Applied Mathematics Summer 2018

CS31 Algorithms Spring 2018

CS30 Discrete Mathematics in Computer Science Winter 2018

CS01 Introduction to Programming and Computation Fall 2017

I have served as a Teaching Assistant for the following courses at Chennai Mathematical Institute.

Discrete Mathematics Jan–Apr 2017

Parameterized and Exact Algorithms Aug–Nov 2016

Discrete Mathematics Jan–Apr 2016

## Other Service

I co-organized the DIMACS Workshop on Modern Techniques in Graph Algorithms in June 2023.

I have been an external reviewer for several conferences including STOC, FOCS, SODA, SOSA, ICALP, APPROX, RANDOM, ESA, and ITCS.

During my time at Dartmouth, I have been a co-organizer of the Theory Reading Group (TRG) in the CS department.