Differentially private algorithms allow large-scale data analytics while preserving user
privacy. Designing such algorithms for graph data is gaining importance with the growth of …

Abstract We present a $ O (1) $-approximate fully dynamic algorithm for the $ k $-median
and $ k $-means problems on metric spaces with amortized update time $\tilde O (k) $ and …

The densest subgraph problem has received significant attention, both in theory and in
practice, due to its applications in problems such as community detection, social network …

The following question arises naturally in the study of graph streaming algorithms:" Is there
any graph problem which is" not too hard", in that it can be solved efficiently with total …

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of
efficient parallel algorithms. It takes input as an array of records and a function extracting a …

Many real-world applications operate on dynamic graphs to perform important tasks. In this
article, we study batch-dynamic algorithms that are capable of updating distance labelling …

We initiate the study of graph algorithms in the streaming setting on massive distributed and
parallel systems inspired by practical data processing systems. The objective is to design …

The defining feature of many modern large-scale computer systems is the sheer amount of
data that they generate and process. Google's MapReduce clusters process over twenty …

Dynamic trees are a well-studied and fundamental building block of dynamic graph
algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81,(1981), pp. 114 …

The multilayer (ML) graph model provides a robust representation of multi-sourced
relationships among real-world entities, laying a solid foundation for reliable knowledge …