The SCEAS System
| |||||||

## Search the dblp DataBase
Bruno Escoffier:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Bruno Escoffier
**Polynomial approximation: a structural and operational study.**[Citation Graph (0, 0)][DBLP] 4OR, 2007, v:5, n:2, pp:161-164 [Journal] **Strategic Coloring of a Graph.**[Citation Graph (, )][DBLP]**Single-peaked consistency and its complexity.**[Citation Graph (, )][DBLP]**Exact Algorithms for Dominating Clique Problems.**[Citation Graph (, )][DBLP]**An O*(1.0977**[Citation Graph (, )][DBLP]^{n}) Exact Algorithm for max independent set in Sparse Graphs.**On the Impact of Local Taxes in a Set Cover Game.**[Citation Graph (, )][DBLP]**Fast Algorithms for min independent dominating set.**[Citation Graph (, )][DBLP]**Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.**[Citation Graph (, )][DBLP]**A Bottom-Up Method and Fast Algorithms for max independent set.**[Citation Graph (, )][DBLP]**Maximum Independent Set in Graphs of Average Degree at Most Three in**[Citation Graph (, )][DBLP]*O*(1.08537^{n}){\mathcal O}(1.08537^n).**Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.**[Citation Graph (, )][DBLP]**Complexity and Approximation Results for the Connected Vertex Cover Problem.**[Citation Graph (, )][DBLP]**Fast Algorithms for Max Independent Set in Graphs of Small Average Degree**[Citation Graph (, )][DBLP]**Fast algorithms for min independent dominating set**[Citation Graph (, )][DBLP]**Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.**[Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.021secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |