research
∙
11/07/2022
Query Complexity of the Metric Steiner Tree Problem
We study the query complexity of the metric Steiner Tree problem, where ...
share
research
∙
09/16/2022
On Weighted Graph Sparsification by Linear Sketching
A seminal work of [Ahn-Guha-McGregor, PODS'12] showed that one can compu...
research
∙
07/19/2022
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
We present a new approach for finding matchings in dense graphs by build...
research
∙
11/19/2018
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
In the subgraph counting problem, we are given a input graph G(V, E) and...
research
∙
10/31/2018
