The following pages link to Italo Zoppis (Q392036):
Displaying 16 items.
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Complexity issues of string to graph approximate matching (Q782580) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Covering with clubs: complexity and approximability (Q1670995) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- An application of kernel methods to gene cluster temporal meta-analysis (Q2379643) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- Controlling the losing probability in a monotone game (Q2489238) (← links)
- On the Complexity of the l-diversity Problem (Q3088046) (← links)
- Restricted and Swap Common Superstring: A Parameterized View (Q4899240) (← links)
- The longest filled common subsequence problem (Q5110878) (← links)
- Clustering Dependencies with Support Vectors (Q5302382) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
