4 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
Testing Robustness of Temporal Transportation Networks via Interval Separators
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh
This paper addresses the problem of identifying time interval separators in temporal networks. We introduce d-MinIntSep, a new variant of the temporal separator problem, which mode…
Finding Colorful Paths in Temporal Graphs
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh
The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-c…
Top-k Connected Overlapping Densest Subgraphs in Dual Networks
Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh
Networks are largely used for modelling and analysing data and relations among them. Recently, it has been shown that the use of a single network may not be the optimal choice, sin…
Top-k Overlapping Densest Subgraphs: Approximation and Complexity
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri +1
A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort…