2 citations · 3 across the 2 of their papers we have counts for
9 papers
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…
The Longest Run Subsequence Problem: Further Complexity Results
Riccardo Dondi, Florian Sikora
Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum le…
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…
Complexity Issues of String to Graph Approximate Matching
Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
The problem of matching a query string to a directed graph, whose vertices are labeled by strings, has application in different fields, from data mining to computational biology. S…
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…
Reconciling Multiple Genes Trees via Segmental Duplications and Losses
Riccardo Dondi, Manuel Lafond, Celine Scornavacca
Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. H…