BERT-fused Model for Finnish-Swedish Translation. - Iiro Kumpulainen; Jouko Vankka (SNAMS, 2021)

Community Detection in Edge-Labeled Graphs. - Iiro Kumpulainen; Nikolaj Tatti (DS, 2022)

Finding Coherent Node Groups in Directed Graphs. - Iiro Kumpulainen; Nikolaj Tatti (PKDD/ECML Workshops (3), 2023)

Dense Subgraph Discovery Meets Strong Triadic Closure. - Chamalee Wickrama Arachchi; Iiro Kumpulainen; Nikolaj Tatti (KDD, 2024)

Max-Min Diversification with Asymmetric Distances. - Iiro Kumpulainen; Florian Adriaens; Nikolaj Tatti (KDD, 2024)

Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs. - Florian Adriaens; Iiro Kumpulainen; Nikolaj Tatti (CoRR, 2024)

Dense subgraphs induced by edge labels. - Iiro Kumpulainen; Nikolaj Tatti (Mach. Learn., 2024)

From Your Block to Our Block: How to Find Shared Structure Between Stochastic Block Models over Multiple Graphs. - Iiro Kumpulainen; Sebastian Dalleiger; Jilles Vreeken; Nikolaj Tatti (AAAI, 2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. - Vedangi Bengali; Nikolaj Tatti; Iiro Kumpulainen; Florian Adriaens; Nate Veldt (CoRR, 2025)