Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2 
Published in University of Oulu — Master’s Thesis, 2019
Master’s thesis on power optimization for uplink in a cell-free massive MIMO system using L-MMSE detection.
Recommended citation: Chamalee Wickrama Arachchi. (2019). "Optimization Techniques for Cell-Free Massive MIMO System." University of Oulu, Master’s Thesis. https://oulurepo.oulu.fi/handle/10024/14156
Published in SIAM International Conference on Data Mining (SDM), 2023
A study on ranking nodes in labeled networks.
Recommended citation: Chamalee Wickrama Arachchi and Nikolaj Tatti. (2023). "Node ranking in labeled networks." SIAM International Conference on Data Mining. https://arxiv.org/abs/2502.01408
Published in Machine Learning, 2024
Dense subgraph discovery with Jaccard constraints.
Recommended citation: Chamalee Wickrama Arachchi and Nikolaj Tatti. (2024). "Jaccard-constrained dense subgraph discovery." Machine Learning: 1–23. https://link.springer.com/article/10.1007/s10994-024-06595-y
Published in Machine Learning, 2024
Combining recurrent segmentation with block models for temporal networks.
Recommended citation: Chamalee Wickrama Arachchi and Nikolaj Tatti. (2024). "Recurrent segmentation meets block models in temporal networks." Machine Learning: 1–31. https://link.springer.com/content/pdf/10.1007/s10994-023-06507-6.pdf
Published in ACM KDD Conference, 2024
Dense subgraph discovery under strong triadic closure constraints.
Recommended citation: Chamalee Wickrama Arachchi, Iiro Kumpulainen, and Nikolaj Tatti. (2024). "Dense Subgraph Discovery Meets Strong Triadic Closure." ACM KDD Conference. https://dl.acm.org/doi/10.1145/3637528.3671697
Published in ECML PKDD, 2024
A fairness-aware densest subgraph formulation across multiple graph instances.
Recommended citation: Chamalee Wickrama Arachchi and Nikolaj Tatti. (2024). "Fair Densest Subgraph Across Multiple Graphs." ECML PKDD. https://link.springer.com/chapter/10.1007/978-3-031-70362-1_1
Published in University of Helsinki — Doctoral Thesis, 2025
Doctoral thesis on data mining methods for discovering structures in feature-rich graph networks.
Recommended citation: Chamalee Wickrama Arachchi. (2025). "Methods for Finding Structures in Feature-rich Graph Networks." University of Helsinki, Doctoral Dissertation. https://helda.helsinki.fi/handle/10138/601699
Published:
Oral presentation of the work Recurrent Segmentation Meets Block Models in Temporal Networks at the International Discovery Science Conference (DS 2022), Montpellier, France.
Published:
Oral presentation of the work Node Ranking in Labeled Networks at the SIAM International Conference on Data Mining (SDM 2023), Minneapolis, USA.
Published:
Oral presentation of the work Jaccard-constrained Dense Subgraph Discovery at the International Discovery Science Conference (DS 2023), Porto, Portugal.
Published:
Oral presentation of the work Dense Subgraph Discovery Meets Strong Triadic Closure at the ACM KDD Conference (2024).
Published:
Oral presentation of the work Fair Densest Subgraph Across Multiple Graphs at the ECML PKDD Conference (2024), Vilnius, Lithuania.
Graduate course, University of Helsinki, Department of Computer Science, 2021
Served as a Teaching Assistant for the Introduction to Artificial Intelligence course in Fall 2021.
Responsibilities included guiding exercises, assisting students during exercise sessions, evaluating assignments, and supporting course instruction.
Graduate course, University of Helsinki, Department of Computer Science, 2023
Served as a Teaching Assistant for the Introduction to Machine Learning course in Fall 2023.
Responsibilities included providing hands-on support during exercise sessions, evaluating submissions, and helping students understand core ML concepts.