Wenjie Zhang

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs

2020

Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS problem is …

A Syntax-Guided Edit Decoder for Neural Program Repair

2021 · arXiv (Cornell University)

Automated Program Repair (APR) helps improve the efficiency of software development and maintenance. Recent APR techniques use deep learning, particularly the encoder-decoder architecture, to generate patches. Though existing DL-based APR approaches have proposed different encoder …

On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing

2025 · Proceedings of the VLDB Endowment

Missing data imputation, which aims to impute the missing values in the raw datasets, is crucial for modern data-driven models like large language models (LLMs). Despite its importance, existing solutions either 1) only support numerical …

Unlocking Multi-Modal Potentials for Link Prediction on Dynamic Text-Attributed Graphs

2025 · arXiv (Cornell University)

Dynamic Text-Attributed Graphs (DyTAGs) are a novel graph paradigm that captures evolving temporal events (edges) alongside rich textual attributes. Existing studies can be broadly categorized into TGNN-driven and LLM-driven approaches, both of which encode textual …