KDD2013

583 Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Authors: Charalampos Tsourakakis, Carnegie Mellon University; Francesco Bonchi, Yahoo! Research; Aristides Gionis, Aalto University; Francesco Gullo, Yahoo! Research; Maria Tsiarli, University of Pittsburgh

399 Guided Learning for Role Discovery (GLRD): Framework, Algorithms, and Applications
Authors: Sean Gilpin, U.C. Davis; Tina Eliassi-Rad, ; Ian Davidson, University of California Davis

1083 Redundancy-Aware Maximal Cliques
Authors: Jia Wang, Chinese University of Hong Kong; James Cheng, Chinese University of Hong Kong; Ada Wai-Chee Fu, Chinese University of Hong Kong

569 Selective Sampling on Graphs for Classification
Authors: Quanquan Gu, CS, UIUC; Charu Aggarwal, IBM Research; Jialu Liu, UIUC; Jiawei Han, University of Illinois at Urbana-Champaign