We consider the classic facility location problem in fully dynamic data
...
Motivated by a real-world vehicle routing application, we consider the
m...
Correlation clustering is a central problem in unsupervised learning, wi...
We present a dynamic algorithm for maintaining the connected and
2-edge-...
We consider the numerical taxonomy problem of fitting a positive distanc...
Correlation clustering is a central topic in unsupervised learning, with...
We present a set of new instances of the maximum weight independent set
...
In this paper we present an efficient reachability oracle under single-e...
Let G=(V,E) be an n-vertex directed acyclic graph (DAG). A lowest common...
The Massive Parallel Computing (MPC) model gained popularity during the ...
In this paper we study the dynamic versions of two basic graph problems:...
Given a directed graph, the vertex connectivity from u to v is the
maxim...
A reciprocal recommendation problem is one where the goal of learning is...
In this paper, we present new incremental algorithms for maintaining dat...