33 citations · 35 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
Martino Ciaperoni, Aristides Gionis, Heikki Mannila
The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption…
cs.DS2019★ 2 cited
Span-core Decomposition for Temporal Networks: Algorithms and Applications
Edoardo Galimberti, Martino Ciaperoni, Alain Barrat +3
When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their…