Graph @ WWW

2014

• Large graph mining: patterns, cascades, fraud detection, and algorithms.
• High quality, scalable and parallel community detection for large real graphs.
• RDF analytics: lenses over semantic graphs.
• Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
• Demographics, weather and online reviews: a study of restaurant recommendations.
• Attributed graph models: modeling network structure with correlated attributes.

2015

• Recommendation Subgraphs for Web Discovery.
• Efficient Densest Subgraph Computation in Evolving Graphs.
• Compressed Indexes for String Searching in Labeled Graphs.
• Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts.
• Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.
• Density-friendly Graph Decomposition.
• Random Walk TripleRush: Asynchronous Graph Querying and Sampling.
• The K-clique Densest Subgraph Problem.
• Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation.

2016

• 
  

Core ideas around Graph computing

• Elasticity : Elastic Graph Processing System for Streaming Graph Data 
• Adaptability: Tuning the windows size for incremental graph computation
• Incremental Computation 
• High Performance

Graph @ IPDPS

2012

• 
  • 
  • 
  • 
  • 
  Md. Mostofa Ali Patwary, Peder Refsnes, Fredrik Manne:
  Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure. 827-835
• 
  • 
  • 
  • 
  • 
  Deepak Ajwani, Shoukat Ali, John P. Morrison:
  Graph Partitioning for Reconfigurable Topology. 836-847
• 
  • 
  • 
  • 
  • 
  Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
  Multithreaded Clustering for Multi-level Hypergraph Partitioning. 848-859
• 
  • 
  • 
  • 
  • 
  Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G. Boman, Arif M. Khan, Alex Pothen:
  Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs. 860-872

• 
  • 
  • 
  • 
  • 
  Jatin Chhugani, Nadathur Satish, Changkyu Kim, Jason Sewall, Pradeep Dubey:
  Fast and Efficient Graph Traversal Algorithm for CPUs: Maximizing Single-Node Efficiency. 378-389
• 
  • 
  • 
  • 
  • 
  Zhao Zhao, Guanying Wang, Ali Raza Butt, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe:
  SAHAD: Subgraph Analysis in Massive Networks Using Hadoop. 390-401
• 
  • 
  • 
  • 
  • 
  Lawrence Cayton:
  Accelerating Nearest Neighbor Search on Manycore Systems. 402-413
• 
  • 
  • 
  • 
  • 
  Guojing Cong, Konstantin Makarychev:
  Optimizing Large-scale Graph Analysis on Multithreaded, Multicore Platforms. 414-425

2013

• 
  • 
  • 
  • 
  • 
  Da Li, Michela Becchi:
  Deploying Graph Algorithms on GPUs: An Adaptive Solution. 1013-1024
  

• 
  • 
  • 
  • 
  • 
  Abdullah Gharaibeh, Lauro Beltrão Costa, Elizeu Santos-Neto, Matei Ripeanu:
  On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest. 851-862

• 
• 
• 
• 

Roger A. Pearce, Maya Gokhale, Nancy M. Amato:
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory. 825-836

• 
  • 
  • 
  • 
  • 
  Mark Redekopp, Yogesh Simmhan, Viktor K. Prasanna:
  Optimizations and Analysis of BSP Graph Processing Models on Public Clouds. 203-214
• 
  • 
  • 
  • 
  • 
  Peter Sanders, Lawrence Mandow:
  Parallel Label-Setting Multi-objective Shortest Path Search. 215-224
• 
  • 
  • 
  • 
  • 
  Dominique Lasalle, George Karypis:
  Multi-threaded Graph Partitioning. 225-236
• 
  • 
  • 
  • 
  • 
  Aydin Buluç, Erika Duriakova, Armando Fox, John R. Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, Samuel Williams:
  High-Productivity and High-Performance Analysis of Filtered Semantic Graphs. 237-248

2014

• 
• 
• 
• 

 Fabio Checconi, Fabrizio Petrini:
Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines. 425-434

• • 
    
  • 
  • 
  • 
  Yong Guo, Marcin Biczak, Ana Lucia Varbanescu, Alexandru Iosup, Claudio Martella, Theodore L. Willke:
  How Well Do Graph-Processing Platforms Perform? An Empirical Performance Evaluation and Analysis. 395-404
  

2015

• 
  • 
  • 
  • 
  • 
  Henning Meyerhenke, Peter Sanders, Christian Schulz:
  Parallel Graph Partitioning for Complex Networks. 1055-1064
• 
  • 
  • 
  • 
  • 
  Lélia Blin, Fadwa Boubekeur, Swan Dubois:
  A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. 1065-1074
• 
  • 
  • 
  • 
  • 
  Ariful Azad, Aydin Buluç, Alex Pothen:
  A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs. 1075-1084

• 
  • 
  • 
  • 
  • 
  Yinglong Xia, Lifeng Nai, Jui-Hsin Lai:
  Towards Balance-Affinity Tradeoff in Concurrent Subgraph Traversals. 936-945

• • 
  • 
  • 
  • 
  Harshvardhan, Brandon West, Adam Fidel, Nancy M. Amato, Lawrence Rauchwerger:
  A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems. 799-808
• 
  • 
  • 
  • 
  • 
  Yogesh L. Simmhan, Neel Choudhury, Charith Wickramaarachchi, Alok Gautam Kumbhare, Marc Frîncu, Cauligi S. Raghavendra, Viktor K. Prasanna:
  Distributed Programming over Time-Series Graphs. 809-818
• 
  • 
  • 
  • 
  • 
  Linchuan Chen, Xin Huo, Bin Ren, Surabhi Jain, Gagan Agrawal:
  Efficient and Simplified Parallel Graph Processing over CPU and MIC. 819-828
  
  

• • 
  • 
  • 
  • 
  Hao Lu, Mahantesh Halappanavar, Daniel G. Chavarría-Miranda, Assefaw Hadish Gebremedhin, Ananth Kalyanaraman:
  Balanced Coloring for Parallel Computing Applications. 7-16
• 
  • 
  • 
  • 
  • 
  George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
  High-Performance Graph Analytics on Manycore Processors. 17-27
• 
  • 
  • 
  • 
  • 
  Xinyu Que, Fabio Checconi, Fabrizio Petrini, John A. Gunnels:
  Scalable Community Detection with the Louvain Algorithm. 28-37