 | 2009 |
|---|
| 8 |       | Nicolas Bourgeois,
Giorgio Lucarelli,
Ioannis Milis,
Vangelis Th. Paschos:
Approximating the Max Edge-Coloring Problem.
IWOCA 2009: 83-94 |
| 7 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.
WADS 2009: 507-518 |
| 6 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos,
Johan M. M. van Rooij:
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree
CoRR abs/0901.1563: (2009) |
| 5 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
Fast algorithms for min independent dominating set
CoRR abs/0905.1993: (2009) |
| 4 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms.
Inf. Process. Lett. 109(16): 950-954 (2009) |
| 3 | | Nicolas Bourgeois,
Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim. 17(3): 274-311 (2009) |
| 2 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms.
Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) |
| 2008 |
|---|
| 1 | | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs.
IWPEC 2008: 55-65 |
