Italo Zoppis

Available identifiers

Publication	Date of Publication	Type
On the complexity of approximately matching a string to a directed graph	2022-10-13	Paper
Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity	2021-05-11	Paper
Complexity issues of string to graph approximate matching	2020-07-27	Paper
The longest filled common subsequence problem	2020-05-25	Paper
Comparing incomplete sequences via longest common subsequence	2019-11-13	Paper
On the tractability of finding disjoint clubs in a network	2019-06-18	Paper
Covering a graph with clubs	2019-05-24	Paper
Covering with clubs: complexity and approximability	2018-09-06	Paper
Restricted and swap common superstring: a multivariate algorithmic perspective	2015-09-02	Paper
The \(l\)-diversity problem: tractability and approximability	2014-01-13	Paper
Restricted and swap common superstring: a parameterized view	2013-01-07	Paper
On the complexity of the \(l\)-diversity problem	2011-08-17	Paper
Playing monotone games to understand learning behaviors	2010-05-27	Paper
An application of kernel methods to gene cluster temporal meta-analysis	2010-03-19	Paper
Clustering Dependencies with Support Vectors	2009-01-07	Paper
Controlling the losing probability in a monotone game	2006-05-16	Paper

This page was built for person: Italo Zoppis