2009 |
24 | EE | 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) |
23 | EE | 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) |
22 | EE | 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 |
21 | EE | Bruno Escoffier,
Jérôme Lang,
Meltem Öztürk:
Single-peaked consistency and its complexity.
ECAI 2008: 366-370 |
20 | EE | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent setin Sparse Graphs.
IWPEC 2008: 55-65 |
19 | EE | Bruno Escoffier,
Jérôme Monnot,
Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.
SOFSEM 2008: 280-291 |
18 | EE | Bruno Escoffier,
Jérôme Monnot,
Olivier Spanjaard:
Some tractable instances of interval data minmax regret problems.
Oper. Res. Lett. 36(4): 424-429 (2008) |
17 | EE | Bruno Escoffier,
Jérôme Monnot:
A better differential approximation ratio for symmetric TSP.
Theor. Comput. Sci. 396(1-3): 63-70 (2008) |
2007 |
16 | EE | Camil Demetrescu,
Bruno Escoffier,
Gabriel Moruz,
Andrea Ribichini:
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.
MFCS 2007: 194-205 |
15 | EE | Bruno Escoffier,
Laurent Gourvès,
Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem.
WG 2007: 202-213 |
14 | EE | Bruno Escoffier:
Polynomial approximation: a structural and operational study.
4OR 5(2): 161-164 (2007) |
13 | EE | Bruno Escoffier,
Peter L. Hammer:
Approximation of the Quadratic Set Covering problem.
Discrete Optimization 4(3-4): 378-386 (2007) |
12 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Differential approximation of min sat.
European Journal of Operational Research 181(2): 620-633 (2007) |
11 | EE | Federico Della Croce,
Bruno Escoffier,
Vangelis Th. Paschos:
Improved worst-case complexity for the MIN 3-SET COVERING problem.
Oper. Res. Lett. 35(2): 205-210 (2007) |
2006 |
10 | EE | Giorgio Ausiello,
Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours.
SWAT 2006: 196-207 |
9 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results.
Inf. Process. Lett. 97(3): 98-103 (2006) |
8 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Completeness in approximation classes beyond APX.
Theor. Comput. Sci. 359(1-3): 369-377 (2006) |
2005 |
7 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Differential Approximation of min sat, max sat and Related Problems.
ICCSA (4) 2005: 192-201 |
6 | EE | Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs.
ICCSA (4) 2005: 202-211 |
5 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results.
ICTCS 2005: 205-214 |
4 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Proving completeness by logic.
Int. J. Comput. Math. 82(2): 151-161 (2005) |
3 | EE | Cristina Bazgan,
Bruno Escoffier,
Vangelis Th. Paschos:
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness.
Theor. Comput. Sci. 339(2-3): 272-292 (2005) |
2004 |
2 | EE | Cristina Bazgan,
Bruno Escoffier,
Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.
ISAAC 2004: 124-136 |
1 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Dominique de Werra,
Marc Demange,
Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
ISAAC 2004: 896-907 |