AAAI 2018:
- Dynamic Deep Neural Networks: Optimizing Accuracy-Efficiency Trade-offs by Selective Execution
- Dynamic Network Embedding by Modeling Triadic Closure Process
- DepthLGP: Learning Embeddings of Out-of-Sample Nodes in Dynamic Networks
AAAI2019：
- A Generative Model for Dynamic Networks with Applications
- Communication-optimal distributed dynamic graph clustering
AAAI2020：
- EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
- Dynamic Network Pruning with Interpretable Layerwise Channel Selection
ICLR2019：
- DyRep: Learning Representations over Dynamic Graphs
- Dynamic Graph Representation Learning via Self-Attention Networks
ICLR2020：
- The Logical Expressiveness of Graph Neural Networks
WWW2018：
- Fast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees
IJCAI2018:
- Dynamic Network Embedding : An Extended Approach for Skip-gram based Network Embedding
- 14 Deep into Hypersphere: Robust and Unsupervised Anomaly Discovery in Dynamic Networks
IJCAI2019：
- AddGraph: Anomaly Detection in Dynamic Graph using Attention-based Temporal GCN
SIGIR2019：
- Network Embedding and Change Modeling in Dynamic Heterogeneous Networks
SIGIR2020:
- Learning Dynamic Node Representations with Graph Neural Networks
- Dynamic Link Prediction by Integrating Node Vector Evolution and Local Neighborhood Representation
KDD2018:
- NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks
KDD2019:
- Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach
- Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks
KDD2020:
- Laplacian Change Point Detection for Dynamic Graphs
- Dynamic Heterogeneous Graph Neural Network for Real-time Event Prediction
- Neural Dynamics on Complex Networks
ICML2018：
- Fast Approximate Spectral Clustering for Dynamic Networks
ICML2019：
- Improved Dynamic Graph Learning through Fault-Tolerant Sparsification
NeurIPS 2019:
- Variational Graph Recurrent Neural Network
ICDE2018：
- Efficient SimRank Tracking in Dynamic Graphs.
- On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs
ICDE2019：
- Computing a Near-Maximum Independent Set in Dynamic Graphs
- Finding Densest Lasting Subgraphs in Dynamic Graphs: A Stochastic Approach
- Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks
- Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach
- A Fast Sketch Method for Mining User Similarities Over Fully Dynamic Graph Streams
