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 …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

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 …

In 1961, Gomory and Hu showed that the All-Pairs Max-Flow problem of computing the max-
flow between all n\2 pairs of vertices in an undirected graph can be solved using only n-1 …

Abstract The Dynamic Time War** (DTW) distance is a popular similarity measure for
polygonal curves (ie, sequences of points). It finds many theoretical and practical …

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

We give the first fully dynamic algorithm which maintains a (1− є)-approximate densest
subgraph in worst-case time poly (log n, є− 1) per update. Dense subgraph discovery is an …

We present a general framework of designing efficient dynamic approximate algorithms for
optimization problems on undirected graphs. In particular, we develop a technique that …

The edit distance between two rooted ordered trees with n nodes labeled from an alphabet
Ʃ is the minimum cost of transforming one tree into the other by a sequence of elementary …

In this paper we carefully combine Fredman's trick [SICOMP'76] and Matoušek's approach
for dominance product [IPL'91] to obtain powerful results in fine-grained complexity. Under …