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 |

Exponential approximation schemata for some network design problems

N. Boria, N. Bourgeois, B. Escoffier, V. Th. Paschos,
Cahiers du Lamsade, Mars 2011

Read more

Fast Algorithms for Max Independent Set

N. Bourgeois, B. Escoffier, V. Th. Paschos and J.M.M Van Rooij,
Algorithmica, Vol. 62 (1-2), pages 382-415, 2012

Read more

Fast Algorithms for MIN INDEPENDENT DOMINATING SET

N. Bourgeois, B. Escoffier, V. Th. Paschos,
SIROCCO 2010, LNCS 6058

Read more

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs

E. Angel, R. Campigotto and C. Laforest,
SEA 2012, LNCS 7276, pages 39–50, Bordeaux, 7–9 June

Read more

Low Complexity Scheduling Algorithms Minimizing the Energy for Tasks with Agreeable Deadlines

E. Angel, E. Bampis and V. Chau,
LATIN 2012, LNCS 7256, pages 13-24

Read more

Maximum Independent Set in Graphs of Average Degree at Most Three in 0(1.08537^n)

N. Bourgeois, B. Escoffier, V. Th. Paschos, J.M.M. van Rooij,
TAMC 2010, LNCS 6108

Read more

Mise en œuvre d’heuristiques capables de traiter de très grands graphes pour le problème du Vertex Cover

E. Angel, R. Campigotto and C. Laforest,
(résumé de 2 pages), ROADEF 2012, Université Catholique de l’Ouest, Angers, 11-13 avril

Read more

Moderately Exponential Approximation

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

Read more

New approximability and FPT results on Edge Dominating Set

B. Escoffier, J. Monnot, V. Th. Paschos and M. Xiao

Read more

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond

K. Dabrowski, M. Demange and V. V. Lozin,
Theoretical Computer Science, soumis

Read more

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