With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Networks (or graphs) appear as dominant structures in diverse domains, including
sociology, biology, neuroscience and computer science. In most of the aforementioned …

Social Networks' omnipresence and ease of use has revolutionized the generation and
distribution of information in today's world. However, easy access to information does not …

Recently, the topic of community search (CS) has gained plenty of attention. Given a query
vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on …

Wikipedia is a community-created encyclopedia that contains information about notable
people from different countries, epochs and disciplines and aims to document the world's …

The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

The problem of computing (α, β)-core in a bipartite graph for given α and β is a fundamental
problem in bipartite graph analysis and can be used in many applications such as online …

Given a directed graph of millions of nodes, how can we automatically spot anomalous,
suspicious nodes, judging only from their connectivity patterns? Suspicious graph patterns …

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to
at least k vertices in the subgraph. k-core decomposition is often used in large-scale network …

Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful
node embedding methods. In particular, graph AE and VAE were successfully leveraged to …