107 citations · 419 across the 22 of their papers we have counts for
4 papers · 1 filter
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…
Covering with Clubs: Complexity and Approximability
Riccardo Dondi, Giancarlo Mauri, Florian Sikora +1
Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being $…
Approximating Clustering of Fingerprint Vectors with Missing Values
Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
The problem of clustering fingerprint vectors is an interesting problem in Computational Biology that has been proposed in (Figureroa et al. 2004). In this paper we show some impro…