The maximum bipartite matching problem is among the most fundamental and well-studied
problems in combinatorial optimization. A beautiful and celebrated combinatorial algorithm …

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 …

We present a general toolbox, based on new vertex sparsifiers, for designing data structures
to maintain shortest paths in graphs undergoing edge insertions and/or deletions. In …

Listing copies of small subgraphs (such as triangles, 4-cycles, small cliques) in the input
graph is an important and well-studied problem in algorithmic graph theory. In this paper, we …

Maximum bipartite matching (MBM) is a fundamental problem in combinatorial optimization
with a long and rich history. A classic result of Hopcroft and Karp (1973) provides an $ O …

What is the time complexity of matrix multiplication of sparse integer matrices with m in
nonzeros in the input and m out nonzeros in the output? This paper provides improved …

In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in
undirected graphs. For unweighted graphs, we provide an algorithm for 2-approximate …

Designing approximate all-pairs distance oracles in the fully dynamic setting is one of the
central problems in dynamic graph algorithms. Despite extensive research on this topic, the …

We present the first non-trivial fully dynamic algorithm maintaining exact single-source
distances in unweighted graphs. This resolves an open problem stated by Sankowski …

As one of the three main pillars of fine-grained complexity theory, the 3SUM problem
explains the hardness of many diverse polynomial-time problems via fine-grained …