Abstract The Algorithm Selection Problem is concerned with selecting the best algorithm to
solve a given problem on a case-by-case basis. It has become especially relevant in the last …

Selecting the most appropriate algorithm to use when attempting to solve a black-box
continuous optimization problem is a challenging task. Such problems typically lack …

The Set Cover problem belongs to a group of hard problems which are neither
approximable in polynomial time (at least with a constant factor) nor fixed parameter …

Given an undirected graph with n vertices, the Maximum Leaf Spanning Tree problem is to
find a spanning tree with as many leaves as possible. When parameterized in the number of …

Using ideas and results from polynomial time approximation and exact computation we
design approximation algorithms for several NP-hard combinatorial problems achieving …

The paper summarizes the results of research on the modeling and implementation of
advanced planning and scheduling (APS) systems done in recent twenty years. It discusses …

This book studies exponential time algorithms for NP-hard problems. In this modern area,
the aim is to design algorithms for combinatorially hard problems that execute provably …

The problem of algorithm selection, that is identifying the most efficient algorithm for a given
computational task, is non-trivial. Meta-learning techniques have been used successfully for …

We motivate and describe a new parameterized approximation paradigm which studies the
interaction between approximation ratio and running time for any parametrization of a given …

We introduce a generic approach for counting subgraphs in a graph. The main idea is to
relate counting subgraphs to counting graph homomorphisms. This approach provides new …