research
∙
09/04/2021
Dynamic Meta-theorems for Distance and Matching
Reachability, distance, and matching are some of the most fundamental gr...
share
research
∙
06/01/2021
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
We present a parallel algorithm for permanent mod 2^k of a matrix of uni...
research
∙
03/25/2021
Reachability and Matching in Single Crossing Minor Free Graphs
We construct in Logspace non-zero circulations for H-minor free graphs w...
research
∙
08/13/2020
Dynamic Complexity of Expansion
Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see al...
research
∙
04/27/2020
Dynamic complexity of Reachability: How many changes can we handle?
In 2015, it was shown that reachability for arbitrary directed graphs ca...
research
∙
04/23/2018
Reachability and Distances under Multiple Changes
Recently it was shown that the transitive closure of a directed graph ca...
research
∙
02/05/2018