Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. - Sepehr Assadi; Pankaj Kumar; Parth Mittal (STOC, 2022)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. - Sepehr Assadi; Pankaj Kumar; Parth Mittal (TheoretiCS, 2023)

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

(Δ+1) Vertex Coloring in O(n) Communication. - Maxime Flin; Parth Mittal (PODC, 2024)

(Δ + 1) vertex coloring in O(n) communication. - Maxime Flin; Parth Mittal (Distributed Comput., 2025)