Partenaires

CNRS
Nom tutelle 1 Nom tutelle 2
Nom tutelle 3 Nom tutelle 4


Search


Home > Publications

Publications

Page(s) : < | 1 | 2 | 3 | 4 | 5 |

Algorithms for the Vertex Cover Problem on Large Graphs

E. Angel, R. Campigotto, C. Laforest,
Rapport de recherche IBISC N° 2010-01

Read more

An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems

N. Bourgeois, B. Escoffier and V. Th. Paschos,
Chapter 15 of the book Combinatorial Optimization: Recent Progress,
A.R. Mahjoub Editor, Iste - Wiley and Sons, (...)

Read more

Analytical and experimental comparison of six algorithms for the vertex cover problem

François Delbot, Christian Laforest,
ACM Journal of Experimental Algorithmics, Vol. 15

Read more

Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms

B. Escoffier, V. Th. Paschos and E. Tourniaire,
TAMC 2012, LNCS (préliminary version in Cahiers du Lamsade, March 2011), to appear

Read more

Approximating the max edge-coloring problem

N. Bourgeois, G. Lucarelli, I. Milis, V. Th. Paschos,
IWOCA 2009, LNCS 5874 and Theoretical Computer Science 411, 2010

Read more

Approximation of the Clustered Set Covering Problem

Laurent Alfandari, Jérôme Monnot,
ISCO 2010, Electronic Notes in Discrete Mathematics (to appear)

Read more

Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms

N. Bourgeois, B. Escoffier, V. Th. Paschos,
WADS 2009, LNCS 5664

Read more

Exact algorithms for dominating clique problems

N. Bourgeois, F. Della Croce, B. Escoffier, V. Th. Paschos,
ISAAC 2009, LNCS 5878 and Algorithmica (to appear)

Read more

Page(s) : < | 1 | 2 | 3 | 4 | 5 |