Search the dblp DataBase

Publications of Author

1. Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
   Probabilistic Coloring of Bipartite and Split Graphs. [Citation Graph (0, 0)][DBLP]
   ICCSA (4), 2005, pp:202-211 [Conf]
   
2. Bruno Escoffier, Vangelis Th. Paschos
   Differential Approximation of min sat, max sat and Related Problems. [Citation Graph (0, 0)][DBLP]
   ICCSA (4), 2005, pp:192-201 [Conf]
   
3. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
   Weighted Coloring: Further Complexity and Approximability Results. [Citation Graph (0, 0)][DBLP]
   ICTCS, 2005, pp:205-214 [Conf]
   
4. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
   Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2004, pp:124-136 [Conf]
   
5. 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. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2004, pp:896-907 [Conf]
   
6. Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
   Reoptimization of Minimum and Maximum Traveling Salesman's Tours. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:196-207 [Conf]
   
7. Bruno Escoffier, Vangelis Th. Paschos
   Proving completeness by logic. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Math., 2005, v:82, n:2, pp:151-161 [Journal]
   
8. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
   Weighted Coloring: further complexity and approximability results. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:3, pp:98-103 [Journal]
   
9. Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
   Improved worst-case complexity for the MIN 3-SET COVERING problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2007, v:35, n:2, pp:205-210 [Journal]
   
10. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
    Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:272-292 [Journal]
    
11. Bruno Escoffier, Vangelis Th. Paschos
    Completeness in approximation classes beyond APX. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:369-377 [Journal]
    
12. Bruno Escoffier, Vangelis Th. Paschos
    Differential approximation of min sat. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:2, pp:620-633 [Journal]
    
13. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
    Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:194-205 [Conf]
    
14. Bruno Escoffier
    Polynomial approximation: a structural and operational study. [Citation Graph (0, 0)][DBLP]
    4OR, 2007, v:5, n:2, pp:161-164 [Journal]
    
15. 
    Strategic Coloring of a Graph. [Citation Graph (, )][DBLP]
    
    
16. 
    Single-peaked consistency and its complexity. [Citation Graph (, )][DBLP]
    
    
17. 
    Exact Algorithms for Dominating Clique Problems. [Citation Graph (, )][DBLP]
    
    
18. 
    An O*(1.0977ⁿ) Exact Algorithm for max independent set in Sparse Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    On the Impact of Local Taxes in a Set Cover Game. [Citation Graph (, )][DBLP]
    
    
20. 
    Fast Algorithms for min independent dominating set. [Citation Graph (, )][DBLP]
    
    
21. 
    Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. [Citation Graph (, )][DBLP]
    
    
22. 
    A Bottom-Up Method and Fast Algorithms for max independent set. [Citation Graph (, )][DBLP]
    
    
23. 
    Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537ⁿ){\mathcal O}(1.08537^n). [Citation Graph (, )][DBLP]
    
    
24. 
    Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. [Citation Graph (, )][DBLP]
    
    
25. 
    Complexity and Approximation Results for the Connected Vertex Cover Problem. [Citation Graph (, )][DBLP]
    
    
26. 
    Fast Algorithms for Max Independent Set in Graphs of Small Average Degree [Citation Graph (, )][DBLP]
    
    
27. 
    Fast algorithms for min independent dominating set [Citation Graph (, )][DBLP]
    
    
28. 
    Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. [Citation Graph (, )][DBLP]