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 notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Fine-grained reductions have established equivalences between many core problems with
Õ (n 3)-time algorithms on n-node weighted graphs, such as Shortest Cycle, All-Pairs …

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 …

We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention
of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can …

The Strong Exponential Time Hypothesis and the OV-conjecture are two popular hardness
assumptions used to prove a plethora of lower bounds, especially in the realm of polynomial …

In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph G=(V,
E) subject to edge insertions and deletions and a source vertex s∈ V, and the goal is to …

We present an explicit and efficient construction of additively weighted Voronoi diagrams on
planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant …

We consider the task of lexicographic direct access to query answers. That is, we want to
simulate an array containing the answers of a join query sorted in a lexicographic order …

We study finding and listing $ k $-cliques in a graph, for constant $ k\geq 3$, a fundamental
problem of both theoretical and practical importance. Our main contribution is a new output …