research
∙
04/24/2023
Low-Memory Algorithms for Online and W-Streaming Edge Coloring
For edge coloring, the online and the W-streaming models seem somewhat o...
share
research
∙
12/20/2022
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
In recent years, there has been a growing interest in solving various gr...
research
∙
04/17/2022
A New Dynamic Algorithm for Densest Subhypergraphs
Computing a dense subgraph is a fundamental problem in graph mining, wit...
research
∙
09/23/2021
Adversarially Robust Coloring for Graph Streams
A streaming algorithm is considered to be adversarially robust if it pro...
research
∙
05/18/2021
Vertex Ordering Problems in Directed Graph Streams
We consider directed graph algorithms in a streaming setting, focusing o...
research
∙
10/07/2020
New Verification Schemes for Frequency-Based Functions on Data Streams
We study the general problem of computing frequency-based functions, i.e...
research
∙
07/06/2020
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
We study graph computations in an enhanced data streaming setting, where...
research
∙
05/02/2019
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
We study the problem of coloring a given graph using a small number of c...
research
∙
07/19/2018
