Publications - Graph Algorithms

You can also find my publication list on Google Scholar and DBLP.

[Back to full publication list]

• Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
  Xiaojun Dong, Yan Gu, Yihan Sun and Yunming Zhang
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021.
  
  Parallel SSSP
  Paper   Video  ArXiV  Code
• Parallelism in Randomized Incremental Algorithms
  Guy E. Blelloch, Yan Gu, Julian Shun and Yihan Sun
  
  JACM
   Journal of the ACM (JACM).
  
  Parallel SCC, LE list
  Paper   
• Efficient Construction of Probabilistic Tree Embeddings
  Guy E. Blelloch, Yan Gu and Yihan Sun
  
  ICALP
   International Colloquium on Automata, Languages, and Programming (ICALP), 2017.
  
  approximate SSSP, distance oracle
  Paper   ArXiV  
• Parallel Shortest-paths Using Radius Stepping
  Guy Blelloch, Yan Gu, Yihan Sun and Kanat Tangwongsan
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
  
  Parallel SSSP
  Paper   
• Parallelism in Randomized Incremental Algorithms
  Guy Blelloch, Yan Gu, Julian Shun and Yihan Sun
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
  
  Parallel SCC, LE list
  Paper   ArXiV  
• Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE
  Yihan Sun, Joseph Crawford, Jie Tang and Tijana Milenkovic
  
  WABI
   Workshop on Algorithms in Bioinformatics (WABI), 2015.
  
  Graph alignment algorithm for PPI network aligning
  Paper   ArXiV  
• Fair Evaluation of Global Network Aligners
  Joseph Crawford, Yihan Sun, and Tijana Milenkovic
  
  AMB
   Algorithms for Molecular Biology, 10:19.
  
  Comparing graph alignment algorithms for PPI network aligning
  Paper   ArXiV  
• Influence Maximization in Dynamic Social Networks
  Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang and Xiaoming Sun
  
  ICDM
   IEEE International Conference on Data Mining (ICDM), 2013.
  
  Influence maximization on social networks
  Paper   ArXiV