SIGMOD 2015

• GetReal: Towards Realistic Selection of Influence Maximization Strategies in Competitive Networks
• BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs
• Minimum Spanning Trees in Temporal Graphs
• Influence Maximization in Near-Linear Time: A Martingale Approach
• Community Level Diffusion Extraction
• Divide & Conquer: I/O Efficient Depth-First Search
• Efficient Enumeration of Maximal k-Plexes
• Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates
• Exact Top-k Nearest Keyword Search in Large Networks
• Updating Graph Indices with a One-Pass Algorithm
• The Minimum Wiener Connector Problem
• Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach
• COMMIT : A Scalable Approach to Mining Communication Motifs from Dynamic Networks
• Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity
• Efficient Route Planning on Public Transportation Networks: A Labelling Approach