• Publications
  • Influence
A compendium of NP optimization problems
This compendium of approximability results of NP-hard optimization problems has been collected together and is interested in studying a class of optimization problems whose feasible solutions are short and easy-to-recognize.
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
This work proves that MECBS is not approximable within a sub-logarithmic factor (unless P=NP), and proposes a polynomial-time approximation algorithm for the NP-hard case in which both the dimension and the gradient are equal to 2.
Introduction to the theory of complexity
1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.
On the Complexity of Protein Folding
We show that the protein folding problem in the two-dimensional H-P model is NP-complete.
MeDuSa: a multi-draft based scaffolder
MeDuSa formalizes the scaffolding problem by means of a combinatorial optimization formulation on graphs and implements an efficient constant factor approximation algorithm to solve it, which does not require either prior knowledge on the microrganisms dataset under analysis or the availability of paired end read libraries.
Structure in Approximation Classes
After defining a new approximation preserving reducibility to be used for as many approximation classes as possible, this paper gives the first examples of natural NPO-complete problems and the firstExamples of natural APX-intermediate problems.
A Uniform Approach to Define Complexity Classes
Completeness in Approximation Classes
It is shown that the degree structure of NPO allows intermediate degrees, that is, if P≠NP, there are problems which are neither complete nor belong to a lower class, and natural approximation preserving reductions are defined.