Bruno Escoffier

	2012
47		Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire: Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC 2012: 202-213
46		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij: Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012)
	2011
45		Bruno Escoffier, Laurent Gourvès, Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard: Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81
44		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: The Price of Optimum in a Matching Game. SAGT 2011: 81-92
43		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discrete Applied Mathematics 159(17): 1954-1970 (2011)
	2010
42		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. CIAC 2010: 155-166
41		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13
40		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261
39		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij: A Bottom-Up Method and Fast Algorithms for max independent set. SWAT 2010: 62-73
38		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij: Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). TAMC 2010: 373-384
37		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Minimum regulation of uncoordinated matchings CoRR abs/1012.3889: (2010)
36		Bruno Escoffier, Vangelis Th. Paschos: A survey on the structure of approximation classes. Computer Science Review 4(1): 19-40 (2010)
35		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard: Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. European Journal of Operational Research 205(1): 19-30 (2010)
34		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010)
33		Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini: Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411(44-46): 3994-4004 (2010)
	2009
32		Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos: Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13
31		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518
30		Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos: Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Operations Research 4(2): 86-94 (2009)
29		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)
28		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Fast algorithms for min independent dominating set CoRR abs/0905.1993: (2009)
27		Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics 157(4): 819-832 (2009)
26		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009)
25		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)
24		Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009)
23		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
22		Bruno Escoffier, Jérôme Lang, Meltem Öztürk: Single-peaked consistency and its complexity. ECAI 2008: 366-370
21		Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos: An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65
20		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
19		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)
18		Bruno Escoffier, Jérôme Monnot: A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008)
	2007
17		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
16		Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213
15		Bruno Escoffier: Polynomial approximation: a structural and operational study. 4OR 5(2): 161-164 (2007)
14		Bruno Escoffier, Peter L. Hammer: Approximation of the Quadratic Set Covering problem. Discrete Optimization 4(3-4): 378-386 (2007)
13		Bruno Escoffier, Vangelis Th. Paschos: Differential approximation of min sat. European Journal of Operational Research 181(2): 620-633 (2007)
12		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
11		Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207
10		Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006)
9		Bruno Escoffier, Vangelis Th. Paschos: On-line models and algorithms for max independent set. RAIRO - Operations Research 40(2): 129-142 (2006)
8		Bruno Escoffier, Vangelis Th. Paschos: Completeness in approximation classes beyond APX. Theor. Comput. Sci. 359(1-3): 369-377 (2006)
	2005
7		Bruno Escoffier, Vangelis Th. Paschos: Differential Approximation of min sat, max sat and Related Problems. ICCSA (4) 2005: 192-201
6		Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos: Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211
5		Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214
4		Bruno Escoffier, Vangelis Th. Paschos: Proving completeness by logic. Int. J. Comput. Math. 82(2): 151-161 (2005)
3		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		Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos: Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC 2004: 124-136
1		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

Coauthor Index

1	Giorgio Ausiello	[11] [24]
2	Cristina Bazgan	[2] [3]
3	Nicolas Bourgeois	[21] [23] [25] [26] [28] [29] [31] [32] [38] [39] [40] [43] [46]
4	Federico Della Croce	[6] [12] [25] [32]
5	Marc Demange	[1] [27]
6	Camil Demetrescu	[17] [33]
7	Laurent Gourvès	[16] [34] [35] [37] [41] [42] [44] [45]
8	Peter L. Hammer (Peter Ladislaw Hammer)	[14]
9	Jérôme Lang	[22]
10	Martin Milanic	[30]
11	Jérôme Monnot	[1] [5] [10] [11] [16] [18] [19] [20] [24] [27] [34] [35] [37] [41] [42] [44]
12	Gabriel Moruz	[17] [33]
13	Cécile Murat	[6] [25]
14	Meltem Öztürk	[22]
15	Vangelis Th. Paschos	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [21] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [36] [38] [39] [40] [43] [46] [47]
16	Fanny Pascual	[45]
17	Andrea Ribichini	[17] [33]
18	Johan M. M. van Rooij	[29] [38] [39] [46]
19	Olivier Spanjaard	[19] [20] [35] [45]
20	Nguyen Kim Thang	[45]
21	Emeric Tourniaire	[47]
22	Dominique de Werra	[1] [27]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page