We study the problem of graph clustering under a broad class of objectiv...
A motif is a frequently occurring subgraph of a given directed or undire...
Given a graph G that can be partitioned into k disjoint expanders with
o...
k-means++ <cit.> is a widely used clustering algorithm that is
easy to i...
The problem of characterizing testable graph properties (properties that...
We develop dynamic data structures for maintaining a hierarchical k-cent...
We present a novel framework closely linking the areas of property testi...
We study fair clustering problems as proposed by Chierichetti et al. Her...
One of the most fundamental questions in graph property testing is to
ch...
We obtain the first strong coresets for the k-median and subspace
approx...
We develop and analyze a method to reduce the size of a very large set o...
Coresets are one of the central methods to facilitate the analysis of la...
The spectrum of a network or graph G=(V,E) with adjacency matrix A,
cons...
We develop a new algorithmic technique that allows to transfer some cons...