37 citations · 65 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
Computing the k Densest Subgraphs of a Graph
Riccardo Dondi, Danny Hermelin
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in…
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…