research
∙
04/10/2022
Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model
We consider the Maximum-weight Matching (MWM) problem in the streaming s...
share
research
∙
07/16/2021
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching
We study two-pass streaming algorithms for Maximum Bipartite Matching (M...
research
∙
05/05/2021
The Complexity of Symmetry Breaking in Massive Graphs
The goal of this paper is to understand the complexity of symmetry break...
research
∙
03/12/2021
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
We give lower bounds on the communication complexity of graph problems i...
research
∙
09/28/2020
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
Multi-pass streaming algorithm for Maximum Matching have been studied si...
research
∙
05/22/2020
Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams
In this paper, we give simple optimal lower bounds on the one-way two-pa...
research
∙
11/20/2019
Streaming Frequent Items with Timestamps and Detecting Large Neighborhoods in Graph Streams
Detecting frequent items is a fundamental problem in data streaming rese...
research
∙
07/22/2018
Independent Sets in Vertex-Arrival Streams
We consider the classic maximal and maximum independent set problems in ...
research
∙
07/03/2018
Detecting cliques in CONGEST networks
The problem of detecting network structures plays a central role in dist...
research
∙
05/11/2018
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
We give deterministic distributed (1+ϵ)-approximation algorithms for Min...
research
∙
02/21/2018
