We study the fully dynamic All-Pairs Shortest Paths (APSP) problem in
un...
Expander graphs play a central role in graph theory and algorithms. With...
We propose a new conjecture on hardness of low-degree 2-CSP's, and show
...
We consider the classical Minimum Crossing Number problem: given an
n-ve...
We study the decremental All-Pairs Shortest Paths (APSP) problem in
undi...
Graph Crossing Number is a fundamental problem with various applications...
In the decremental single-source shortest paths (SSSP) problem, the inpu...
Edge connectivity of a graph is one of the most fundamental graph-theore...
The famous dynamic optimality conjecture of Sleator and Tarjan from 1985...
We consider the classical Minimum Balanced Cut problem: given a graph G,...
We study the vertex-decremental Single-Source Shortest Paths (SSSP) prob...
In this paper we study expander graphs and their minors. Specifically, w...
We study the Excluded Grid Theorem, a fundamental structural result in g...
We study the classical Node-Disjoint Paths (NDP) problem: given an undir...
In the classical Node-Disjoint Paths (NDP) problem, we are given an
n-ve...