6 citations · 12 across the 5 of their papers we have counts for
3 papers · 1 filter
Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem
Stefano Beretta, Mauro Castelli, Riccardo Dondi
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem.…
Covering Pairs in Directed Acyclic Graphs
Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni +2
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in differ…
Parameterized Complexity of the k-anonymity Problem
Stefano Beretta, Paola Bonizzoni, Gianluca Della Vedova +2
The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization that has been recently proposed is the -anonym…