research
∙
12/07/2022
DeMEtRIS: Counting (near)-Cliques by Crawling
We study the problem of approximately counting cliques and near cliques ...
share
research
∙
04/17/2022
A New Dynamic Algorithm for Densest Subhypergraphs
Computing a dense subgraph is a fundamental problem in graph mining, wit...
research
∙
10/16/2020
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Counting homomorphisms of a constant sized pattern graph H in an input g...
research
∙
06/22/2020
Distributional Individual Fairness in Clustering
In this paper, we initiate the study of fair clustering that ensures dis...
research
∙
06/22/2020
How to Count Triangles, without Seeing the Whole Graph
Triangle counting is a fundamental problem in the analysis of large grap...
research
∙
03/29/2020
How the Degeneracy Helps for Triangle Counting in Graph Streams
We revisit the well-studied problem of triangle count estimation in grap...
research
∙
11/14/2019
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
We consider the problem of counting all k-vertex subgraphs in an input g...
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
∙
01/08/2019