Despite growing adoption of cryptocurrencies, making fast payments at scale remains a
challenge. Payment channel networks (PCNs) such as the Lightning Network have emerged …

We consider the classical Minimum Balanced Cut problem: given a graph G, compute a
partition of its vertices into two subsets of roughly equal volume, while minimizing the …

Networks are expected to provide reliable performance under a wide range of operating
conditions, but existing traffic engineering (TE) solutions optimize for performance or …

Hierarchical graph decompositions play an important role in the design of approximation
and online algorithms for graph problems. This is mainly due to the fact that the results …

Intra-domain traffic engineering can significantly enhance the performance of large IP
backbone networks. Two important components of traffic engineering are understanding the …

Traffic engineering plays a critical role in determining the performance and reliability of a
network. A major challenge in traffic engineering is how to cope with dynamic and …

This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

We introduce a notion for hierarchical graph clustering which we call the expander hierarchy
and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with n …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

One of the key results in Robertson and Seymour's seminal work on graph minors is the grid-
minor theorem (also called the excluded grid theorem). The theorem states that for every …