The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

The densest subgraph problem (DSP) is of great significance due to its wide applications in
different domains. Meanwhile, diverse requirements in various applications lead to different …

How can we detect a group of individuals whose connectivity persists and even strengthens
over time? Despite extensive research on temporal networks, this practically pertinent …

Given a heterogeneous multilayer network with various connections in pharmacology, how
can we detect components with intensive interactions and strong dependencies? Can we …

Interactions among entities are usually modeled using graphs. In many real scenarios, these
relations may change over time, and different kinds exist among entities that need to be …

Finding dense subgraphs is a fundamental algorithmic tool in data mining, community
detection, and clustering. In this problem, one aims to find an induced subgraph whose edge …