The sudoku minimum number of clues problem is the following question: what is the
smallest number of clues that a sudoku puzzle can have? For several years it had been …

For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-
processing procedure that transforms an arbitrary instance of π into an equivalent one …

Computing minimal hitting sets (also known as set covers) for a collection of sets is an
important problem in many domains (eg, model/reasoning-based fault diagnosis). Being an …

A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general
kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by …

Therapies consisting of a combination of agents are an attractive proposition, especially in
the context of diseases such as cancer, which can manifest with a variety of tumor types in a …

In the Hitting Set problem, we are given a collection F of subsets of a ground set V and an
integer p, and asked whether V has a p-element subset that intersects each set in F. We …

Generating diagnosis candidates for a set of failing transactions is an important challenge in
the context of automatic fault localization of both software and hardware systems. Being an …

In this paper, we present a new approach to approximate the negative border and the
positive border of frequent itemsets. This approach is based on the transition from a border …

Nowadays the concepts and infrastructures of Cloud Computing are becoming a standard
for several applications. Scalability is not only a buzzword anymore, but is being used …

The approach FIBAD is introduced with the purpose of computing approximate borders of
frequent itemsets by leveraging dualization and computation of approximate minimal …