research
∙
09/04/2021
Dynamic Meta-theorems for Distance and Matching
Reachability, distance, and matching are some of the most fundamental gr...
share
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
∙
05/13/2020
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
A graph separator is a subset of vertices of a graph whose removal divid...
research
∙
02/28/2020
Two Player Hidden Pointer Chasing and Multi-Pass Lower Bounds in Turnstile Streams
The authors have withdrawn this paper due to an error in the proof of Le...
research
∙
02/01/2019
Grid Graph Reachability
The reachability problem is to determine if there exists a path from one...
research
∙
01/31/2019
Reachability in High Treewidth Graphs
Reachability is the problem of deciding whether there is a path from one...
research
∙
01/03/2018
