Graph clustering is a fundamental task in many data-mining and machine-learning
pipelines. In particular, identifying a good hierarchical structure is at the same time a …

There is a rapidly growing need for scalable algorithms that solve classical graph problems,
such as maximum matching and minimum vertex cover, on massive graphs. For massive …

Refactorings are behavior-preserving program transformations that automate design
evolution in object-oriented applications. Three kinds of design evolution are: schema …

In this paper we present a simple but powerful subgraph sampling primitive that is
applicable in a variety of computational models including dynamic graph streams (where the …

We study the problem of finding an approximate maximum matching in two closely related
computational models, namely, the dynamic graph streaming model and the simultaneous …

We study the problem of estimating the maximum matching size in graphs whose edges are
revealed in a streaming manner. We consider both insertion-only streams, which only …

We study the problem of computing an approximate maximum cardinality matching in the
semi-streaming model when edges arrive in a random order. In the semi-streaming model …

In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

We prove that any two-pass graph streaming algorithm for the st reachability problem in n-
vertex directed graphs requires near-quadratic space of n 2-o (1) bits. As a corollary, we also …

We prove a lower bound on the space complexity of two-pass semi-streaming algorithms
that approximate the maximum matching problem. The lower bound is parameterized by the …