Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
We present a new method, called UTAGMS , for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. ...
Salvatore Greco, Vincent Mousseau, Roman Slowinski
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...