IJCAI-15

  • Paper ID: 81 - A Fast Local Search for Mnimum Vertex Cover in Massive Graphs

Shaowei Cai (Chinese Academy of Sciences)

  • Paper ID: 213 - A Scalable Community Detection Algorithm for Large Graphs Using Stochastic Block Models

Chengbin Peng (KAUST); Zhihua Zhang (n/a); Ka-Chun Wong (n/a); Xiangliang Zhang (n/a); David Keyes (n/a);

  • Paper ID: 671 - Non-monotone Adaptive Submodular Maximization

Alkis Gotovos (ETH Zurich); Amin Karbasi (Yale University); Andreas Krause (ETH Zurich)

  • Paper ID: 945 - Scalable Graph Hashing with Feature Transformation

Qing-Yuan Jiang (Department of CS&T, Nanjing University); Wu-Jun Li (Nanjing University)

  • Paper ID: 1073 - Maximizing the Coverage of Information Propagation in Social Networks

Zhefeng Wang (University of Science and Technology of China); Qi Liu (University of Science and Technology of China); Yu Yang (Simon Fraser University); Yong Ge (UNC Charlotte); Enhong Chen (n/a); Biao Chang (University of Science and Technology of China)

  • Paper ID: 1167 - Analysis of Sampling Algorithms for Twitter

Deepan Palguna (Purdue University); Vikas Joshi (IBM India Research Lab); Venkatesan Chakaravarthy (IBM Research - India); Ravi Kothari (IBM India Research Lab); L Venkata Subramaniam (IBM Research)

  • Paper ID: 1491 - Generalized Transitive Distance with Minimum Spanning Random Forest

Zhiding Yu (Carnegie Mellon University); Weiyang Liu (Peking University); Wenbo Liu (Carnegie Mellon University); Xi Peng (Institute for Infocomm Research (I2R), A*STAR); Zhuo Hui (Carnegie Mellon Univeristy); Vijayakumar Bhagavatula (Carnegie Mellon University);