| 2024 | CVPR | Hierarchical Correlation Clustering and Tree Preserving Embedding. | Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani |
| 2020 | CIKM | Subsampled Randomized Hadamard Transform for Regression of Dynamic Graphs. | Mostafa Haghir Chehreghani |
| 2019 | CIKM | Adaptive Algorithms for Estimating Betweenness and | Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem |
| 2019 | EDBT | Metropolis-Hastings Algorithms for Estimating Betweenness Centrality. | Mostafa Haghir Chehreghani, Talel Abdessalem, Albert Bifet |
| 2018 | ECIR | Efficient Context-Aware K-Nearest Neighbor Search. | Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani |
| 2018 | PAKDD | Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. | Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem |
| 2016 | DSAA | A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms. | Mostafa Haghir Chehreghani |
| 2016 | UAI | Modeling Transitivity in Complex Networks. | Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani |
| 2014 | WSDM | Effective co-betweenness centrality computation. | Mostafa Haghir Chehreghani |
| 2013 | CIKM | An efficient algorithm for approximate betweenness centrality computation. | Mostafa Haghir Chehreghani |
| 2011 | ICDM | Efficiently Mining Unordered Trees. | Mostafa Haghir Chehreghani |
| 2007 | CIDM | Mining Maximal Embedded Unordered Tree Patterns. | Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani |
| 2007 | CIDM | Clustering Rooted Ordered Trees. | Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani |