Vertex reordering is a way to improve locality in graph computations. Given an input (or
“natural”) order, reordering aims to compute an alternate permutation of the vertices that is …

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of
maximum weight in a graph with weights on the edges. b-Matching is a generalization of the …

This article has two main objectives: one is to describe some extensions of an adaptive
Algebraic Multigrid (AMG) method of the form previously proposed by the first and third …

Matching is an important combinatorial problem with a number of applications in areas such
as community detection, sparse linear algebra, and network alignment. Since computing …

We survey recent work on approximation algorithms for computing degree-constrained
subgraphs in graphs and their applications in combinatorial scientific computing. The …

We introduce a new composite adaptive Algebraic Multigrid (composite α α AMG) method to
solve systems of linear equations without a-priori knowledge or assumption on …

As technology advances both in increasing bandwidth and in reducing latency for I/O buses
and devices, moving I/O data in/out memory has become critical. In this paper, we have …

Emerging reconfigurable datacenters allow to dynamically adjust the network topology in a
demand-aware manner. These datacenters rely on optical switches which can be …

We design and implement an efficient parallel algorithm for finding a perfect matching in a
weighted bipartite graph such that weights on the edges of the matching are large. This …

Network alignment is an optimization problem to find the best one-to-one map between the
vertices of a pair of graphs that overlaps as many edges as possible. It is a relaxation of the …