research
∙
09/21/2023
Temporal Network Core Decomposition and Community Search
We introduce a new generalization of the k-core decomposition for tempor...
share
research
∙
11/12/2022
On maximal 3-edge-connected subgraphs of undirected graphs
We show how to find and efficiently maintain maximal 3-edge-connected su...
research
∙
06/23/2022
Inferring Tie Strength in Temporal Networks
Inferring tie strengths in social networks is an essential task in socia...
research
∙
08/19/2021
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph
We present an improved algorithm for computing the 4-edge-connected comp...
research
∙
05/06/2021
Computing the 4-Edge-Connected Components of a Graph in Linear Time
We present the first linear-time algorithm that computes the 4-edge-conn...
research
∙
04/02/2021
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
In many real datasets such as social media streams and cyber data source...
research
∙
01/07/2021
Planar Reachability Under Single Vertex or Edge Failures
In this paper we present an efficient reachability oracle under single-e...
research
∙
07/17/2020
All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier
Let G=(V,E) be an n-vertex directed acyclic graph (DAG). A lowest common...
research
∙
05/22/2019
Dynamic Algorithms for the Massively Parallel Computation Model
The Massive Parallel Computing (MPC) model gained popularity during the ...
research
∙
01/28/2019
Dominating Sets and Connected Dominating Sets in Dynamic Graphs
In this paper we study the dynamic versions of two basic graph problems:...
research
∙
07/16/2018
Faster Algorithms for All-Pairs Bounded Min-Cuts
Given a directed graph, the vertex connectivity from u to v is the maxim...
research
∙
06/28/2018
Decremental SPQR-trees for Planar Graphs
We present a decremental data structure for maintaining the SPQR-tree of...
research
∙
02/27/2018