2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2025★ 2 cited
Max-Min Diversification with Asymmetric Distances
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
One of the most well-known and simplest models for diversity maximization is the Max-Min Diversification (MMD) model, which has been extensively studied in the data mining and data…
cs.DS2025
Dense Subgraph Discovery Meets Strong Triadic Closure
Chamalee Wickrama Arachchi, Iiro Kumpulainen, Nikolaj Tatti
Finding dense subgraphs is a core problem with numerous graph mining applications such as community detection in social networks and anomaly detection. However, in many real-world…