resume/04-research.tex at main · merferry/resume · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
\section*{Publications}

\begin{itemize}[noitemsep, leftmargin=*]
  \item \href{https://ieeexplore.ieee.org/abstract/document/11105845}{$\nu$-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection} (IPDPSW PDSEC 2025)
  \item \href{https://www.sciencedirect.com/science/article/pii/S0167739X25002912}{GVE-LPA and GSL-LPA: High-speed and internally-connected label propagation on multicore systems} (FGCS 2025, Elsevier)
  \item \href{https://www.jstage.jst.go.jp/article/ijnc/15/1/15_2/_article/-char/ja/}{Parallel Multicore Algorithms for Community Detection in Dynamic Graphs} (IJNC 2024)
  \item \href{https://onlinelibrary.wiley.com/doi/10.1002/cpe.8331}{A Fast Parallel Approach for Neighborhood-based Link Prediction by Disregarding Large Hubs} (CCPE 2024, Wiley)
  \item \href{https://ieeexplore.ieee.org/abstract/document/10898993}{EvolvGraph: A Tool for Property-Constrained Generation of Dynamic Graphs} (HiPC 2024 SRS, IEEE)
  \item \href{https://link.springer.com/chapter/10.1007/978-3-031-82435-7_11}{High-Performance Implementation of Louvain Algorithm with Representational Optimizations} (Complex Networks 2024, Springer SCI)
  \item \href{https://link.springer.com/chapter/10.1007/978-3-031-90203-1_9}{GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting} (Euro-Par HiPES 2024, Springer LNCS)
  \item \href{https://link.springer.com/chapter/10.1007/978-3-031-90200-0_22}{GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) formats} (Euro-Par AMTE 2024, Springer LNCS)
  \item \href{https://link.springer.com/chapter/10.1007/978-3-031-90203-1_42}{High-Speed Neighborhood-based Link Prediction by Disregarding Large Hubs} (Euro-Par 2024 PhD Symposium, Springer LNCS)
  \item \href{https://link.springer.com/chapter/10.1007/978-3-031-69583-4_22}{DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs} (Euro-Par 2024, Springer LNCS)
  \item \href{https://dl.acm.org/doi/abs/10.1145/3673038.3673146}{Fast Leiden Algorithm for Community Detection in Shared Memory Setting} (ICPP 2024, ACM)
  \item \href{https://ieeexplore.ieee.org/abstract/document/10596502/}{Lock-free Computation of PageRank in Dynamic Graphs} (IPDPSW ParSocial 2024, IEEE)
  \item \href{https://ieeexplore.ieee.org/abstract/document/10596428/}{Shared-Memory Parallel Algorithms for Community Detection in Dynamic Graphs} (Outstanding paper, IPDPSW ADPCM 2024, IEEE)
  \item \href{https://ieeexplore.ieee.org/abstract/document/9835216/}{Dynamic Batch Parallel Algorithms for Updating PageRank} (IPDPSW ParSocial 2022)
\end{itemize}


\section*{Technical Reports}

\begin{itemize}[noitemsep, leftmargin=*]
  \item \href{https://arxiv.org/abs/2411.19901}{Memory Efficient GPU-based LPA for Community Detection on Large Graphs}
  % \item \href{https://arxiv.org/abs/2411.02268}{Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches}
  % \item \href{https://arxiv.org/abs/2410.15451}{Heuristic-based Dynamic Leiden $\cdots$ Efficient Tracking of Communities on Evolving Graphs}
  % \item \href{https://arxiv.org/abs/2405.11658}{A Starting Point for Dynamic Community Detection with Leiden Algorithm}\ignore{(Accepted at ICPP SANDY 2024)}
  % \item \href{https://arxiv.org/abs/2404.19634}{DF Louvain: Fast Incrementally Expanding Approach for $\cdots$ on Dynamic Graphs}
  % \item \href{https://arxiv.org/abs/2402.11454}{An Approach for Addressing Internally-Disconnected Communities in Louvain Algorithm}
  % \item \href{https://arxiv.org/abs/2403.01261}{GSL-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection with no $\cdots$}
  % \item \href{https://arxiv.org/abs/2310.18537}{Heuristics for Inequality minimization in PageRank values}
\end{itemize}