In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …

The “short cycle removal” technique was recently introduced by Abboud, Bringmann, Khoury
and Zamir (STOC'22) to prove fine-grained hardness of approximation. Its main technical …

Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be
maintained in general graphs with logarithmic amortized update time. More specifically …

Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …

We present a new technique for efficiently removing almost all short cycles in a graph
without unintentionally removing its triangles. Consequently, triangle finding problems do …

Due to the lack of unconditional polynomial lower bounds, it is now in fashion to prove
conditional lower bounds in order to advance our understanding of the class P. The vast …

We present a new dynamic matching sparsification scheme. From this scheme we derive a
framework for dynamically rounding fractional matchings against adaptive adversaries …

We present two deterministic dynamic algorithms for the maximum matching problem.(1) An
algorithm that maintains a (2+ є)-approximate maximum matching in general graphs with O …

We present dynamic algorithms with polylogarithmic update time for estimating the size of
the maximum matching of a graph undergoing edge insertions and deletions with …

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying
assignment x∈{0, 1} n to a CNF formula φ is shared between two parties, where Alice …