
Correlation Clustering in Constant Many Parallel Rounds
Correlation clustering is a central topic in unsupervised learning, with...
read it

New instances for maximum weight independent set from a vehicle routing application
We present a set of new instances of the maximum weight independent set ...
read it

Planar Reachability Under Single Vertex or Edge Failures
In this paper we present an efficient reachability oracle under singlee...
read it

AllPairs LCA in DAGs: Breaking through the O(n^2.5) barrier
Let G=(V,E) be an nvertex directed acyclic graph (DAG). A lowest common...
read it

Dynamic Algorithms for the Massively Parallel Computation Model
The Massive Parallel Computing (MPC) model gained popularity during the ...
read it

Dominating Sets and Connected Dominating Sets in Dynamic Graphs
In this paper we study the dynamic versions of two basic graph problems:...
read it

Faster Algorithms for AllPairs Bounded MinCuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
read it

Online Reciprocal Recommendation with Theoretical Performance Guarantees
A reciprocal recommendation problem is one where the goal of learning is...
read it

Incremental Strong Connectivity and 2Connectivity in Directed Graphs
In this paper, we present new incremental algorithms for maintaining dat...
read it
Nikos Parotsidis
is this you? claim profile