Along with the rapid technological and commercial innovation on the e-commerce platforms,
there are an increasing number of frauds that bring great harm to these platforms. Many …

Maximal biclique enumeration is a fundamental problem in bipartite graph analysis, and can
find numerous applications. However, previous studies only focus on unsigned bipartite …

Supergraph search is a fundamental graph query processing problem. Supergraph search
aims to find all data graphs contained in a given query graph based on the subgraph …

Online social networks facilitate the spread of information, while rumors can also propagate
widely and fast, which may mislead some users. Therefore, suppressing the spread of …

Finding bicliques is a fundamental problem in bipartite graph analysis, and can find
numerous applications. However, previous studies only focus on unsigned bipartite graphs …

In recent years, how to prevent the widespread transmission of infectious diseases in
communities has been a research hot spot. Tracing close contact with infected individuals is …

Graph neural networks (GNNs) provide an approach for analyzing complicated graph data
for node, edge, and graph-level prediction tasks. However, due to societal discrimination in …

Many real-world networks are signed networks containing positive and negative edges. The
existence of negative edges in the signed graph neural network has two consequences …

As the field of data science continues to evolve, bipartite graphs have emerged as a
fundamental structure in numerous applications, drawing significant interest from both …

Graph Neural Networks (GNNs) are vital in data science but are increasingly susceptible to
adversarial attacks. To help researchers develop more robust GNN models, it's essential to …