WWW 2015

• The k-clique Densest Subgraph Problem
• Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
• A Game Theoretic Model for the Formation of Navigable Small-World Networks
• Discovering Meta-Paths in Large Heterogeneous Information Networks
• Spanning edge centrality: large-scale computation and applications
• Scalable Methods for Adaptively Seeding a Social Network
• Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment
• Improved Theoretical and Practical Guarantees for Chromatic Correlation Clustering
• Efficient Densest Subgraph Computation in Evolving Graphs
• Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
• Skolemising Blank Nodes while Preserving Isomorphism
• Global Diffusion via Cascading Invitations: Structure, Growth, and Homophily
• Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach
• Recommendation Subgraphs for Web Discovery
• Random-Walk TripleRush: Asynchronous Graph Querying and Sampling
• Essential Web Pages Are Easy to Find