ICDE 2015

  • 004 Finding Dense and Connected Subgraphs in Dual Networks

Yubao Wu, Ruoming Jin, Xiaofeng Zhu, Xiang Zhang

  • 050 Multi-Constrained Graph Pattern Matching in Large-Scale Contextual Social Graphs
  • 073 Multicore Triangle Computations Without Tuning
  • 096 Preserving Privacy in Social Networks Against Connection Fingerprint Attacks
  • 098 Real Time Personalized Search on Social Networks
  • 125 Quick-Motif: An Efficient and Scalable Framework for Exact Motif Discovery
  • 131 Size-Constrained Weighted Set Cover
  • 169 The Safest Path via Safe Zones
  • 208 Scalable SimRank Join Algorithm

Takanori Maehara, Mitsuru Kusumoto, Ken-ichi Kawarabayashi

  • 209 Diversified Top-K Clique Search
  • 211 VENUS: Vertex-Centric Streamlined Graph Computation on a Single PC
  • 225 On Random Walk Based Graph Sampling

Rong-Hua Li, Jeffrey Xu Yu, Lu Qin, Rui Mao, Tan Jin

  • 290 Making Pattern Queries Bounded in Big Graphs
  • 310 A Tale of Three Graphs: Sampling Design on Hybrid Social-Affiliation Networks
  • 400 Asymmetric Structure-Preserving Subgraph Queries for Large Graphs
  • 426 Linear Path Skylines in Multicriteria Networks
  • 458 Dynamic Interaction Graphs with Probabilistic Edge Decay
  • 470 HaTen2: Billion-scale Tensor Decompositions

Inah Jeon, Evangelos E. Papalexakis, U Kang, Christos Faloutsos

  • 504 Bump hunting in the dark: Local discrepancy maximization on graphs
  • 516 Network Motif Discovery: A GPU Approach

Wenqing Lin, Xiaokui Xiao, Xing Xie, Xiao-Li Li

  • 605 Convex Risk Minimization to Infer Networks from Probabilistic Diffusion Data At Multiple Scales
  • 609 Mining Maximal Cliques from an Uncertain Graph